結果
問題 | No.483 マッチ並べ |
ユーザー |
![]() |
提出日時 | 2017-02-10 23:03:17 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 54 ms / 2,000 ms |
コード長 | 4,553 bytes |
コンパイル時間 | 3,692 ms |
コンパイル使用メモリ | 78,672 KB |
実行使用メモリ | 36,984 KB |
最終ジャッジ日時 | 2024-06-09 06:10:07 |
合計ジャッジ時間 | 8,361 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 52 ms
36,440 KB |
testcase_01 | AC | 53 ms
36,724 KB |
testcase_02 | AC | 51 ms
36,984 KB |
testcase_03 | AC | 53 ms
36,420 KB |
testcase_04 | AC | 52 ms
36,584 KB |
testcase_05 | AC | 52 ms
36,852 KB |
testcase_06 | AC | 51 ms
36,908 KB |
testcase_07 | AC | 51 ms
36,736 KB |
testcase_08 | AC | 51 ms
36,864 KB |
testcase_09 | AC | 52 ms
36,628 KB |
testcase_10 | AC | 54 ms
36,864 KB |
testcase_11 | AC | 51 ms
36,820 KB |
testcase_12 | AC | 53 ms
36,548 KB |
testcase_13 | AC | 51 ms
36,864 KB |
testcase_14 | AC | 50 ms
36,328 KB |
testcase_15 | AC | 51 ms
36,788 KB |
testcase_16 | AC | 52 ms
36,976 KB |
testcase_17 | AC | 51 ms
36,456 KB |
testcase_18 | AC | 53 ms
36,820 KB |
testcase_19 | AC | 53 ms
36,316 KB |
testcase_20 | AC | 51 ms
36,684 KB |
testcase_21 | AC | 51 ms
36,520 KB |
testcase_22 | AC | 52 ms
36,620 KB |
testcase_23 | AC | 52 ms
36,924 KB |
testcase_24 | AC | 52 ms
36,748 KB |
testcase_25 | AC | 52 ms
36,864 KB |
testcase_26 | AC | 52 ms
36,676 KB |
testcase_27 | AC | 52 ms
36,456 KB |
testcase_28 | AC | 51 ms
36,984 KB |
testcase_29 | AC | 51 ms
36,792 KB |
testcase_30 | AC | 52 ms
36,684 KB |
testcase_31 | AC | 52 ms
36,748 KB |
testcase_32 | AC | 51 ms
36,724 KB |
testcase_33 | AC | 52 ms
36,792 KB |
testcase_34 | AC | 53 ms
36,632 KB |
testcase_35 | AC | 51 ms
36,720 KB |
testcase_36 | AC | 53 ms
36,924 KB |
testcase_37 | AC | 51 ms
36,544 KB |
testcase_38 | AC | 53 ms
36,796 KB |
testcase_39 | AC | 53 ms
36,672 KB |
testcase_40 | AC | 53 ms
36,672 KB |
testcase_41 | AC | 53 ms
36,792 KB |
testcase_42 | AC | 52 ms
36,748 KB |
testcase_43 | AC | 51 ms
36,696 KB |
testcase_44 | AC | 52 ms
36,548 KB |
testcase_45 | AC | 51 ms
36,984 KB |
testcase_46 | AC | 51 ms
36,748 KB |
testcase_47 | AC | 53 ms
36,956 KB |
testcase_48 | AC | 52 ms
36,440 KB |
testcase_49 | AC | 51 ms
36,724 KB |
testcase_50 | AC | 50 ms
36,292 KB |
testcase_51 | AC | 51 ms
36,816 KB |
testcase_52 | AC | 52 ms
36,920 KB |
testcase_53 | AC | 51 ms
36,504 KB |
testcase_54 | AC | 51 ms
36,568 KB |
testcase_55 | AC | 51 ms
36,788 KB |
ソースコード
import java.io.IOException; import java.io.InputStream; import java.util.HashMap; import java.util.Map; import java.util.NoSuchElementException; public class Main { private static int[] from; private static int[] to; private static int[] count; public static void main(String[] args) { FastScanner sc = new FastScanner(); int N = sc.nextInt(); from = new int[N]; to = new int[N]; Map<Integer, Integer> map = new HashMap<>(); int vIdx = 0; for (int i = 0; i < N; i ++) { int r0 = sc.nextInt(); int c0 = sc.nextInt(); int r1 = sc.nextInt(); int c1 = sc.nextInt(); int v1 = r0 * 1000 + c0; int v2 = r1 * 1000 + c1; if (!map.containsKey(v1)) { map.put(v1, vIdx ++); } if (!map.containsKey(v2)) { map.put(v2, vIdx ++); } from[i] = map.get(v1); to[i] = map.get(v2); } count = new int[vIdx]; boolean ret = dfs(0); System.out.println(ret ? "YES" : "NO"); } private static boolean dfs(int now) { if (now == from.length) { return true; } if (count[from[now]] == 0 && count[to[now]] == 0) { count[to[now]] ++; if (dfs(now + 1)) { return true; } count[to[now]] --; count[from[now]] ++; if (dfs(now + 1)) { return true; } count[from[now]] --; } else if (count[from[now]] == 0) { count[from[now]] ++; if (dfs(now + 1)) { return true; } count[from[now]] --; } else if (count[to[now]] == 0) { count[to[now]] ++; if (dfs(now + 1)) { return true; } count[to[now]] --; } return false; } public static int[][] packU(int n, int[] from, int[] to) { int[][] g = new int[n][]; int[] p = new int[n]; for(int f : from)p[f]++; for(int t : to)p[t]++; for(int i = 0;i < n;i++)g[i] = new int[p[i]]; for(int i = 0;i < from.length;i++){ g[from[i]][--p[from[i]]] = to[i]; g[to[i]][--p[to[i]]] = from[i]; } return g; } } class FastScanner { public static String debug = null; private final InputStream in = System.in; private int ptr = 0; private int buflen = 0; private byte[] buffer = new byte[1024]; private boolean eos = false; private boolean hasNextByte() { if (ptr < buflen) { return true; } else { ptr = 0; try { if (debug != null) { buflen = debug.length(); buffer = debug.getBytes(); debug = ""; eos = true; } else { buflen = in.read(buffer); } } catch (IOException e) { e.printStackTrace(); } if (buflen < 0) { eos = true; return false; } else if (buflen == 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1; } private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126; } private void skipUnprintable() { while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; } public boolean isEOS() { return this.eos; } public boolean hasNext() { skipUnprintable(); return hasNextByte(); } public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while (isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while (true) { if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; } else if (b == -1 || !isPrintableChar(b)) { return minus ? -n : n; } else { throw new NumberFormatException(); } b = readByte(); } } public int nextInt() { return (int) nextLong(); } public long[] nextLongList(int n) { return nextLongTable(1, n)[0]; } public int[] nextIntList(int n) { return nextIntTable(1, n)[0]; } public long[][] nextLongTable(int n, int m) { long[][] ret = new long[n][m]; for (int i = 0; i < n; i ++) { for (int j = 0; j < m; j ++) { ret[i][j] = nextLong(); } } return ret; } public int[][] nextIntTable(int n, int m) { int[][] ret = new int[n][m]; for (int i = 0; i < n; i ++) { for (int j = 0; j < m; j ++) { ret[i][j] = nextInt(); } } return ret; } }