제출 #745681

#제출 시각아이디문제언어결과실행 시간메모리
745681rahulvermaKocka (COCI18_kocka)Java
28 / 70
1071 ms51788 KiB
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(); } }

컴파일 시 표준 에러 (stderr) 메시지

Note: kocka.java uses unchecked or unsafe operations.
Note: Recompile with -Xlint:unchecked for details.
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...