[HNOI2005]汤姆的游戏

嘟嘟嘟

直接O(n ^ 2)暴力判断就行了。

对于圆，判断该点和圆心的距离是否小于半径。

然而为啥我这么写编译不过：

 scanf("%lf%lf%lf%lf", &a[++cnt1].xl, &a[cnt1].yl, &a[cnt1].xr, &a[cnt1].yr);

++cnt1必须拎出来写？！……

 #include<cstdio>
 #include<iostream>
 #include<algorithm>
 #include<cmath>
 #include<cstring>
 #include<cstdlib>
 #include<vector>
 #include<queue>
 #include<stack>
 #include<cctype>
 using namespace std;
 #define enter puts("")
 #define space putchar(' ')
 #define Mem(a) memset(a, 0, sizeof(a))
 typedef long long ll;
 typedef double db;
 const int INF = 0x3f3f3f3f;
 const db eps = 1e-;
 const int maxn = 3e5 + ;
 const int maxm = 5e4 + ;
 inline ll read()
 {
     ll ans = ;
     char ch = getchar(), last = ' ';
     while(!isdigit(ch)) last = ch, ch = getchar();
     while(isdigit(ch)) ans = (ans << ) + (ans << ) + ch - '', ch = getchar();
     if(last == '-') ans = -ans;
     return ans;
 }
 inline void write(ll x)
 {
     if(x < ) putchar('-'), x = -x;
     if(x >= ) write(x / );
     putchar(x %  + '');
 }
 
 int n, m;
 struct Rec
 {
     db xl, yl, xr, yr;
 }a[maxn];
 struct Cir
 {
     db x, y, r;
 }b[maxn];
 int cnt1 = , cnt2 = ;
 
 int ans[maxm];
 void judge(const db& x, const db& y, const int& id)
 {
     for(int i = ; i <= cnt1; ++i)
     {
         if(a[i].yl <= a[i].yr)
         {
             if(a[i].xl < x && a[i].xr > x && a[i].yl < y && a[i].yr > y) ans[id]++;
         }
         else if(a[i].xl < x && a[i].xr > x && a[i].yr < y && a[i].yl > y) ans[id]++;
     }
     for(int i = ; i <= cnt2; ++i)
         if((x - b[i].x) * (x - b[i].x) + (y - b[i].y) * (y - b[i].y) < b[i].r * b[i].r) ans[id]++;
 }
 
 int main()
 {
     n = read(); m = read();
     for(int i = ; i <= n; ++i)
     {
         char c[]; scanf("%s", c);
         if(c[] == 'r')
         {
             cnt1++;
             scanf("%lf%lf%lf%lf", &a[cnt1].xl, &a[cnt1].yl, &a[cnt1].xr, &a[cnt1].yr);
             if(a[cnt1].xl > a[cnt1].xr) swap(a[cnt1].xl, a[cnt1].xr), swap(a[cnt1].yl, a[cnt1].yr);
         }
         else cnt2++, scanf("%lf%lf%lf", &b[cnt2].x, &b[cnt2].y, &b[cnt2].r);
     }
     for(int i = ; i <= m; ++i)
     {
         db x, y; scanf("%lf%lf", &x, &y);
         judge(x, y, i);
     }
     for(int i = ; i <= m; ++i) write(ans[i]), enter;
     return ;
 }