#530205 (C++14) No.1170 Never Want to Walk

• 問題: No.1170 Never Want to Walk
• ユーザー: nikkukun
• 提出日時: 2020-08-14 21:50:00
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: WA
• 実行時間: -
• コード長: 1,414 bytes
• コンパイル時間: 1,711 ms
• コンパイル使用メモリ: 169,668 KB
• 実行使用メモリ: 6,820 KB
• 最終ジャッジ日時: 2024-10-10 15:00:11
• 合計ジャッジ時間: 7,292 ms
• ジャッジサーバーID （参考情報）: judge2 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,816 KB
testcase_01	AC	2 ms; 6,816 KB
testcase_02	AC	2 ms; 6,816 KB
testcase_03	AC	2 ms; 6,816 KB
testcase_04	AC	2 ms; 6,816 KB
testcase_05	AC	2 ms; 6,816 KB
testcase_06	AC	2 ms; 6,816 KB
testcase_07	AC	2 ms; 6,816 KB
testcase_08	AC	2 ms; 6,816 KB
testcase_09	AC	2 ms; 6,816 KB
testcase_10	AC	2 ms; 6,816 KB
testcase_11	AC	2 ms; 6,820 KB
testcase_12	WA	-
testcase_13	WA	-
testcase_14	WA	-
testcase_15	WA	-
testcase_16	WA	-
testcase_17	WA	-
testcase_18	WA	-
testcase_19	WA	-
testcase_20	WA	-
testcase_21	WA	-
testcase_22	AC	3 ms; 6,820 KB
testcase_23	AC	3 ms; 6,820 KB
testcase_24	AC	3 ms; 6,816 KB
testcase_25	AC	3 ms; 6,820 KB
testcase_26	AC	3 ms; 6,820 KB
testcase_27	WA	-
testcase_28	WA	-
testcase_29	WA	-
testcase_30	WA	-
testcase_31	WA	-
testcase_32	AC	300 ms; 6,820 KB
testcase_33	AC	301 ms; 6,816 KB
testcase_34	AC	303 ms; 6,816 KB
testcase_35	AC	305 ms; 6,820 KB
testcase_36	AC	302 ms; 6,820 KB
testcase_37	AC	296 ms; 6,816 KB
testcase_38	AC	310 ms; 6,816 KB

ソースコード

// 20:39 - 20:49
#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define lch (o << 1)
#define rch (o << 1 | 1)

typedef double db;
typedef long long ll;
typedef unsigned int ui;
typedef pair<int, int> pint;
typedef tuple<int, int, int> tint;

const int N = 2e5 + 5;
const int INF = 0x3f3f3f3f;
const ll INF_LL = 0x3f3f3f3f3f3f3f3f;

int pa[N], siz[N];
int Find(int x) {
	return x == pa[x] ? x : pa[x] = Find(pa[x]);
}

int x[N];

int main() {
	ios::sync_with_stdio(0);

	int n, a, b;
	cin >> n >> a >> b;

	for (int i = 1; i <= n; i++) {
		cin >> x[i];
		pa[i] = i;
		siz[i] = 1;
	}
	int p = 1; // [l, r]
	for (int i = 1; i <= n; i++) {
		int l = lower_bound(x + 1, x + n + 1, x[i] + a) - x;
		p = max(l, p);
		while (p <= n && x[p] <= x[i] + b) {
			int pa1 = Find(i);
			int pa2 = Find(p);
			if (pa1 != pa2) {
				siz[pa1] += siz[pa2];
				pa[pa2] = pa[pa1];
			}
			p++;
		}
	}

	for (int i = 1; i <= n; i++)
		x[i] = int(1e9) - x[i];
	reverse(x + 1, x + n + 1);

	p = 1;
	for (int i = 1; i <= n; i++) {
		int l = lower_bound(x + 1, x + n + 1, x[i] + a) - x;
		p = max(l, p);
		while (p <= n && x[p] <= x[i] + b) {
			int pa1 = Find(n - i + 1);
			int pa2 = Find(n - p + 1);
			if (pa1 != pa2) {
				siz[pa1] += siz[pa2];
				pa[pa2] = pa[pa1];
			}
			p++;
		}
	}

	for (int i = 1; i <= n; i++)
		cout << siz[Find(i)] << endl;

	return 0;
}