| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 92445 | ltomic | Kocka (COCI18_kocka) | C++14 | 403 ms | 66560 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
#include <set>
#include <cstdlib>
using namespace std;
const int MAXN = 1e5+5;
set<int> s[4][MAXN];
int l[MAXN], r[MAXN], u[MAXN], d[MAXN];
int n;
void no() {
  printf("NE\n");
  exit(0);
}
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) {
    scanf("%d", l+i);
    if (l[i] == -1) continue;
    s[0][i].insert(l[i]);
    s[1][l[i]].insert(i);
    s[2][i].insert(n-l[i]-1);
    s[3][l[i]].insert(n-i-1);
  }
  for (int i = 0; i < n; ++i) {
    scanf("%d", r+i);
    if (r[i] == -1) continue;
    s[2][i].insert(r[i]);
    s[3][n-r[i]-1].insert(n-i-1);
    s[0][i].insert(n-r[i]-1);
    s[1][n-r[i]-1].insert(i);
  }
  for (int i = 0; i < n; ++i) {
    scanf("%d", u+i);
    if (u[i] == -1) continue;
    s[1][i].insert(u[i]);
    s[2][u[i]].insert(n-i-1);
    s[3][i].insert(n-u[i]-1);
    s[0][u[i]].insert(i);
  }
    for (int i = 0; i < n; ++i) {
    scanf("%d", d+i);
    if (d[i] == -1) continue;
    s[3][i].insert(d[i]);
    s[0][n-d[i]-1].insert(i);
    s[1][i].insert(n-d[i]-1);
    s[2][n-d[i]-1].insert(n-i-1);
  }
  /*for (int i = 0; i < 4; ++i) {
    for (int j = 0; j < n; ++j) {
      for (int k: s[i][j]) printf("%d ", k);
      printf("\n");
    }
    printf("\n");
  }*/
  for (int i = 0; i < n; ++i) {
    if (l[i] == -1) l[i] = n;
    s[0][i].insert(n);
    if (l[i] != *s[0][i].begin()) no();
    
    if (u[i] == -1) u[i] = n;
    s[1][i].insert(n);
    if (u[i] != *s[1][i].begin()) no();
    if (r[i] == -1) r[i] = n;
    s[2][i].insert(n);
    if (r[i] != *s[2][i].begin()) no();
    if (d[i] == -1) d[i] = n;
    s[3][i].insert(n);
    if (d[i] != *s[3][i].begin()) no();
  }
  printf("DA\n");
  return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
