# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
170333 | ngmh | 마술 (GCJ14_magic) | C++11 | 3 ms | 504 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
long long t, n, m, a[4][4], b[4][4], ans;
bool stop = false;
int main(){
cin >> t;
for(int i = 1; i <= t; i++){
stop = false;
ans = -1;
cin >> n;
for(int j = 0; j < 4; j++){
for(int k = 0; k < 4; k++) cin >> a[j][k];
}
cin >> m;
for(int j = 0; j < 4; j++){
for(int k = 0; k < 4; k++) cin >> b[j][k];
}
for(int j = 0; j < 4; j++){
for(int k = 0; k < 4; k++){
if(a[n-1][j] == b[m-1][k]){
if(ans != -1){
stop = true;
cout << "Case #" << i << ": Bad magician!\n";
} else ans = a[n-1][j];
}
if(stop) break;
}
if(stop) break;
}
if(stop) continue;
if(ans == -1) cout << "Case #" << i << ": Volunteer cheated!\n";
else cout << "Case #" << i << ": " << ans << "\n";
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |