Submission #745684

#TimeUsernameProblemLanguageResultExecution timeMemory
745684rahulvermaKocka (COCI18_kocka)Java
70 / 70
785 ms58120 KiB
import java.util.*; import java.io.*; public class kocka { static final int N = 1_00_005, M = 2_010; public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int n = Integer.parseInt(br.readLine()); 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<>(); } StringTokenizer ts = new StringTokenizer(br.readLine()); for (int i = 1; i <= n; i++) { int x = Integer.parseInt(ts.nextToken()); if (x == -1) x = n + 1; ans[0][i] = x + 1; st[x + 1].add(i); } ts = new StringTokenizer(br.readLine()); for (int i = 1; i <= n; i++) { int x = Integer.parseInt(ts.nextToken()); 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); } ts = new StringTokenizer(br.readLine()); for (int i = 1; i <= n; i++) { int x = Integer.parseInt(ts.nextToken()); if (x == -1) x = n + 1; if (st[i].size() == 0) continue; if (Collections.min(st[i]) <= x) ok = 1; ans[2][i] = x; } ts = new StringTokenizer(br.readLine()); for (int i = 1; i <= n; i++) { int x = Integer.parseInt(ts.nextToken()); if (x == -1) x = n + 1; if (st[i].size() == 0) continue; if (Collections.max(st[i]) > n - x) ok = 1; } PrintWriter pw = new PrintWriter(System.out); if (ok == 1) pw.println("NE"); else pw.println("DA"); pw.close(); } }

Compilation message (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...