QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #790885 | #3873. Towers | _FJqwq | 0 | 139ms | 11640kb | C++14 | 314b | 2024-11-28 15:52:25 | 2024-11-28 15:52:25 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N=1000005;
int n,c1[N],c2[N];
int main(){
scanf("%d",&n);
for(int i=1,x,y;i<=n;i++){
scanf("%d%d",&x,&y);
if((c1[x]<=1)&&(c2[y]<=1)){
printf("1");
c1[x]++,c2[y]++;
}
else printf("0");
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 5
Accepted
time: 0ms
memory: 3848kb
input:
2 869400 218695 664808 31410
output:
11
result:
ok
Test #2:
score: 5
Accepted
time: 0ms
memory: 3788kb
input:
2 195447 154323 271823 133730
output:
11
result:
ok
Test #3:
score: 5
Accepted
time: 0ms
memory: 3840kb
input:
3 751594 545975 951568 859051 621150 686048
output:
111
result:
ok
Test #4:
score: 5
Accepted
time: 0ms
memory: 3856kb
input:
3 404592 259430 770816 43371 147329 582162
output:
111
result:
ok
Test #5:
score: 5
Accepted
time: 0ms
memory: 3896kb
input:
3 401670 296316 401670 809250 401670 595959
output:
110
result:
ok
Test #6:
score: 0
Wrong Answer
time: 0ms
memory: 3772kb
input:
3 657802 927690 657802 872623 657802 83083
output:
110
result:
wrong answer
Subtask #2:
score: 0
Skipped
Dependency #1:
0%
Subtask #3:
score: 0
Wrong Answer
Test #26:
score: 0
Wrong Answer
time: 9ms
memory: 3840kb
input:
92690 1 1 1 2 1 3 1 4 1 5 1 6 1 7 1 8 1 9 1 10 1 11 1 12 1 13 1 14 1 15 1 16 1 17 1 18 1 19 1 20 1 21 1 22 1 23 1 24 1 25 1 26 1 27 1 28 1 29 1 30 1 31 1 32 1 33 1 34 1 35 1 36 1 37 1 38 1 39 1 40 1 41 1 42 1 43 1 44 1 45 1 46 1 47 1 48 1 49 1 50 1 51 1 52 1 53 1 54 1 55 1 56 1 57 1 58 1 59 1 60 1 6...
output:
110000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...
result:
wrong answer
Subtask #4:
score: 0
Wrong Answer
Test #38:
score: 0
Wrong Answer
time: 121ms
memory: 7208kb
input:
1000000 1 18543 4 40327 7 19084 8 44274 10 42366 12 22173 13 9862 15 44706 19 48070 21 13389 24 39273 26 18680 27 46858 28 46126 32 27753 34 28289 36 12220 38 39235 42 28505 45 47348 46 34220 48 47551 50 49156 54 8856 55 25515 56 21932 58 24482 59 20686 61 41381 66 30112 67 44504 70 24510 71 26418 7...
output:
111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111...
result:
wrong answer
Subtask #5:
score: 0
Skipped
Dependency #2:
0%
Subtask #6:
score: 0
Skipped
Dependency #5:
0%
Subtask #7:
score: 0
Wrong Answer
Test #85:
score: 0
Wrong Answer
time: 139ms
memory: 11640kb
input:
1000000 1 602300 1 778881 2 397065 3 291452 3 678039 5 235300 6 499367 8 8597 10 327718 10 516489 12 416542 12 440048 13 284169 13 383581 13 642202 13 770858 14 378154 14 710033 15 905531 16 50155 17 142259 19 395613 19 500321 20 358934 21 461772 24 562953 24 995887 25 421244 27 900412 29 301006 31 ...
output:
111111111111110011111111111111110111111011110110111111111111111111111111111111111110111111011111111111111001111101111111111111111111111100111101111100110011110111111111100011111111111111100011111111110111111101111111111111111011111111111111111110111111111011111111101111111111111111111111111011001111...
result:
wrong answer