結果
問題 | No.479 頂点は要らない |
ユーザー | zimpha |
提出日時 | 2017-03-31 02:45:13 |
言語 | Java19 (openjdk 21) |
結果 |
AC
|
実行時間 | 640 ms / 1,500 ms |
コード長 | 2,803 bytes |
コンパイル時間 | 2,578 ms |
コンパイル使用メモリ | 76,112 KB |
実行使用メモリ | 81,080 KB |
最終ジャッジ日時 | 2023-09-21 09:02:16 |
合計ジャッジ時間 | 13,308 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 55 ms
50,384 KB |
testcase_01 | AC | 51 ms
50,732 KB |
testcase_02 | AC | 54 ms
50,372 KB |
testcase_03 | AC | 54 ms
48,524 KB |
testcase_04 | AC | 52 ms
50,464 KB |
testcase_05 | AC | 54 ms
50,624 KB |
testcase_06 | AC | 57 ms
50,796 KB |
testcase_07 | AC | 52 ms
50,584 KB |
testcase_08 | AC | 55 ms
50,604 KB |
testcase_09 | AC | 56 ms
51,144 KB |
testcase_10 | AC | 53 ms
50,468 KB |
testcase_11 | AC | 57 ms
50,488 KB |
testcase_12 | AC | 55 ms
50,500 KB |
testcase_13 | AC | 53 ms
50,256 KB |
testcase_14 | AC | 53 ms
50,476 KB |
testcase_15 | AC | 57 ms
50,476 KB |
testcase_16 | AC | 55 ms
50,460 KB |
testcase_17 | AC | 56 ms
50,320 KB |
testcase_18 | AC | 56 ms
50,932 KB |
testcase_19 | AC | 104 ms
53,152 KB |
testcase_20 | AC | 97 ms
52,940 KB |
testcase_21 | AC | 83 ms
51,388 KB |
testcase_22 | AC | 104 ms
52,560 KB |
testcase_23 | AC | 91 ms
52,764 KB |
testcase_24 | AC | 83 ms
51,728 KB |
testcase_25 | AC | 91 ms
52,212 KB |
testcase_26 | AC | 552 ms
79,224 KB |
testcase_27 | AC | 640 ms
81,080 KB |
testcase_28 | AC | 520 ms
76,856 KB |
testcase_29 | AC | 399 ms
66,216 KB |
testcase_30 | AC | 402 ms
66,312 KB |
testcase_31 | AC | 396 ms
66,260 KB |
testcase_32 | AC | 397 ms
66,196 KB |
testcase_33 | AC | 430 ms
65,564 KB |
testcase_34 | AC | 451 ms
66,352 KB |
testcase_35 | AC | 413 ms
65,856 KB |
testcase_36 | AC | 312 ms
61,460 KB |
testcase_37 | AC | 458 ms
68,508 KB |
testcase_38 | AC | 406 ms
66,448 KB |
testcase_39 | AC | 345 ms
65,980 KB |
testcase_40 | AC | 408 ms
67,588 KB |
ソースコード
import java.io.OutputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.StringTokenizer; import java.io.IOException; import java.io.BufferedReader; import java.io.InputStreamReader; import java.util.ArrayList; import java.io.InputStream; /** * Built using CHelper plug-in * Actual solution is at the top * * @author Chiaki.Hoshinomori */ public class Main { public static void main(String[] args) { InputStream inputStream = System.in; OutputStream outputStream = System.out; InputReader in = new InputReader(inputStream); PrintWriter out = new PrintWriter(outputStream); Task479 solver = new Task479(); solver.solve(1, in, out); out.close(); } static class Task479 { public void solve(int testNumber, InputReader in, PrintWriter out) { int n = in.nextInt(); int m = in.nextInt(); int[] a = new int[m]; int[] b = new int[m]; boolean[] mark = new boolean[m]; ArrayList<Integer>[] edges = new ArrayList[n]; for (int i = 0; i < n; i++) { edges[i] = new ArrayList<>(); } for (int i = 0; i < m; i++) { a[i] = in.nextInt(); b[i] = in.nextInt(); edges[a[i]].add(i); edges[b[i]].add(i); } boolean first = false; for (int i = n - 1; i >= 0; --i) { boolean buy = false; for (int e : edges[i]) { if (mark[e]) continue; if (a[e] + b[e] - i > i) buy = true; } if (buy) { first = true; for (int e : edges[i]) { mark[e] = true; } } if (first) { if (buy) out.printf("1"); else out.printf("0"); } } } } static class InputReader { public BufferedReader reader; public StringTokenizer tokenizer; public InputReader(InputStream stream) { reader = new BufferedReader(new InputStreamReader(stream), 32768); tokenizer = null; } public String next() { while (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new StringTokenizer(reader.readLine()); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } public int nextInt() { return Integer.parseInt(next()); } } }