oj.uz

Submission #107076

# Submission time Handle Problem Language Result Execution time Memory
107076 2019-04-21T20:19:25 Z aryaman Kocka (COCI18_kocka) C++14
70 / 70
 57 ms 4344 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> ii;
typedef tuple<int, int, int> iii;

typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<ld> vd;
typedef vector<ll> vl;
 
#define mp make_pair
#define pb push_back
#define f first
#define s second

void ne() {
    cout << "NE" << endl;
    exit(0);
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n;
    cin >> n;
    vi l(n), r(n), u(n), d(n);
    for (int i = 0; i < n; i++) {
        cin >> r[i];
        if (r[i] == -1) r[i] = n;
    }
    for (int i = 0; i < n; i++) {
        cin >> l[i];
        if (l[i] == -1) l[i] = n;
    }
    for (int i = 0; i < n; i++) {
        cin >> u[i];
        if (u[i] == -1) u[i] = n;
    }
    for (int i = 0; i < n; i++) {
        cin >> d[i];
        if (d[i] == -1) d[i] = n;
    }

    for (int i = 0; i < n; i++) {
        if (u[i] != n) {
            if (r[u[i]] == n or l[u[i]] == n or d[i] == n) ne();
            if (u[i] + d[i] >= n) ne();
            if (r[u[i]] > i or (n - l[u[i]] - 1 < i)) ne();
        }
        if (d[i] != n) {
            if (r[n - d[i] - 1] == n or l[n - d[i] - 1] == n or u[i] == n) ne();
            if ((r[n - d[i] - 1] > i) or (n - l[n - d[i] - 1] - 1 < i)) ne();
        }
        if (r[i] != n) {
            if (u[r[i]] == n or d[r[i]] == n or l[i] == n) ne();
            if (r[i] + l[i] >= n) ne();
            if (u[r[i]] > i or (n - d[r[i]] - 1 < i)) ne();
        }
        if (l[i] != n) {
            if (u[n - l[i] - 1] == n or d[n - l[i] - 1] == n or r[i] == n) ne();
            if ((u[n - l[i] - 1] > i) or (n - d[n - l[i] - 1] - 1 < i)) ne();
        }
    }
    
    cout << "DA" << endl;
}

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 3756 KB Output is correct
2 Correct 39 ms 4216 KB Output is correct
3 Correct 36 ms 4268 KB Output is correct
4 Correct 33 ms 3252 KB Output is correct
5 Correct 57 ms 4248 KB Output is correct
6 Correct 41 ms 4216 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 3960 KB Output is correct
2 Correct 28 ms 3064 KB Output is correct
3 Correct 40 ms 4344 KB Output is correct
4 Correct 31 ms 3192 KB Output is correct
5 Correct 37 ms 4216 KB Output is correct
6 Correct 53 ms 3960 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 3832 KB Output is correct
2 Correct 35 ms 3064 KB Output is correct
3 Correct 48 ms 4264 KB Output is correct
4 Correct 35 ms 4216 KB Output is correct
5 Correct 41 ms 4344 KB Output is correct
6 Correct 29 ms 3192 KB Output is correct