結果

問題 No.1244 Black Segment
ユーザー uwiuwi
提出日時 2020-10-02 21:26:34
言語 Java21
(openjdk 21)
結果
AC  
実行時間 182 ms / 2,000 ms
コード長 4,233 bytes
コンパイル時間 4,851 ms
コンパイル使用メモリ 78,152 KB
実行使用メモリ 57,904 KB
最終ジャッジ日時 2023-09-23 04:05:53
合計ジャッジ時間 12,044 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge11
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 59 ms
52,288 KB
testcase_01 AC 59 ms
52,428 KB
testcase_02 AC 59 ms
52,392 KB
testcase_03 AC 58 ms
52,340 KB
testcase_04 AC 57 ms
52,488 KB
testcase_05 AC 58 ms
52,344 KB
testcase_06 AC 59 ms
52,188 KB
testcase_07 AC 60 ms
52,160 KB
testcase_08 AC 58 ms
52,280 KB
testcase_09 AC 58 ms
52,264 KB
testcase_10 AC 59 ms
52,340 KB
testcase_11 AC 60 ms
52,304 KB
testcase_12 AC 58 ms
52,412 KB
testcase_13 AC 64 ms
52,480 KB
testcase_14 AC 124 ms
56,784 KB
testcase_15 AC 67 ms
53,148 KB
testcase_16 AC 138 ms
57,148 KB
testcase_17 AC 64 ms
52,680 KB
testcase_18 AC 134 ms
57,384 KB
testcase_19 AC 159 ms
57,904 KB
testcase_20 AC 155 ms
57,536 KB
testcase_21 AC 151 ms
57,088 KB
testcase_22 AC 151 ms
57,024 KB
testcase_23 AC 169 ms
55,260 KB
testcase_24 AC 154 ms
57,476 KB
testcase_25 AC 148 ms
57,424 KB
testcase_26 AC 164 ms
57,252 KB
testcase_27 AC 153 ms
57,212 KB
testcase_28 AC 168 ms
57,108 KB
testcase_29 AC 158 ms
57,460 KB
testcase_30 AC 167 ms
57,076 KB
testcase_31 AC 164 ms
57,172 KB
testcase_32 AC 170 ms
57,216 KB
testcase_33 AC 164 ms
56,868 KB
testcase_34 AC 182 ms
57,716 KB
testcase_35 AC 152 ms
56,996 KB
testcase_36 AC 145 ms
57,036 KB
testcase_37 AC 156 ms
57,268 KB
testcase_38 AC 149 ms
57,536 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest201002;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Queue;

public class C {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), m = ni(), A = ni(), B = ni();
		// L, R+1
		int[] from = new int[m];
		int[] to = new int[m];
		for(int i = 0;i < m;i++){
			from[i] = ni();
			to[i] = ni() + 1;
		}
		int[][] g = packU(100005, from, to);
		Queue<Integer> q = new ArrayDeque<>();
		int[] ds = new int[100005];
		int I = 99999999;
		Arrays.fill(ds, I);
		for(int i = 1;i <= A;i++){
			q.add(i);
			ds[i] = 0;
		}
		while(!q.isEmpty()){
			int cur = q.poll();
			for(int e : g[cur]){
				if(ds[e] > ds[cur] + 1){
					ds[e] = ds[cur] + 1;
					q.add(e);
				}
			}
		}
		int ans = I;
		for(int i = B+1;i < 100005;i++){
			ans = Math.min(ans, ds[i]);
		}
		out.println(ans == I ? -1 : ans);
	}

	public static int[][] packU(int n, int[] from, int[] to) {
		return packU(n, from, to, from.length);
	}

	public static int[][] packU(int n, int[] from, int[] to, int sup) {
		int[][] g = new int[n][];
		int[] p = new int[n];
		for (int i = 0; i < sup; i++) p[from[i]]++;
		for (int i = 0; i < sup; i++) p[to[i]]++;
		for (int i = 0; i < n; i++) g[i] = new int[p[i]];
		for (int i = 0; i < sup; 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