4202. 穿过圆
思路:
y总题解
b
i
t
s
e
t
bitset
bitset 优化的思路非常巧妙
s
t
[
i
]
[
j
]
=
1
st[i][j]=1
st[i][j]=1 表示第
i
i
i 个点不在第
j
j
j 圆内,这个状态设成在圆内圆外不影响
如果一个点在圆内,另一个在圆外,那么这个圆是必须要穿过的
b
i
t
s
e
t
bitset
bitset 的异或一下求
1
1
1 的个数即可
code:
#include<bits/stdc++.h>
#define endl '\n'
#define ll long long
#define ull unsigned long long
#define ld long double
#define all(x) x.begin(), x.end()
#define mem(x, d) memset(x, d, sizeof(x))
#define eps 1e-6
using namespace std;
const int maxn = 1e3 + 9;
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
ll n, m;
bitset <maxn> st[maxn];
struct node{
int x, y;
}a[maxn];
struct circle{
int r, x, y;
}b[maxn];
bool check(int i, int j){
ll d = 1ll * (a[i].x-b[j].x)*(a[i].x-b[j].x) + 1ll * (a[i].y-b[j].y)*(a[i].y-b[j].y);
return d > 1ll * b[j].r * b[j].r;
}
void work()
{
int q;cin >> n >> m >> q;
for(int i = 1; i <= n; ++i) cin >> a[i].x >> a[i].y;
for(int i = 1; i <= m; ++i) cin >> b[i].r >> b[i].x >> b[i].y;
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= m; ++j)
st[i][j] = check(i, j);
while(q--){
int x, y;cin >> x >> y;
cout << (st[x] ^ st[y]).count() << endl;
}
}
int main()
{
ios::sync_with_stdio(0);
// int TT;cin>>TT;while(TT--)
work();
return 0;
}