QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#89324 | #5668. Cell Nuclei Detection | FUCKUCUP | WA | 131ms | 105892kb | C++14 | 1.3kb | 2023-03-19 19:42:43 | 2023-03-19 19:42:46 |
Judging History
answer
#include<bits/stdc++.h>
#define ri register int
#define fp(i, a, b) for(ri i = (a), ed = (b); i <= ed; ++i)
#define fb(i, a, b) for(ri i = (a), ed = (b); i >= ed; --i)
using namespace std;
const int maxn = 100010, maxm = 2010;
int rd(){
int f = 1, x = 0; char ch = getchar();
while(ch > '9' || ch < '0'){ if(ch == '-')f = -1; ch = getchar(); }
while(ch <= '9' && ch >= '0'){ x = (x << 1) + (x << 3) + (ch ^ 48); ch = getchar(); }
return x * f;
}
int T, m, n, lx[maxn], ly[maxn], rx[maxn], ry[maxn], mx, my;
bool usd[maxn];
vector<int> vec[maxm][maxm];
int main(){
T = rd();
while(T--){
m = rd(), n = rd();
fp(i, 1, m+n)lx[i] = rd(), ly[i] = rd(), rx[i] = rd(), ry[i] = rd();
mx = my = 0;
fp(i, 1, m+n)mx = max(mx, rx[i]+4), my = max(my, ry[i]+4);
fp(i, 0, mx)fp(j, 0, my)vec[i][j].clear();
fp(i, m+1, m+n)vec[rx[i]][ry[i]].push_back(i);
fp(i, 1, m+n)usd[i] = 0;
fp(i, 1, m){
fp(x, lx[i], rx[i]+4)fp(y, ly[i], ry[i]+4){
for(auto &d : vec[x][y]){
int nlx = max(lx[i], lx[d]), nly = max(ly[i], ly[d]);
int nrx = min(rx[i], rx[d]), nry = min(ry[i], ry[d]);
if(nlx > nrx || nly > nry)continue;
if((nrx-nlx+1)*(nry-nly+1)*2 >= (rx[i]-lx[i]+1)*(ry[i]-ly[i]+1))usd[d] = 1;
}
}
}
int ans = 0;
fp(i, m+1, m+n)if(usd[i])++ans;
printf("%d\n", ans);
}
}
詳細信息
Test #1:
score: 100
Accepted
time: 20ms
memory: 98252kb
input:
3 2 2 1 1 3 3 3 3 5 5 2 2 4 4 4 4 6 6 2 3 1 1 3 3 3 3 5 5 1 3 3 5 2 1 4 5 3 1 5 3 3 3 1 1 2 2 2 2 3 3 3 3 4 4 1 1 3 3 2 2 4 4 3 3 5 5
output:
0 1 3
result:
ok 3 lines
Test #2:
score: 0
Accepted
time: 20ms
memory: 98244kb
input:
3 2 2 1 1 3 3 3 3 5 5 2 2 4 4 4 4 6 6 2 3 1 1 3 3 3 3 5 5 1 3 3 5 2 1 4 5 3 1 5 3 3 3 1 1 2 2 2 2 3 3 3 3 4 4 1 1 3 3 2 2 4 4 3 3 5 5
output:
0 1 3
result:
ok 3 lines
Test #3:
score: -100
Wrong Answer
time: 131ms
memory: 105892kb
input:
5 50000 50000 0 0 4 4 4 0 8 4 8 0 12 4 12 0 16 4 16 0 20 4 20 0 24 4 24 0 28 4 28 0 32 4 32 0 36 4 36 0 40 4 40 0 44 4 44 0 48 4 48 0 52 4 52 0 56 4 56 0 60 4 60 0 64 4 64 0 68 4 68 0 72 4 72 0 76 4 76 0 80 4 80 0 84 4 84 0 88 4 88 0 92 4 92 0 96 4 96 0 100 4 100 0 104 4 104 0 108 4 108 0 112 4 112 ...
output:
50000 50000 0 50000 3213
result:
wrong answer 5th lines differ - expected: '3150', found: '3213'