結果

問題 No.1110 好きな歌
ユーザー CuriousFairy315CuriousFairy315
提出日時 2020-07-10 21:33:59
言語 Java21
(openjdk 21)
結果
AC  
実行時間 793 ms / 5,000 ms
コード長 6,782 bytes
コンパイル時間 3,381 ms
コンパイル使用メモリ 87,052 KB
実行使用メモリ 56,244 KB
最終ジャッジ日時 2024-10-11 08:04:31
合計ジャッジ時間 24,019 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 63 ms
37,316 KB
testcase_01 AC 65 ms
36,828 KB
testcase_02 AC 66 ms
37,188 KB
testcase_03 AC 63 ms
36,948 KB
testcase_04 AC 62 ms
37,300 KB
testcase_05 AC 63 ms
37,132 KB
testcase_06 AC 62 ms
37,264 KB
testcase_07 AC 61 ms
36,696 KB
testcase_08 AC 63 ms
37,072 KB
testcase_09 AC 62 ms
37,224 KB
testcase_10 AC 61 ms
37,172 KB
testcase_11 AC 62 ms
36,988 KB
testcase_12 AC 62 ms
36,932 KB
testcase_13 AC 64 ms
37,348 KB
testcase_14 AC 73 ms
37,644 KB
testcase_15 AC 69 ms
37,388 KB
testcase_16 AC 76 ms
37,828 KB
testcase_17 AC 76 ms
38,120 KB
testcase_18 AC 63 ms
37,224 KB
testcase_19 AC 77 ms
37,484 KB
testcase_20 AC 85 ms
37,772 KB
testcase_21 AC 70 ms
37,800 KB
testcase_22 AC 73 ms
37,772 KB
testcase_23 AC 68 ms
37,072 KB
testcase_24 AC 480 ms
52,584 KB
testcase_25 AC 525 ms
51,148 KB
testcase_26 AC 300 ms
45,976 KB
testcase_27 AC 551 ms
53,312 KB
testcase_28 AC 322 ms
45,944 KB
testcase_29 AC 597 ms
53,756 KB
testcase_30 AC 318 ms
46,200 KB
testcase_31 AC 245 ms
45,120 KB
testcase_32 AC 684 ms
55,124 KB
testcase_33 AC 343 ms
46,684 KB
testcase_34 AC 486 ms
50,232 KB
testcase_35 AC 649 ms
55,420 KB
testcase_36 AC 171 ms
42,296 KB
testcase_37 AC 266 ms
45,484 KB
testcase_38 AC 628 ms
53,684 KB
testcase_39 AC 445 ms
49,732 KB
testcase_40 AC 571 ms
54,320 KB
testcase_41 AC 152 ms
40,648 KB
testcase_42 AC 602 ms
55,216 KB
testcase_43 AC 590 ms
54,708 KB
testcase_44 AC 731 ms
55,608 KB
testcase_45 AC 793 ms
55,068 KB
testcase_46 AC 730 ms
55,872 KB
testcase_47 AC 717 ms
55,620 KB
testcase_48 AC 725 ms
54,244 KB
testcase_49 AC 735 ms
55,568 KB
testcase_50 AC 690 ms
56,064 KB
testcase_51 AC 621 ms
55,064 KB
testcase_52 AC 731 ms
55,912 KB
testcase_53 AC 666 ms
56,244 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.ArrayList;

public class Main {

	public static void main(String[] args) {
		new Main();
	}

	public Main() {
		FastScanner fs = new FastScanner();
		java.io.PrintWriter out = new java.io.PrintWriter(System.out);
		solve(fs, out);
		out.flush();
	}

	public void solve(FastScanner fs, java.io.PrintWriter out) {
		int N = fs.nextInt(), D = fs.nextInt();
		Pair[] A = new Pair[N];
		for (int i = 0;i < N;++ i) A[i] = new Pair(i, fs.nextInt());
		java.util.Arrays.sort(A, (l, r) -> Integer.compare(l.value, r.value));
		int[] ans = new int[N];
		for (int l = 0, r = 0;r < N;++ r) {
			while(A[l].value + D <= A[r].value) ++ l;
			ans[A[r].key] = l;
		}
		for (int i = 0;i < N;++ i) out.println(ans[i]);
	}

	class Pair {
		int key, value;
		Pair(int k, int v) {
			key = k;
			value = v;
		}
	}

	static class FastScanner {
		private final java.io.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;
			ptr = 0;
			try {
				buflen = in.read(buffer);
			} catch (java.io.IOException e) {
				e.printStackTrace();
			}
			return buflen > 0;
		}
		private byte readByte() {
			return hasNextByte() ? buffer[ptr++ ] : -1;
		}
		private static boolean isPrintableChar(byte c) {
			return 32 < c || c < 0;
		}
		private static boolean isNumber(int c) {
			return '0' <= c && c <= '9';
		}
		public boolean hasNext() {
			while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++ ;
			return hasNextByte();
		}
		public String next() {
			if (!hasNext()) throw new java.util.NoSuchElementException();
			StringBuilder sb = new StringBuilder();
			byte b;
			while (isPrintableChar(b = readByte())) sb.appendCodePoint(b);
			return sb.toString();
		}
		public final long nextLong() {
			if (!hasNext()) throw new java.util.NoSuchElementException();
			long n = 0;
			try {
				byte b = readByte();
				if (b == '-') {
					while(isNumber(b = readByte())) n = n * 10 + '0' - b;
					return n;
				} else if (!isNumber(b)) throw new NumberFormatException();
				do n = n * 10 + b - '0'; while (isNumber(b = readByte()));
			} catch (java.util.NoSuchElementException e) {
			}
			return n;
		}
		public final int nextInt() {
			if (!hasNext()) throw new java.util.NoSuchElementException();
			int n = 0;
			try {
				byte b = readByte();
				if (b == '-') {
					while(isNumber(b = readByte())) n = n * 10 + '0' - b;
					return n;
				} else if (!isNumber(b)) throw new NumberFormatException();
				do n = n * 10 + b - '0'; while (isNumber(b = readByte()));
			} catch (java.util.NoSuchElementException e) {
			}
			return n;
		}
		public double nextDouble() {
			return Double.parseDouble(next());
		}
	}
	public static class Arrays {
		public static void sort(final int[] array) {
			int l, min = 0xFFFFFFFF, max = 0;
			for (l = 0;l < array.length;++ l) {
				int i = array[l];
				min &= i;
				max |= i;
				if ((i & 0x80000000) == 0) break;
			}
			for (int r = l + 1;r < array.length;++ r) {
				int i = array[r];
				min &= i;
				max |= i;
				if ((i & 0x80000000) != 0) {
					array[r] = array[l];
					array[l ++] = i;
				}
			}
			int use = min ^ max, bit = Integer.highestOneBit(use & 0x7FFFFFFF);
			if (bit == 0) return;
			sort(array, 0, l, use, bit);
			sort(array, l, array.length, use, bit);
		}
		private static void sort(final int[] array, final int left, final int right, final int use, int digit) {
			if (right - left <= 96) {
				for (int i = left + 1;i < right;++ i) {
					int tmp = array[i], tmp2, j;
					for (j = i;j > left && (tmp2 = array[j - 1]) > tmp;-- j) array[j] = tmp2;
					array[j] = tmp;
				}
				return;
			}
			int l = left;
			while(l < right && (array[l] & digit) == 0) ++ l;
			for (int r = l + 1;r < right;++ r) {
				int i = array[r];
				if ((i & digit) == 0) {
					array[r] = array[l];
					array[l ++] = i;
				}
			}
			if ((digit = Integer.highestOneBit(use & digit - 1)) == 0) return;
			sort(array, left, l, use, digit);
			sort(array, l, right, use, digit);
		}
		public static void sort(final long[] array) {
			int l;
			long min = 0xFFFFFFFFFFFFFFFFL, max = 0;
			for (l = 0;l < array.length;++ l) {
				long i = array[l];
				min &= i;
				max |= i;
				if ((i & 0x8000000000000000L) == 0) break;
			}
			for (int r = l + 1;r < array.length;++ r) {
				long i = array[r];
				min &= i;
				max |= i;
				if ((i & 0x8000000000000000L) != 0) {
					array[r] = array[l];
					array[l ++] = i;
				}
			}
			long use = min ^ max, bit = Long.highestOneBit(use & 0x7FFFFFFFFFFFFFFFL);
			if (bit == 0) return;
			sort(array, 0, l, use, bit);
			sort(array, l, array.length, use, bit);
		}
		private static void sort(final long[] array, final int left, final int right, final long use, long digit) {
			if (right - left <= 96) {
				for (int i = left + 1, j;i < right;++ i) {
					long tmp = array[i], tmp2;
					for (j = i;j > left && (tmp2 = array[j - 1]) > tmp;-- j) array[j] = tmp2;
					array[j] = tmp;
				}
				return;
			}
			int l = left;
			while(l < right && (array[l] & digit) == 0) ++ l;
			for (int r = l + 1;r < right;++ r) {
				long i = array[r];
				if ((i & digit) == 0) {
					array[r] = array[l];
					array[l ++] = i;
				}
			}
			if ((digit = Long.highestOneBit(use & digit - 1)) == 0) return;
			sort(array, left, l, use, digit);
			sort(array, l, right, use, digit);
		}
	}

	public static class IntMath {
		public static int gcd(int a, int b) {
			while (a != 0) if ((b %= a) != 0) a %= b; else return a;
			return b;
		}
		public static int gcd(int... array) {
			int ret = array[0];
			for (int i = 1;i < array.length;++ i) ret = gcd(ret, array[i]);
			return ret;
		}
		public static long gcd(long a, long b) {
			while (a != 0) if ((b %= a) != 0) a %= b; else return a;
			return b;
		}
		public static long gcd(long... array) {
			long ret = array[0];
			for (int i = 1;i < array.length;++ i) ret = gcd(ret, array[i]);
			return ret;
		}
		public static long lcm(long a, long b) {
			return a / gcd(a, b) * b;
		}
		public static int pow(int a, int b) {
			int ans = 1;
			for (int mul = a;b > 0;b >>= 1, mul *= mul) if ((b & 1) != 0) ans *= mul;
			return ans;
		}
		public static long powLong(long a, long b) {
			long ans = 1;
			for (long mul = a;b > 0;b >>= 1, mul *= mul) if ((b & 1) != 0) ans *= mul;
			return ans;
		}
		public static int pow(int a, int b, int mod) {
			if (b < 0) b = b % (mod - 1) + mod - 1;
			long ans = 1;
			for (long mul = a;b > 0;b >>= 1, mul = mul * mul % mod) if ((b & 1) != 0) ans = ans * mul % mod;
			return (int)ans;
		}
		public static int floorsqrt(long n) {
			return (int)Math.sqrt(n + 0.1);
		}
		public static int ceilsqrt(long n) {
			return n <= 1 ? (int)n : (int)Math.sqrt(n - 0.1) + 1;
		}
	}
}
0