oj.uz

Submission #1019389

# Submission time Handle Problem Language Result Execution time Memory
1019389 2024-07-10T18:48:39 Z rockstar Kocka (COCI18_kocka) C++17
0 / 70
 22 ms 3932 KB 
#include <bits/stdc++.h>

using namespace std;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int n;
    cin >> n;
    vector<int> l(n), r(n), d(n), u(n);
    for (int &i: l)
        cin >> i;
    for (int &i: r)
        cin >> i;
    for (int &i: u)
        cin >> i;
    for (int &i: d)
        cin >> i;
    bool ok = true;
    for (int i = 0; i < n; ++i)
        if ((l[i] == -1 && r[i] != -1) || (l[i] != -1 && r[i] == -1) || (u[i] == -1 && d[i] != -1) || (u[i] != -1 && d[i] == -1) || (l[i] + r[i] >= n) || (u[i] + d[i] >= n) || u[l[i]] > i || d[l[i]] > (n - 1 - i) || u[r[i]] > i || u[r[i]] > n - 1 - i || u[l[i]] == -1 || d[l[i]] == -1 || u[r[i]] == -1 || d[r[i]] == -1 || l[u[i]] > i || l[d[i]] > (n - 1 - i) || r[u[i]] > i || r[u[i]] > n - 1 - i || l[u[i]] == -1 || l[d[i]] == -1 || r[u[i]] == -1 || r[d[i]] == -1)
            ok = false;
    cout << (ok ? "DA" : "NE");
}

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 1 ms 504 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 22 ms 3676 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 21 ms 3932 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 22 ms 3672 KB Output isn't correct
2 Halted 0 ms 0 KB -