oj.uz

Submission #170333

# Submission time Handle Problem Language Result Execution time Memory
170333 2019-12-24T20:09:27 Z ngmh 마술 (GCJ14_magic) C++11
6 / 6
 3 ms 504 KB 
#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";
        }
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 504 KB Output is correct