結果

問題 No.953 席
ユーザー 37zigen37zigen
提出日時 2020-04-08 04:12:38
言語 Java21
(openjdk 21)
結果
AC  
実行時間 1,524 ms / 2,000 ms
コード長 5,011 bytes
コンパイル時間 5,074 ms
コンパイル使用メモリ 87,524 KB
実行使用メモリ 99,684 KB
最終ジャッジ日時 2023-09-23 02:18:19
合計ジャッジ時間 30,385 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 59 ms
50,208 KB
testcase_01 AC 61 ms
50,332 KB
testcase_02 AC 664 ms
72,448 KB
testcase_03 AC 609 ms
67,892 KB
testcase_04 AC 618 ms
68,624 KB
testcase_05 AC 628 ms
81,424 KB
testcase_06 AC 749 ms
72,028 KB
testcase_07 AC 861 ms
78,756 KB
testcase_08 AC 1,403 ms
91,352 KB
testcase_09 AC 653 ms
73,960 KB
testcase_10 AC 332 ms
64,120 KB
testcase_11 AC 696 ms
75,776 KB
testcase_12 AC 1,023 ms
78,480 KB
testcase_13 AC 1,524 ms
98,880 KB
testcase_14 AC 1,336 ms
99,684 KB
testcase_15 AC 841 ms
78,816 KB
testcase_16 AC 956 ms
84,824 KB
testcase_17 AC 836 ms
84,456 KB
testcase_18 AC 884 ms
80,656 KB
testcase_19 AC 1,139 ms
78,688 KB
testcase_20 AC 1,073 ms
78,160 KB
testcase_21 AC 693 ms
78,336 KB
testcase_22 AC 1,105 ms
78,788 KB
testcase_23 AC 707 ms
71,688 KB
testcase_24 AC 693 ms
70,508 KB
testcase_25 AC 1,190 ms
84,172 KB
testcase_26 AC 439 ms
67,108 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Comparator;
import java.util.NoSuchElementException;
import java.util.PriorityQueue;

public class Main {

	public static void main(String[] args) {
		new Main().run();
	}
	
	boolean disjoint(int id, boolean[] on) {
		boolean ret=true;
		for(int i=Math.max(0, id-1);i<=Math.min(on.length-1, id+1);++i) {
			ret&=!on[i];
		}
		return ret;
	}
	
	void run() {
		FastScanner sc=new FastScanner();
		int N=sc.nextInt();
		int fst=sc.nextInt()-1;
		int snd=sc.nextInt()-1;
		int[] dist=new int[N];
		int[] id=new int[N];
		int Q=sc.nextInt();
		int[] ans=new int[Q];
		Arrays.fill(ans, -1);
		PriorityQueue<Integer> disjoint=new PriorityQueue<>();
		PriorityQueue<Integer> adjacent=new PriorityQueue<>();
		{
			int p=1;
			int s=fst,t=fst+1;
			while (s>0||t<N) {
				if (fst<snd) {
					if(t<dist.length) dist[t++]=p++;
					if(s>0) dist[--s]=p++;
				} else {
					if(s>0) dist[--s]=p++;
					if(t<dist.length) dist[t++]=p++;
				}
			}
			for(int i=0;i<N;++i) {
				id[dist[i]]=i;
			}
		}
		
		for(int i=0;i<N;++i) {
			disjoint.add(i);
		}
		PriorityQueue<long[]> out=new PriorityQueue<>(Comparator.comparing(v->v[0]));
		PriorityQueue<long[]> in=new PriorityQueue<>(Comparator.comparing(v->v[0]));
		for(int i=0;i<Q;++i) {
			in.add(new long[] {sc.nextInt(), i, sc.nextInt()});
		}
		long INF=Long.MAX_VALUE/3;
		in.add(new long[] {INF,-1});
		out.add(new long[] {INF, -1});
		boolean[] on=new boolean[N];
		long time=0;
		while(out.size()>1 || in.size()>1) {
			in.peek()[0]=Math.max(in.peek()[0], time);
			if(out.peek()[0]<=in.peek()[0]) {
				long[] o=out.poll();
				int id_=ans[(int)o[1]];
				on[id_]=false;
				for (int i=Math.max(id_-1, 0);i<=Math.min(id_+1, N-1);++i) {
					if(on[i]) continue;
					if(disjoint(i, on)) disjoint.add(dist[i]);
					else adjacent.add(dist[i]);
				}
				time=in.peek()[0];
			}else{
				while(!disjoint.isEmpty() && (!disjoint(id[disjoint.peek()], on) || on[id[disjoint.peek()]])) {
					disjoint.poll();
				}
				while(!adjacent.isEmpty() && (disjoint(id[adjacent.peek()], on) || on[id[adjacent.peek()]])) {
					adjacent.poll();
				}
				if(disjoint.isEmpty()&&adjacent.isEmpty()) {
					in.peek()[0]=out.peek()[0];
					continue;
				}
				int dist_=!disjoint.isEmpty()?disjoint.poll():adjacent.poll();
				int id_=id[dist_];
				if(on[id_]) continue;
				ans[(int)in.peek()[1]]=id_;
				on[id_]=true;
				for(int i=Math.max(0, id_-1);i<=Math.min(N-1, id_+1);++i) {
					if(!on[i] && !disjoint(i, on)) adjacent.add(dist[i]);
				}
				out.add(new long[] {in.peek()[0]+in.peek()[2],in.peek()[1]});
				time=in.peek()[0];
				in.poll();
			}
		}
		PrintWriter pw=new PrintWriter(System.out);
		for(int i=0;i<Q;++i) {
			pw.println(ans[i]+1);
		}
		pw.close();
	}
	
	
	void tr(Object...objects) {System.out.println(Arrays.deepToString(objects));}
}

class FastScanner {
    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 static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
    public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; 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() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
        return (int) nl;
    }
    
    public double nextDouble() { return Double.parseDouble(next());}
}
0