| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 745681 | rahulverma | Kocka (COCI18_kocka) | Java | 1071 ms | 51788 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.
import java.util.*;
public class kocka {
    static final long mod = 100000000000031L;
    static final int N = 1_00_005, M = 2_010;
    public static long summ(long x, long y) {
        return ((x % mod) + (y % mod)) % mod;
    }
    public static long mult(long x, long y) {
        return ((x % mod) * (y % mod)) % mod;
    }
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int ok = 0;
        int[][] ans = new int[4][N];
        HashSet<Integer>[] st = new HashSet[N];
        for (int i = 0; i < N; i++) {
            st[i] = new HashSet<>();
        }
        for (int i = 1; i <= n; i++) {
            int x = scanner.nextInt();
            if (x == -1)
                x = n + 1;
            ans[0][i] = x + 1;
            st[x + 1].add(i);
        }
        for (int i = 1; i <= n; i++) {
            int x = scanner.nextInt();
            if (x == -1)
                x = n + 1;
            if (n - x != -1 && n - x < ans[0][i])
                ok = 1;
            ans[1][i] = n - x;
            if (n - x == -1)
                continue;
            st[n - x].add(i);
        }
        for (int i = 1; i <= n; i++) {
            int x = scanner.nextInt();
            if (x == -1)
                x = n + 1;
            if (st[i].size() == 0)
                continue;
            if (Collections.min(st[i]) <= x)
                ok = 1;
            ans[2][i] = x;
        }
        for (int i = 1; i <= n; i++) {
            int x = scanner.nextInt();
            if (x == -1)
                x = n + 1;
            if (st[i].size() == 0)
                continue;
            if (Collections.max(st[i]) > n - x)
                ok = 1;
        }
        if (ok == 1)
            System.out.println("NE");
        else
            System.out.println("DA");
        scanner.close();
    }
}
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... | ||||
