結果

問題 No.629 グラフの中に眠る門松列
ユーザー uwiuwi
提出日時 2018-01-05 21:22:30
言語 Java21
(openjdk 21)
結果
AC  
実行時間 55 ms / 4,000 ms
コード長 4,080 bytes
コンパイル時間 3,920 ms
コンパイル使用メモリ 87,392 KB
実行使用メモリ 50,476 KB
最終ジャッジ日時 2024-06-02 09:53:12
合計ジャッジ時間 7,453 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 49 ms
50,324 KB
testcase_01 AC 49 ms
50,236 KB
testcase_02 AC 46 ms
49,776 KB
testcase_03 AC 48 ms
50,256 KB
testcase_04 AC 48 ms
50,444 KB
testcase_05 AC 49 ms
49,756 KB
testcase_06 AC 48 ms
50,324 KB
testcase_07 AC 47 ms
50,240 KB
testcase_08 AC 47 ms
49,904 KB
testcase_09 AC 48 ms
50,212 KB
testcase_10 AC 48 ms
50,156 KB
testcase_11 AC 47 ms
49,972 KB
testcase_12 AC 49 ms
49,720 KB
testcase_13 AC 50 ms
50,152 KB
testcase_14 AC 52 ms
50,152 KB
testcase_15 AC 51 ms
50,080 KB
testcase_16 AC 49 ms
49,828 KB
testcase_17 AC 51 ms
50,112 KB
testcase_18 AC 48 ms
49,920 KB
testcase_19 AC 53 ms
50,168 KB
testcase_20 AC 50 ms
50,148 KB
testcase_21 AC 52 ms
50,184 KB
testcase_22 AC 51 ms
50,080 KB
testcase_23 AC 49 ms
50,160 KB
testcase_24 AC 50 ms
50,136 KB
testcase_25 AC 52 ms
50,068 KB
testcase_26 AC 55 ms
49,884 KB
testcase_27 AC 49 ms
49,828 KB
testcase_28 AC 48 ms
50,388 KB
testcase_29 AC 50 ms
49,872 KB
testcase_30 AC 53 ms
50,476 KB
testcase_31 AC 51 ms
50,188 KB
testcase_32 AC 51 ms
50,236 KB
testcase_33 AC 51 ms
50,204 KB
testcase_34 AC 50 ms
50,168 KB
testcase_35 AC 50 ms
50,328 KB
testcase_36 AC 51 ms
49,784 KB
testcase_37 AC 51 ms
50,272 KB
testcase_38 AC 52 ms
50,268 KB
testcase_39 AC 50 ms
49,892 KB
testcase_40 AC 51 ms
50,192 KB
testcase_41 AC 51 ms
50,244 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest180105;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashSet;
import java.util.InputMismatchException;
import java.util.Set;

public class C {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), m = ni();
		int[] a = na(n);
		int[] from = new int[m];
		int[] to = new int[m];
		for(int i = 0;i < m;i++){
			from[i] = ni()-1;
			to[i] = ni()-1;
		}
		int[][] g = packU(n, from, to);
		for(int i = 0;i < n;i++){
			Set<Integer> set = new HashSet<>();
			for(int e : g[i]){
				if(a[i] > a[e]){
					set.add(a[e]);
					if(set.size() == 2){
						out.println("YES");
						return;
					}
				}
			}
		}
		for(int i = 0;i < n;i++){
			Set<Integer> set = new HashSet<>();
			for(int e : g[i]){
				if(a[i] < a[e]){
					set.add(a[e]);
					if(set.size() == 2){
						out.println("YES");
						return;
					}
				}
			}
		}
		out.println("NO");
	}
	
	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;
	}
	
	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 C().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)); }
}
0