oj.uz

Submission #86096

# Submission time Handle Problem Language Result Execution time Memory
86096 2018-11-24T20:50:27 Z Ort Kocka (COCI18_kocka) C++14
70 / 70
 56 ms 1488 KB 
#include<iostream>
     
using namespace std;
     
int r[100002];
int s[100002];
     
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
	int n; bool f = 1; cin >> n;
    for(int i=0;i<4;i++) {
        for(int j=0;j<n;j++) {
            int a;
            cin >> a;
            if(i == 0) {
                if(a == -1) {
                    r[j] = -1;
                    continue;
                }
                r[j] = 1;
                s[a] = 1;
            }
            else if(i == 1) {
                if(a == -1) {
                    if(r[j] == 1) f = 0;
                    continue;
                }
                else if(r[j] == -1 || s[n - a - 1] == -1) f = 0;
                r[j] = 1;
                s[n - a - 1] = 1;
            }
            else if(i == 2) {
                if(a == -1) {
                    if(s[j] == 1) f = 0;
                    continue;
                }
                else if(s[j] == -1 || r[a] == -1) f = 0;
                r[a] = 1;
                s[j] = 1;
            }
            else if(i == 3) {
                if(a == -1) {
                    if(s[j] == 1) f = 0;
                    continue;
                }
                else if(s[j] == -1 || r[n - a - 1] == -1) f = 0;
                r[n - a - 1] = 1;
                s[j] = 1;
            }
        }
    }
    if(f) cout << "DA" << "\n";
    else cout << "NE" << "\n";
    return 0;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 408 KB Output is correct
4 Correct 2 ms 408 KB Output is correct
5 Correct 2 ms 408 KB Output is correct
6 Correct 3 ms 408 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 456 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 2 ms 484 KB Output is correct
4 Correct 2 ms 484 KB Output is correct
5 Correct 2 ms 484 KB Output is correct
6 Correct 2 ms 484 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 1300 KB Output is correct
2 Correct 49 ms 1304 KB Output is correct
3 Correct 56 ms 1304 KB Output is correct
4 Correct 35 ms 1304 KB Output is correct
5 Correct 52 ms 1428 KB Output is correct
6 Correct 48 ms 1428 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 1428 KB Output is correct
2 Correct 31 ms 1428 KB Output is correct
3 Correct 44 ms 1428 KB Output is correct
4 Correct 35 ms 1488 KB Output is correct
5 Correct 47 ms 1488 KB Output is correct
6 Correct 44 ms 1488 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 1488 KB Output is correct
2 Correct 30 ms 1488 KB Output is correct
3 Correct 46 ms 1488 KB Output is correct
4 Correct 46 ms 1488 KB Output is correct
5 Correct 50 ms 1488 KB Output is correct
6 Correct 30 ms 1488 KB Output is correct