QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#169098 | #7029. Xu Xiake in Henan Province | Ycfhnnd | AC ✓ | 3ms | 3664kb | C++17 | 751b | 2023-09-09 12:20:36 | 2023-09-09 12:20:38 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
constexpr int N = 5e5 + 10;
int n, m;
int a[N], b[N];
void solve(){
int cnt = 0;
for (int i = 0; i < 4;i ++ ){
int x;
cin >> x;
cnt += !!x;
}
if (cnt == 0){
cout << "Typically Otaku\n";
}else if (cnt == 1){
cout << "Eye-opener\n";
}else if (cnt == 2){
cout << "Young Traveller\n";
}else if (cnt == 3){
cout << "Excellent Traveller\n";
}else{
cout << "Contemporary Xu Xiake\n";
}
}
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int T = 1;
cin >> T;
while (T -- ){
solve();
}
return 0;
}
这程序好像有点Bug,我给组数据试试?
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3576kb
input:
5 0 0 0 0 0 0 0 1 1 1 0 0 2 1 1 0 1 2 3 4
output:
Typically Otaku Eye-opener Young Traveller Excellent Traveller Contemporary Xu Xiake
result:
ok 5 lines
Test #2:
score: 0
Accepted
time: 3ms
memory: 3664kb
input:
10000 0 3 0 0 0 0 1 0 0 0 0 0 0 3 0 22 0 3 0 2 2 0 0 0 9 0 6 37 0 0 0 0 9 2 0 0 1 0 0 0 0 0 5 1 3 6 0 0 2 3 8 0 0 3 0 1 0 25 0 2 0 2 0 0 3 0 0 0 3 13 0 6 0 0 0 3 0 0 28 0 0 0 3 1 21 32 0 0 2 0 0 0 45 0 0 12 4 0 0 0 0 0 0 6 0 0 0 0 24 0 3 0 0 5 28 0 1 10 10 2 0 7 0 0 3 1 24 1 2 2 0 78 0 0 41 0 6 4 0 ...
output:
Eye-opener Eye-opener Typically Otaku Young Traveller Young Traveller Eye-opener Excellent Traveller Typically Otaku Young Traveller Eye-opener Young Traveller Young Traveller Excellent Traveller Young Traveller Young Traveller Eye-opener Eye-opener Excellent Traveller Eye-opener Eye-opener Young Tr...
result:
ok 10000 lines