newcoder假日团队赛7K-GameofLines

 1 #include 
 2 #include 
 3   
 4 using namespace std;
 5   
 6 typedef long long ll;
 7 typedef char ch;
 8 typedef double db;
 9   
10 void quick_sort(double q[],int l,int r)
11 {
12     if(l >= r) return;
13  
14     int i=l-1,j=r+1;
15     double x=q[(l + r) >> 1];
16     while(i<j){
17         do i ++; while (q[i] < x);
18         do j --; while (q[j] > x);
19         if(i < j) swap(q[i] , q[j]);
20     }
21     quick_sort(q, l, j);
22     quick_sort(q, j + 1, r);
23 }
24  
25 int main()
26 {
27     double x[300] = {0};
28     double y[300] = {0};
29     double a[50000] = {0};
30     int marker = 0;
31     int n, score = 0;
32       
33     cin >> n;
34     for(int j = 0;j)
35     {
36         scanf("%lf %lf",&x[j],&y[j]);
37     }
38     int L = 0;
39     for(int j = 0;j1;j++)
40     {
41         for(int k = j+1;k)
42         {
43             if(x[j] == x[k])
44             {
45                 marker = 1;
46             }
47             else
48             {
49                 a[L++] = double(y[k]-y[j])/(x[k]-x[j]);
50             }
51         }
52     }
53         //cout<
54     quick_sort(a,0,L-1);
55          
56         /*for(int j = 0;j57         {
58             cout<59         }*/
60     if(n > 2)
61     {
62             for(int j = 0;j1 ;j++)
63         {
64             if(a[j]!=a[j+1]) score++;
65         }
66         score++;
67     }
68     if(marker)
69     {
70         score+=1;
71            // cout<<'!';
72     }
73     if(L == 0) score--;
74     cout<endl;
75     return 0;
76 }