#530165 (Java21) No.1170 Never Want to Walk

• 問題: No.1170 Never Want to Walk
• ユーザー: CuriousFairy315
• 提出日時: 2020-08-14 21:45:57
• 言語: Java21 (openjdk 21)
• 結果: AC
• 実行時間: 377 ms / 2,000 ms
• コード長: 7,307 bytes
• コンパイル時間: 3,883 ms
• コンパイル使用メモリ: 80,044 KB
• 実行使用メモリ: 59,696 KB
• 最終ジャッジ日時: 2024-10-10 14:53:01
• 合計ジャッジ時間: 10,767 ms
• ジャッジサーバーID （参考情報）: judge5 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	51 ms; 50,172 KB
testcase_01	AC	51 ms; 49,964 KB
testcase_02	AC	48 ms; 50,112 KB
testcase_03	AC	48 ms; 50,116 KB
testcase_04	AC	48 ms; 50,140 KB
testcase_05	AC	49 ms; 50,096 KB
testcase_06	AC	49 ms; 50,184 KB
testcase_07	AC	47 ms; 50,060 KB
testcase_08	AC	49 ms; 49,892 KB
testcase_09	AC	49 ms; 49,972 KB
testcase_10	AC	50 ms; 49,884 KB
testcase_11	AC	49 ms; 50,192 KB
testcase_12	AC	55 ms; 49,952 KB
testcase_13	AC	56 ms; 50,456 KB
testcase_14	AC	55 ms; 50,244 KB
testcase_15	AC	55 ms; 52,184 KB
testcase_16	AC	54 ms; 50,252 KB
testcase_17	AC	55 ms; 50,388 KB
testcase_18	AC	52 ms; 50,140 KB
testcase_19	AC	57 ms; 49,896 KB
testcase_20	AC	56 ms; 49,892 KB
testcase_21	AC	55 ms; 50,016 KB
testcase_22	AC	55 ms; 49,740 KB
testcase_23	AC	55 ms; 50,168 KB
testcase_24	AC	55 ms; 50,244 KB
testcase_25	AC	56 ms; 50,228 KB
testcase_26	AC	58 ms; 50,160 KB
testcase_27	AC	377 ms; 59,424 KB
testcase_28	AC	329 ms; 59,276 KB
testcase_29	AC	320 ms; 59,164 KB
testcase_30	AC	335 ms; 59,696 KB
testcase_31	AC	308 ms; 59,388 KB
testcase_32	AC	325 ms; 59,264 KB
testcase_33	AC	336 ms; 59,132 KB
testcase_34	AC	350 ms; 59,432 KB
testcase_35	AC	327 ms; 59,288 KB
testcase_36	AC	328 ms; 59,276 KB
testcase_37	AC	333 ms; 59,164 KB
testcase_38	AC	329 ms; 59,012 KB

ソースコード

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();
	}

	private class UnionFind {
		final int[] parent;
		UnionFind(int N) {
			parent = new int[N];
			java.util.Arrays.fill(parent, -1);
		}
		public boolean unite(int l, int r) {
			int u = root(l), v = root(r);
			if (u == v) return false;
			if (parent[u] < parent[v]) {
				parent[u] += parent[v];
				parent[v] = u;
			} else {
				parent[v] += parent[u];
				parent[u] = v;
			}
			return true;
		}
		public int size(int n) {
			return -parent[root(n)];
		}

		public boolean isUnite(int l, int r) {
			return root(l) == root(r);
		}

		private int root(int n) {
			if (parent[n] < 0) return n;
			return parent[n] = root(parent[n]);
		}
	}

	public void solve(FastScanner fs, java.io.PrintWriter out) {
		int N = fs.nextInt(), A = fs.nextInt(), B = fs.nextInt();
		int[] x = new int[N];
		for (int i = 0;i < N;++ i) x[i] = fs.nextInt();
		UnionFind uf = new UnionFind(N);
		for (int l = 0, r = 0;l < N;++ l) {
			while(r < N && x[r] - x[l] < A) ++ r;
			while(r < N && x[r] - x[l] <= B) {
				uf.unite(l, r);
				++ r;
			}
			-- r;
		}
		for (int i = 0;i < N;++ i) out.println(uf.size(i));
	}

	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;
		}
	}
}