結果
問題 | No.629 グラフの中に眠る門松列 |
ユーザー | 37zigen |
提出日時 | 2020-03-19 14:39:13 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 75 ms / 4,000 ms |
コード長 | 3,269 bytes |
コンパイル時間 | 3,829 ms |
コンパイル使用メモリ | 77,364 KB |
実行使用メモリ | 50,660 KB |
最終ジャッジ日時 | 2023-08-20 20:50:53 |
合計ジャッジ時間 | 7,625 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 39 ms
49,568 KB |
testcase_01 | AC | 45 ms
49,476 KB |
testcase_02 | AC | 45 ms
49,708 KB |
testcase_03 | AC | 46 ms
49,552 KB |
testcase_04 | AC | 43 ms
49,484 KB |
testcase_05 | AC | 44 ms
49,584 KB |
testcase_06 | AC | 45 ms
49,428 KB |
testcase_07 | AC | 44 ms
49,704 KB |
testcase_08 | AC | 43 ms
49,472 KB |
testcase_09 | AC | 43 ms
49,548 KB |
testcase_10 | AC | 43 ms
49,512 KB |
testcase_11 | AC | 42 ms
49,456 KB |
testcase_12 | AC | 42 ms
49,612 KB |
testcase_13 | AC | 43 ms
49,436 KB |
testcase_14 | AC | 43 ms
49,508 KB |
testcase_15 | AC | 43 ms
49,480 KB |
testcase_16 | AC | 44 ms
49,580 KB |
testcase_17 | AC | 46 ms
49,440 KB |
testcase_18 | AC | 44 ms
49,652 KB |
testcase_19 | AC | 44 ms
49,600 KB |
testcase_20 | AC | 44 ms
49,428 KB |
testcase_21 | AC | 52 ms
47,656 KB |
testcase_22 | AC | 50 ms
49,616 KB |
testcase_23 | AC | 50 ms
49,632 KB |
testcase_24 | AC | 52 ms
50,660 KB |
testcase_25 | AC | 62 ms
34,336 KB |
testcase_26 | AC | 65 ms
34,208 KB |
testcase_27 | AC | 74 ms
35,796 KB |
testcase_28 | AC | 51 ms
33,908 KB |
testcase_29 | AC | 55 ms
33,920 KB |
testcase_30 | AC | 74 ms
34,668 KB |
testcase_31 | AC | 75 ms
34,264 KB |
testcase_32 | AC | 65 ms
34,108 KB |
testcase_33 | AC | 69 ms
35,660 KB |
testcase_34 | AC | 55 ms
34,080 KB |
testcase_35 | AC | 54 ms
34,120 KB |
testcase_36 | AC | 63 ms
34,268 KB |
testcase_37 | AC | 60 ms
34,304 KB |
testcase_38 | AC | 68 ms
34,232 KB |
testcase_39 | AC | 59 ms
34,052 KB |
testcase_40 | AC | 57 ms
34,084 KB |
testcase_41 | AC | 56 ms
34,316 KB |
ソースコード
import java.io.FileNotFoundException; import java.io.IOException; import java.io.InputStream; import java.util.ArrayList; import java.util.Arrays; import java.util.Collections; import java.util.Comparator; import java.util.NoSuchElementException; public class Main { public static void main(String[] args) throws FileNotFoundException { long t = System.currentTimeMillis(); new Main().run(); System.err.println(System.currentTimeMillis() - t); } void run() { Scanner sc = new Scanner(); int n=sc.nextInt(); int m=sc.nextInt(); int[] a=new int[n]; for(int i=0;i<n;++i)a[i]=sc.nextInt(); ArrayList<Integer>[] g=new ArrayList[n]; for(int i=0;i<n;++i)g[i]=new ArrayList<>(); for(int i=0;i<m;++i) { int u=sc.nextInt(); int v=sc.nextInt(); --u;--v; g[u].add(a[v]); g[v].add(a[u]); } for(int i=0;i<n;++i) { Collections.sort(g[i]); if(g[i].size()<=1)continue; int p=0; while(p<g[i].size()&&g[i].get(p)==g[i].get(0))++p; if(p==g[i].size())continue; if(g[i].get(p)<a[i]) { System.out.println("YES"); return; } } for(int i=0;i<n;++i) { Collections.sort(g[i], new Comparator<Integer>() { @Override public int compare(Integer o1, Integer o2) { return -Long.compare(o1, o2); } }); if(g[i].size()<=1)continue; int p=0; while(p<g[i].size()&&g[i].get(p)==g[i].get(0))++p; if(p==g[i].size())continue; if(g[i].get(p)>a[i]) { System.out.println("YES"); return; } } System.out.println("NO"); } class Scanner { private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; private boolean hasNextByte() { if (ptr < buflen) { return true; } else { ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1; } private boolean isPrintableChar(int c) { return 33 <= c && c <= 126; } private void skipUnprintable() { while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; } 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(); } } static void tr(Object... objects) { System.out.println(Arrays.deepToString(objects)); } }