結果

問題 No.408 五輪ピック
ユーザー uwiuwi
提出日時 2016-08-06 01:50:59
言語 Java21
(openjdk 21)
結果
AC  
実行時間 1,301 ms / 5,000 ms
コード長 4,141 bytes
コンパイル時間 4,277 ms
コンパイル使用メモリ 85,260 KB
実行使用メモリ 49,800 KB
最終ジャッジ日時 2024-04-24 17:13:46
合計ジャッジ時間 15,006 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 55 ms
49,800 KB
testcase_01 AC 53 ms
37,168 KB
testcase_02 AC 57 ms
37,024 KB
testcase_03 AC 52 ms
37,040 KB
testcase_04 AC 51 ms
37,032 KB
testcase_05 AC 102 ms
39,344 KB
testcase_06 AC 985 ms
45,528 KB
testcase_07 AC 132 ms
44,668 KB
testcase_08 AC 100 ms
38,808 KB
testcase_09 AC 107 ms
39,020 KB
testcase_10 AC 793 ms
45,112 KB
testcase_11 AC 735 ms
44,996 KB
testcase_12 AC 174 ms
42,372 KB
testcase_13 AC 104 ms
39,364 KB
testcase_14 AC 400 ms
44,048 KB
testcase_15 AC 102 ms
39,472 KB
testcase_16 AC 106 ms
39,476 KB
testcase_17 AC 114 ms
39,676 KB
testcase_18 AC 116 ms
39,604 KB
testcase_19 AC 121 ms
40,320 KB
testcase_20 AC 496 ms
44,628 KB
testcase_21 AC 299 ms
43,972 KB
testcase_22 AC 684 ms
44,892 KB
testcase_23 AC 113 ms
40,568 KB
testcase_24 AC 868 ms
45,076 KB
testcase_25 AC 102 ms
39,224 KB
testcase_26 AC 1,301 ms
46,208 KB
testcase_27 AC 345 ms
43,136 KB
testcase_28 AC 101 ms
39,588 KB
testcase_29 AC 138 ms
41,400 KB
testcase_30 AC 53 ms
36,644 KB
testcase_31 AC 54 ms
37,236 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Random;

public class N408_3 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), m = ni();
		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);
		Random gen = new Random();
		int[] color = new int[n];
		for(int rep = 0;rep < 200;rep++){
			for(int i = 1;i < n;i++){
				color[i] = gen.nextInt(4);
			}
			boolean[][] dp = new boolean[1<<4][n];
			dp[0][0] = true;
			for(int j = 1;j < 1<<4;j++){
				for(int i = 1;i < n;i++){
					if(j<<~color[i]<0){
						for(int e : g[i]){
							if(dp[j^1<<color[i]][e]){
								dp[j][i] = true;
								break;
							}
						}
					}
				}
			}
			for(int e : g[0]){
				if(dp[15][e]){
					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 N408_3().run(); }
	
	private byte[] inbuf = new byte[1024];
	private 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