結果
問題 | No.1023 Cyclic Tour |
ユーザー | uwi |
提出日時 | 2020-04-10 22:20:45 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 5,033 bytes |
コンパイル時間 | 7,111 ms |
コンパイル使用メモリ | 78,592 KB |
実行使用メモリ | 73,028 KB |
最終ジャッジ日時 | 2023-10-14 01:06:51 |
合計ジャッジ時間 | 20,452 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 43 ms
49,256 KB |
testcase_01 | AC | 42 ms
49,092 KB |
testcase_02 | AC | 42 ms
49,244 KB |
testcase_03 | AC | 42 ms
49,212 KB |
testcase_04 | AC | 214 ms
63,676 KB |
testcase_05 | AC | 199 ms
61,668 KB |
testcase_06 | AC | 268 ms
67,144 KB |
testcase_07 | AC | 268 ms
63,176 KB |
testcase_08 | AC | 168 ms
61,976 KB |
testcase_09 | AC | 180 ms
61,868 KB |
testcase_10 | AC | 186 ms
62,076 KB |
testcase_11 | AC | 260 ms
63,340 KB |
testcase_12 | AC | 156 ms
61,472 KB |
testcase_13 | AC | 158 ms
57,232 KB |
testcase_14 | AC | 157 ms
57,092 KB |
testcase_15 | AC | 166 ms
61,620 KB |
testcase_16 | AC | 276 ms
66,572 KB |
testcase_17 | AC | 273 ms
67,216 KB |
testcase_18 | AC | 264 ms
64,908 KB |
testcase_19 | AC | 275 ms
66,336 KB |
testcase_20 | AC | 276 ms
66,980 KB |
testcase_21 | AC | 270 ms
67,152 KB |
testcase_22 | AC | 278 ms
66,692 KB |
testcase_23 | AC | 274 ms
66,828 KB |
testcase_24 | AC | 264 ms
66,724 KB |
testcase_25 | AC | 282 ms
66,856 KB |
testcase_26 | AC | 311 ms
67,408 KB |
testcase_27 | WA | - |
testcase_28 | AC | 283 ms
66,756 KB |
testcase_29 | AC | 284 ms
64,848 KB |
testcase_30 | AC | 287 ms
66,824 KB |
testcase_31 | AC | 306 ms
67,596 KB |
testcase_32 | AC | 420 ms
71,940 KB |
testcase_33 | AC | 323 ms
68,180 KB |
testcase_34 | AC | 304 ms
66,764 KB |
testcase_35 | AC | 283 ms
67,096 KB |
testcase_36 | AC | 279 ms
66,744 KB |
testcase_37 | AC | 320 ms
70,152 KB |
testcase_38 | AC | 275 ms
68,812 KB |
testcase_39 | AC | 287 ms
66,900 KB |
testcase_40 | AC | 308 ms
66,576 KB |
testcase_41 | WA | - |
testcase_42 | AC | 281 ms
67,220 KB |
testcase_43 | AC | 304 ms
66,444 KB |
testcase_44 | AC | 222 ms
62,412 KB |
testcase_45 | AC | 520 ms
73,028 KB |
testcase_46 | AC | 163 ms
71,796 KB |
testcase_47 | AC | 764 ms
70,096 KB |
testcase_48 | AC | 275 ms
67,292 KB |
testcase_49 | AC | 314 ms
67,536 KB |
testcase_50 | AC | 280 ms
67,016 KB |
testcase_51 | WA | - |
testcase_52 | WA | - |
ソースコード
package contest200410; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; public class D { InputStream is; PrintWriter out; // String INPUT = "3 4 1 2 2 2 3 2 3 2 2 2 1 2"; String INPUT = ""; // 1-3 // /^ // 2>4 // 1-2 // ^/^ // 3-4 void solve() { int n =ni(), m = ni(); int[] from = new int[2*m]; int[] to = new int[2*m]; int[] ws = new int[2*m]; int p = 0; for(int i = 0;i < m;i++){ int x = ni()-1, y = ni()-1, c = ni(); from[p] = x; to[p] = y; ws[p] = c;p++; if(c == 1){ from[p] = y; to[p] = x; ws[p] = c;p++; } } int[][][] g = packWD(n, from, to, ws, p); boolean ans = false; boolean[] ved = new boolean[n]; boolean[] aed = new boolean[n]; for(int i = 0;i < n;i++){ ans |= dfs(i, -1, 0, g, ved, aed); } out.println(ans ? "Yes" : "No"); } public static int[][][] packWD(int n, int[] from, int[] to, int[] w){ return packWD(n, from, to, w, from.length); } public static int[][][] packWD(int n, int[] from, int[] to, int[] w, int sup) { int[][][] g = new int[n][][]; int[] p = new int[n]; for(int i = 0;i < sup;i++)p[from[i]]++; for(int i = 0;i < n;i++)g[i] = new int[p[i]][2]; for(int i = 0;i < sup;i++){ --p[from[i]]; g[from[i]][p[from[i]]][0] = to[i]; g[from[i]][p[from[i]]][1] = w[i]; } return g; } private static boolean dfs(int cur, int pre, int come, int[][][] g, boolean[] ved, boolean[] aed) { ved[cur] = true; int z = 0; for(int[] nex : g[cur]){ if(aed[nex[0]])continue; if(nex[0] == pre){ z++; }else if(ved[nex[0]]){ return true; } if(!ved[nex[0]]){ if(dfs(nex[0], cur, nex[1], g, ved, aed))return true; } } aed[cur] = true; if(z > 0){ if(come == 1){ return z-1 > 0; }else{ return true; } } return false; } public static int[][] packD(int n, int[] from, int[] to){ return packD(n, from, to, from.length);} public static int[][] packD(int n, int[] from, int[] to, int sup) { int[][] g = new int[n][]; int[] p = new int[n]; for(int i = 0;i < sup;i++)p[from[i]]++; for(int i = 0;i < n;i++)g[i] = new int[p[i]]; for(int i = 0;i < sup;i++){ g[from[i]][--p[from[i]]] = to[i]; } return g; } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } public static void main(String[] args) throws Exception { new D().run(); } private byte[] inbuf = new byte[1024]; public int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }