結果

問題 No.953 席
ユーザー 37zigen37zigen
提出日時 2020-04-08 03:39:02
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 5,142 bytes
コンパイル時間 3,475 ms
コンパイル使用メモリ 80,464 KB
実行使用メモリ 50,968 KB
最終ジャッジ日時 2023-09-23 01:12:41
合計ジャッジ時間 11,010 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 WA -
testcase_02 OLE -
testcase_03 -- -
testcase_04 -- -
testcase_05 -- -
testcase_06 -- -
testcase_07 -- -
testcase_08 -- -
testcase_09 -- -
testcase_10 -- -
testcase_11 -- -
testcase_12 -- -
testcase_13 -- -
testcase_14 -- -
testcase_15 -- -
testcase_16 -- -
testcase_17 -- -
testcase_18 -- -
testcase_19 -- -
testcase_20 -- -
testcase_21 -- -
testcase_22 -- -
testcase_23 -- -
testcase_24 -- -
testcase_25 -- -
testcase_26 -- -
権限があれば一括ダウンロードができます

ソースコード

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);
		}
		int[][] in=new int[Q+1][3];
		PriorityQueue<int[]> out=new PriorityQueue<>(Comparator.comparing(v->v[0]));
		for(int i=0;i<Q;++i) {
			in[i][0]=sc.nextInt();
			in[i][1]=i;
			in[i][2]=sc.nextInt();
		}
		int INF=Integer.MAX_VALUE/3;
		in[Q][0]=INF;
		in[Q][1]=-1;
		out.add(new int[] {INF, -1});
		Arrays.sort(in, Comparator.comparing(v->v[0]));
		boolean[] on=new boolean[N];
		int v=0;
		int time=0;
		while(out.size()>1 || v!=Q) {
			if(out.peek()[0]<time) out.peek()[0]=time;
			if(out.peek()[0]<=in[v][0]) { // out[u]を実行
				int[] o=out.poll();
				int id_=ans[o[1]];
				on[id_]=false;
				for (int i=Math.max(id_-1, 0);i<=Math.min(id_+1, N-1);++i) {
					if(!on[i] && disjoint(i, on)) disjoint.add(dist[i]);
					else if(!on[i]) adjacent.add(dist[i]);
				}
				time=in[v][0];
			}else{ // in[v]を実行
				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[v][0]=out.peek()[0];
					continue;
				}
				
				int dist_=!disjoint.isEmpty()?disjoint.poll():adjacent.poll();
				int id_=id[dist_];
				if(on[id_]) continue;
				tr("disjoint",disjoint.toArray());
				tr("adjacent",adjacent.toArray());
				tr("on",on);
				tr(in[v][1],id_);
				ans[in[v][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 int[] {in[v][0]+in[v][2],in[v][1]});
				time=in[v][0];
				++v;
			}
		}
		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