oj.uz

Submission #228938

# Submission time Handle Problem Language Result Execution time Memory
228938 2020-05-03T06:24:57 Z kartel Kocka (COCI18_kocka) C++14
70 / 70
 57 ms 4280 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +100500
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e18)
#define el '\n'
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;

int l[N], r[N], d[N], u[N], i, n, can;

int main()
{
    srand(time(0));
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

//    in("input.txt");
//    out("output.txt");

    cin >> n;

    can = 1;

    for (i = 1; i <= n; i++) cin >> l[i];
    for (i = 1; i <= n; i++) cin >> r[i];
    for (i = 1; i <= n; i++) cin >> u[i];
    for (i = 1; i <= n; i++) cin >> d[i];

    for (i = 1; i <= n; i++)
    {
        if (l[i] + r[i] > n) can = 0;
        if (u[i] + d[i] > n) can = 0;

        if (l[i] == -1 && r[i] != -1) can = 0;
        if (l[i] != -1 && r[i] == -1) can = 0;

        if (d[i] == -1 && u[i] != -1) can = 0;
        if (d[i] != -1 && u[i] == -1) can = 0;
    }

    cout << (can ? "DA" : "NE");
}

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 3832 KB Output is correct
2 Correct 49 ms 4224 KB Output is correct
3 Correct 46 ms 4216 KB Output is correct
4 Correct 30 ms 3064 KB Output is correct
5 Correct 46 ms 4216 KB Output is correct
6 Correct 50 ms 4216 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 3960 KB Output is correct
2 Correct 43 ms 3192 KB Output is correct
3 Correct 57 ms 4216 KB Output is correct
4 Correct 36 ms 3192 KB Output is correct
5 Correct 46 ms 4216 KB Output is correct
6 Correct 41 ms 3960 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 3832 KB Output is correct
2 Correct 28 ms 2944 KB Output is correct
3 Correct 46 ms 4216 KB Output is correct
4 Correct 57 ms 4280 KB Output is correct
5 Correct 45 ms 4216 KB Output is correct
6 Correct 28 ms 3064 KB Output is correct