結果

問題 No.408 五輪ピック
ユーザー uwiuwi
提出日時 2016-08-06 00:06:20
言語 Java21
(openjdk 21)
結果
MLE  
(最新)
AC  
(最初)
実行時間 -
コード長 4,363 bytes
コンパイル時間 4,286 ms
コンパイル使用メモリ 85,296 KB
実行使用メモリ 111,560 KB
最終ジャッジ日時 2024-04-24 15:31:28
合計ジャッジ時間 11,777 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 54 ms
37,180 KB
testcase_01 AC 53 ms
36,936 KB
testcase_02 AC 53 ms
37,408 KB
testcase_03 AC 52 ms
37,408 KB
testcase_04 AC 51 ms
37,120 KB
testcase_05 AC 144 ms
40,212 KB
testcase_06 MLE -
testcase_07 MLE -
testcase_08 AC 161 ms
40,884 KB
testcase_09 AC 188 ms
46,644 KB
testcase_10 AC 180 ms
66,732 KB
testcase_11 AC 159 ms
54,936 KB
testcase_12 AC 237 ms
66,020 KB
testcase_13 AC 157 ms
40,408 KB
testcase_14 AC 112 ms
46,360 KB
testcase_15 AC 138 ms
39,868 KB
testcase_16 AC 180 ms
41,056 KB
testcase_17 AC 198 ms
46,632 KB
testcase_18 AC 207 ms
51,052 KB
testcase_19 AC 264 ms
65,916 KB
testcase_20 AC 158 ms
56,864 KB
testcase_21 AC 126 ms
46,520 KB
testcase_22 MLE -
testcase_23 MLE -
testcase_24 MLE -
testcase_25 AC 137 ms
40,680 KB
testcase_26 MLE -
testcase_27 AC 142 ms
40,052 KB
testcase_28 AC 255 ms
55,876 KB
testcase_29 AC 256 ms
55,816 KB
testcase_30 AC 54 ms
37,352 KB
testcase_31 AC 51 ms
37,248 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;

public class N408_2 {
	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);
		for(int[] row : g){
			Arrays.sort(row);
		}
		long[] one = new long[(n>>>6)+1];
		for(int e : g[0]){
			one[e>>>6] |= 1L<<e;
		}
		
		int[] f = new int[n];
		for(int e : g[0]){
			for(int ee : g[e]){
				if(ee != 0){
					f[ee]++;
				}
			}
		}
		long sum = 0;
		for(int i = 0;i < m;i++){
			sum += (long)f[from[i]] * f[to[i]];
		}
		long[][] dg = new long[n][(n>>>6)+1];
		for(int i = 0;i < n;i++){
			for(int e : g[i]){
				dg[i][e>>>6] |= 1L<<e;
			}
		}
		for(int i = 0;i < m;i++){
			for(int j = 0;j < (n>>>6)+1;j++){
				long x = one[j]&(dg[from[i]][j]&dg[to[i]][j]);
				sum -= Long.bitCount(x);
			}
		}
		for(int i = 0;i < m;i++){
			if(one[from[i]>>>6]<<~from[i]<0 && one[to[i]>>>6]<<~to[i]<0){
				sum--;
			}
		}
		if(sum > 0){
			out.println("YES");
		}else{
			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_2().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