結果

問題 No.1170 Never Want to Walk
ユーザー 37zigen37zigen
提出日時 2020-05-20 14:42:52
言語 Java21
(openjdk 21)
結果
AC  
実行時間 390 ms / 2,000 ms
コード長 4,412 bytes
コンパイル時間 2,243 ms
コンパイル使用メモリ 79,912 KB
実行使用メモリ 59,732 KB
最終ジャッジ日時 2024-07-03 10:09:40
合計ジャッジ時間 10,139 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 50 ms
49,800 KB
testcase_01 AC 53 ms
49,920 KB
testcase_02 AC 50 ms
49,784 KB
testcase_03 AC 49 ms
49,804 KB
testcase_04 AC 53 ms
50,156 KB
testcase_05 AC 51 ms
49,864 KB
testcase_06 AC 51 ms
49,812 KB
testcase_07 AC 54 ms
49,760 KB
testcase_08 AC 51 ms
49,660 KB
testcase_09 AC 49 ms
50,160 KB
testcase_10 AC 50 ms
50,144 KB
testcase_11 AC 50 ms
50,124 KB
testcase_12 AC 60 ms
50,324 KB
testcase_13 AC 62 ms
50,376 KB
testcase_14 AC 59 ms
49,836 KB
testcase_15 AC 59 ms
50,296 KB
testcase_16 AC 58 ms
50,052 KB
testcase_17 AC 59 ms
50,264 KB
testcase_18 AC 59 ms
50,172 KB
testcase_19 AC 60 ms
50,548 KB
testcase_20 AC 64 ms
50,188 KB
testcase_21 AC 60 ms
50,132 KB
testcase_22 AC 59 ms
49,860 KB
testcase_23 AC 58 ms
49,864 KB
testcase_24 AC 57 ms
50,220 KB
testcase_25 AC 57 ms
50,016 KB
testcase_26 AC 58 ms
50,076 KB
testcase_27 AC 368 ms
59,120 KB
testcase_28 AC 354 ms
59,732 KB
testcase_29 AC 376 ms
59,200 KB
testcase_30 AC 380 ms
59,060 KB
testcase_31 AC 351 ms
58,976 KB
testcase_32 AC 344 ms
59,464 KB
testcase_33 AC 351 ms
57,884 KB
testcase_34 AC 363 ms
59,348 KB
testcase_35 AC 375 ms
58,800 KB
testcase_36 AC 356 ms
58,568 KB
testcase_37 AC 390 ms
59,404 KB
testcase_38 AC 371 ms
59,244 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.HashMap;
import java.util.NoSuchElementException;

public class Main{
	
	public static void main(String[] args) {
		new Main().run();
	}
	
	class DJSet {
		int n;
		int[] upper,left,right;
		
		public DJSet(int n) {
			this.n=n;
			upper=new int[n];
			left=new int[n];
			right=new int[n];
			Arrays.fill(upper, -1);
			for (int i=0;i<n;++i) {
				left[i]=i;
				right[i]=i;
			}
		}
		boolean equiv(int x,int y) {
			return root(x)==root(y);
		}
		int root(int x) {
			return upper[x]<0?x:(upper[x]=root(upper[x]));
		}
		int left(int x) {
			return left[root(x)];
		}
		int right(int x) {
			return right[root(x)];
		}
		int sz(int x) {
			return -upper[root(x)];
		}
		void unite(int x,int y) {
			x=root(x);y=root(y);
			if (x==y) return;
			if (upper[x]<upper[y]) {
				x^=y;y^=x;x^=y;
			}
			left[y] =Math.min(left[x],  left[y]);
			right[y]=Math.max(right[x], right[y]);
			upper[y]+=upper[x];
			upper[x]=y;
		}
		void unite_range(int a,int b) {
			if (a>b) return;
			while (right(a)<b) {
				unite(right(a),right(a)+1);
			}
		}
	}
	
	int lower_bound(int[] a,int key) {
		int n=a.length;
		int ng=-1,ok=n;
		while (ok-ng>1) {
			int m=(ok+ng)/2;
			if (a[m]<key) ng=m;
			else ok=m;
		}
		return ok;
	}
	
	void run() {
		FastScanner sc=new FastScanner();
		int N=sc.nextInt();
		int A=sc.nextInt();
		int B=sc.nextInt();
//================================================
		assert(2<=N&&N<=2e5);
		assert(1<=A&&A<=B&&B<=1e9);
//================================================		
		int[] x=new int[N];
		for (int i=0;i<N;++i) {
			x[i]=sc.nextInt();
//================================================
			assert(0<=x[i]&&x[i]<=1e9);
			assert(i==0||x[i-1]<x[i]);
//================================================			
		}
		DJSet ds=new DJSet(N);
		for (int i=0;i<N;++i) {
			int a=Math.max(0,  lower_bound(x,x[i]+A));
			int b=Math.min(N-1,lower_bound(x,x[i]+B+1)-1);
			ds.unite_range(a, b);
			if (a<=b) ds.unite(i, a);
		}
		PrintWriter pw=new PrintWriter(System.out);
		for (int i=0;i<N;++i) {
			pw.println(ds.sz(i));
		}
		pw.flush();
	}
	
	
	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