oj.uz

Submission #86077

# Submission time Handle Problem Language Result Execution time Memory
86077 2018-11-24T16:42:06 Z Ort Kocka (COCI18_kocka) C++11
70 / 70
 58 ms 1444 KB 
#include<iostream>
 
using namespace std;
 
int r[100005];
int s[100005];
 
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n; 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) goto ne;
                    continue;
                }
                else if(r[j] == -1 || s[n - a - 1] == -1) goto ne;
                r[j] = 1;
                s[n - a - 1] = 1;
            }
            else if(i == 2) {
                if(a == -1) {
                    if(s[j] == 1) goto ne;
                    continue;
                }
                else if(s[j] == -1 || r[a] == -1) goto ne;
                r[a] = 1;
                s[j] = 1;
            }
            else if(i == 3) {
                if(a == -1) {
                    if(s[j] == 1) goto ne;
                    continue;
                }
                else if(s[j] == -1 || r[n - a - 1] == -1) goto ne;
                r[n - a - 1] = 1;
                s[j] = 1;
            }
        }
    }
    cout << "DA";
    return 0;
    ne:
    cout << "NE";
    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 500 KB Output is correct
3 Correct 2 ms 500 KB Output is correct
4 Correct 2 ms 500 KB Output is correct
5 Correct 2 ms 524 KB Output is correct
6 Correct 2 ms 540 KB Output is correct

Subtask #2
14.0 / 14.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 1384 KB Output is correct
2 Correct 26 ms 1404 KB Output is correct
3 Correct 30 ms 1408 KB Output is correct
4 Correct 34 ms 1408 KB Output is correct
5 Correct 19 ms 1408 KB Output is correct
6 Correct 17 ms 1408 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 1408 KB Output is correct
2 Correct 32 ms 1408 KB Output is correct
3 Correct 15 ms 1408 KB Output is correct
4 Correct 49 ms 1408 KB Output is correct
5 Correct 37 ms 1408 KB Output is correct
6 Correct 58 ms 1444 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 1444 KB Output is correct
2 Correct 31 ms 1444 KB Output is correct
3 Correct 22 ms 1444 KB Output is correct
4 Correct 21 ms 1444 KB Output is correct
5 Correct 20 ms 1444 KB Output is correct
6 Correct 32 ms 1444 KB Output is correct