Submission #228941

#	Time	Username	Problem	Language	Result	Execution time	Memory
228941		NONAME	Kocka (COCI18_kocka)	C++17	70 / 70	47 ms	1152 KiB

kocka

#include <bits/stdc++.h>
#define sz(x) int(x.size())
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#define N 100500
#define oo ll(1e16)
#define ft first
#define sd second
#define pb push_back
#define ppb pop_back
#define el '\n'
#define elf endl
#define base ll(1e9 + 7)
using namespace std;
typedef long long ll;
typedef long double ld;

int n, a[2][N];
bool f = 1;

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

//    in("input.txt");

    cin >> n;
    for (int i = 0; i < 2; i++)
    for (int j = 0; j < n; j++)
        cin >> a[i][j];

    for (int i = 0; i < n; i++)
        if (a[0][i] + a[1][i] > n || (min(a[0][i], a[1][i]) == -1 && max(a[0][i], a[1][i]) != -1))
            f = 0;

    for (int i = 0; i < 2; i++)
    for (int j = 0; j < n; j++)
        cin >> a[i][j];

    for (int i = 0; i < n; i++)
        if (a[0][i] + a[1][i] > n || (min(a[0][i], a[1][i]) == -1 && max(a[0][i], a[1][i]) != -1))
            f = 0;

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

• Subtask 1: 14 / 14
• Subtask 2: 14 / 14
• Subtask 3: 14 / 14
• Subtask 4: 14 / 14
• Subtask 5: 14 / 14