QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#258583 | #7066. Best Player | He2717970784 | AC ✓ | 0ms | 3824kb | C++17 | 520b | 2023-11-19 20:31:19 | 2023-11-19 20:31:19 |
Judging History
answer
#include<iostream>
#include<algorithm>
#include<set>
using namespace std;
int main() {
set<pair<int,int>>X, Y, Z;
int n = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
int x = 0, y = 0, z = 0;
cin >> x >> y >> z;
X.insert(make_pair(y,z));
Y.insert(make_pair(x, z));
Z.insert(make_pair(x, y));
}
int num = max(X.size(), max(Y.size(), Z.size()));
if (X.size() == num) {
cout << "X\n";
}
else if (Y.size() == num) {
cout << "Y\n";
}
else {
cout << "Z\n";
}
return 0;
}
这程序好像有点Bug,我给组数据试试?
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3824kb
input:
2 1 1 1 1 2 1
output:
X
result:
ok single line: 'X'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3812kb
input:
3 1 2 9 1 2 2 2 2 9
output:
Y
result:
ok single line: 'Y'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3528kb
input:
4 -100 -100 100 -100 100 100 100 -100 100 100 100 100
output:
Z
result:
ok single line: 'Z'
Test #4:
score: 0
Accepted
time: 0ms
memory: 3472kb
input:
1 -100 100 -100
output:
X
result:
ok single line: 'X'
Test #5:
score: 0
Accepted
time: 0ms
memory: 3588kb
input:
3 1 1 1 1 2 1 1 3 1
output:
X
result:
ok single line: 'X'
Test #6:
score: 0
Accepted
time: 0ms
memory: 3504kb
input:
4 1 2 9 1 2 -2 2 2 9 7 2 -2
output:
Y
result:
ok single line: 'Y'
Test #7:
score: 0
Accepted
time: 0ms
memory: 3588kb
input:
100 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...
output:
X
result:
ok single line: 'X'
Test #8:
score: 0
Accepted
time: 0ms
memory: 3468kb
input:
100 -1 0 1 1 0 0 -1 1 1 1 1 0 1 0 1 -1 -1 0 1 1 0 -1 0 -1 0 -1 0 1 -1 0 1 0 -1 0 1 -1 0 -1 1 0 0 -1 0 0 -1 -1 0 -1 -1 -1 1 0 -1 -1 -1 1 1 -1 1 -1 -1 0 1 0 1 1 0 0 -1 -1 0 -1 -1 1 -1 -1 0 -1 0 0 1 1 1 0 1 0 0 -1 0 0 0 0 -1 -1 1 0 1 0 -1 -1 0 1 0 -1 0 1 -1 0 0 0 1 -1 1 1 0 -1 -1 0 -1 0 1 1 0 1 0 -1 -1...
output:
X
result:
ok single line: 'X'
Test #9:
score: 0
Accepted
time: 0ms
memory: 3756kb
input:
100 5 1 5 -2 2 -1 -3 4 3 5 1 -5 -1 -2 0 -4 3 3 -1 -5 -3 2 1 0 3 -3 2 -5 -4 -4 2 1 5 3 0 2 -3 1 -5 5 -1 -4 -5 5 5 -1 -3 2 -2 -1 -2 1 3 -3 2 -2 3 5 -2 5 2 -3 0 3 -1 2 -4 -5 -4 2 1 1 -2 5 1 5 4 -3 2 5 -1 0 4 -4 -4 4 -5 2 -3 -1 5 5 -5 3 4 -4 5 2 0 3 5 -1 -1 -3 2 3 -3 -5 -4 -1 -5 2 -1 -1 -2 -5 -1 -4 -2 2...
output:
X
result:
ok single line: 'X'
Test #10:
score: 0
Accepted
time: 0ms
memory: 3800kb
input:
100 6 -2 -2 -5 1 -6 6 -6 7 6 3 4 9 -7 8 -9 -2 -6 -9 1 6 -9 -1 0 -6 -10 -5 -1 9 -10 -7 7 -7 6 4 2 10 0 -1 -7 -5 -8 2 -1 6 6 1 -4 -6 -8 -7 3 -1 -2 -10 2 -5 7 -1 -10 -7 -5 6 -8 -7 7 -8 1 6 6 0 -5 -5 -1 -4 4 -10 -4 2 -6 -9 1 0 7 8 -5 2 -4 9 7 2 -1 0 8 2 -1 10 -2 -4 3 10 6 1 -10 -4 -4 -3 6 -1 -8 7 -1 1 7...
output:
Z
result:
ok single line: 'Z'
Test #11:
score: 0
Accepted
time: 0ms
memory: 3800kb
input:
100 -5 -3 -14 3 9 -1 10 -3 -12 3 10 -10 -7 20 -5 -20 4 11 4 -5 -12 8 7 0 -8 15 0 -4 -6 -3 -11 8 -4 -13 8 -8 16 6 3 -12 20 -14 11 -5 -6 10 17 2 -11 1 -3 -2 8 14 -14 -13 10 4 4 -9 4 -2 -6 -16 11 -14 18 5 1 -1 13 9 0 15 -6 3 16 -2 12 8 -7 17 -17 7 1 -11 -4 16 -20 1 -12 10 16 -13 2 -18 -18 10 12 -7 -18 ...
output:
Y
result:
ok single line: 'Y'
Test #12:
score: 0
Accepted
time: 0ms
memory: 3548kb
input:
100 43 47 16 41 -32 -37 -23 -22 43 34 -4 41 -50 -18 30 41 -41 -7 -27 2 -39 -20 49 -5 -20 -35 9 18 -16 1 48 -39 -49 6 7 -42 -31 -34 49 -34 -27 39 -46 17 -1 -34 -39 -47 -9 -2 -23 31 -45 -3 -47 -3 -23 -44 46 29 40 -21 19 33 -49 -20 -47 43 39 43 -4 22 -45 29 -7 -14 -41 38 -1 -38 13 -4 50 -10 28 -30 8 -1...
output:
Y
result:
ok single line: 'Y'
Test #13:
score: 0
Accepted
time: 0ms
memory: 3760kb
input:
100 81 -79 67 78 -88 -48 -22 59 -77 74 -11 44 -88 -47 -90 -14 -82 11 71 18 57 23 -90 -55 18 61 -34 54 76 68 -37 33 -46 12 80 -46 -5 37 -27 -86 -71 -53 74 15 -21 47 74 -83 6 24 74 -62 -30 -58 6 2 -28 2 -33 7 -22 -80 -84 -61 -25 -89 46 -78 -19 -69 -87 34 54 82 66 48 -39 -63 -41 -29 -67 47 42 -40 47 47...
output:
X
result:
ok single line: 'X'
Test #14:
score: 0
Accepted
time: 0ms
memory: 3540kb
input:
100 67 15 44 2 -14 -74 -19 -43 73 56 25 41 -9 60 -6 51 64 -29 -87 -37 63 -95 -8 -32 -1 -42 -44 -13 61 29 -15 41 9 -71 42 -59 62 -22 -73 -57 87 53 -26 23 -38 7 -47 26 -21 48 62 52 -69 45 -54 -6 -85 52 8 -42 49 -66 24 27 -51 -12 -57 59 94 14 -70 -55 50 -71 30 92 -19 -68 -31 69 -73 35 -91 56 -4 12 67 8...
output:
X
result:
ok single line: 'X'
Test #15:
score: 0
Accepted
time: 0ms
memory: 3608kb
input:
100 -84 57 14 76 53 7 91 -58 86 -8 -4 -97 4 45 -61 82 -64 -43 -83 -59 87 -48 -23 92 98 27 19 18 -51 -65 -76 -61 -54 -8 12 -16 -42 42 -29 -59 -82 29 94 68 90 -79 22 -82 41 91 -66 36 69 -61 -7 -64 25 26 -17 -18 35 48 15 -36 67 55 -15 -13 -85 7 -29 27 95 6 32 -85 88 44 75 -83 45 -95 -77 22 81 27 5 -26 ...
output:
Y
result:
ok single line: 'Y'