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

• 問題: No.1170 Never Want to Walk
• ユーザー: Kude
• 提出日時: 2020-08-14 21:55:45
• 言語: C++14 (gcc 13.2.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 349 ms / 2,000 ms
• コード長: 1,581 bytes
• コンパイル時間: 1,839 ms
• コンパイル使用メモリ: 165,772 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-04-18 21:41:05
• 合計ジャッジ時間: 8,065 ms
• ジャッジサーバーID （参考情報）: judge2 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	2 ms; 5,376 KB
testcase_05	AC	2 ms; 5,376 KB
testcase_06	AC	2 ms; 5,376 KB
testcase_07	AC	2 ms; 5,376 KB
testcase_08	AC	2 ms; 5,376 KB
testcase_09	AC	2 ms; 5,376 KB
testcase_10	AC	2 ms; 5,376 KB
testcase_11	AC	2 ms; 5,376 KB
testcase_12	AC	3 ms; 5,376 KB
testcase_13	AC	3 ms; 5,376 KB
testcase_14	AC	4 ms; 5,376 KB
testcase_15	AC	3 ms; 5,376 KB
testcase_16	AC	4 ms; 5,376 KB
testcase_17	AC	3 ms; 5,376 KB
testcase_18	AC	3 ms; 5,376 KB
testcase_19	AC	3 ms; 5,376 KB
testcase_20	AC	4 ms; 5,376 KB
testcase_21	AC	4 ms; 5,376 KB
testcase_22	AC	3 ms; 5,376 KB
testcase_23	AC	4 ms; 5,376 KB
testcase_24	AC	3 ms; 5,376 KB
testcase_25	AC	3 ms; 5,376 KB
testcase_26	AC	4 ms; 5,376 KB
testcase_27	AC	331 ms; 5,376 KB
testcase_28	AC	330 ms; 5,376 KB
testcase_29	AC	341 ms; 5,376 KB
testcase_30	AC	342 ms; 5,376 KB
testcase_31	AC	326 ms; 5,376 KB
testcase_32	AC	326 ms; 5,376 KB
testcase_33	AC	333 ms; 5,376 KB
testcase_34	AC	338 ms; 5,376 KB
testcase_35	AC	340 ms; 5,376 KB
testcase_36	AC	335 ms; 5,376 KB
testcase_37	AC	329 ms; 5,376 KB
testcase_38	AC	349 ms; 5,376 KB

ソースコード

#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define chmax(a, b) a = max(a, b);
#define chmin(a, b) a = min(a, b);
using namespace std;
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
class DSU {
	private:
		int *data;
	public:
		DSU(int n) {
			data = new int[n];
			for(int i = 0; i < n; i++) {
				data[i] = -1;
			}
		}

		~DSU() {delete[] data;}

		// path compression without recursion
		int find(int i) {
			int parent;
			int back_to = -1;
			for(; (parent = data[i]) >= 0; i = parent) {
				data[i] = back_to;
				back_to = i;
			}
			int root = i;
			while(back_to != -1) {
				i = back_to;
				back_to = data[i];
				data[i] = root;
			}
			return root;
		}

		// union by size
		// returns 0 if union not performed
		// note that 'union' is reserved word
		int merge(int i, int j) {
			int ri = find(i), rj = find(j);
			if (ri == rj)
				return 0;
			if (data[ri] > data[rj]) {
				int t = ri;
				ri = rj;
				rj = t;
			}
			data[ri] += data[rj];
			data[rj] = ri;
			return 1;
		}

		int get_size(int i) {
			return -data[find(i)];
		}
};

int main() {
    int n, a, b;
    cin >> n >> a >> b;
    VI x(n);
    rep(i, n) cin >> x[i];
    DSU d(n);
    int l = 0, r = 0;
    rep(i, n) {
        while(l < n && x[l] - x[i] < a) l++;
        if (l < r) {
            d.merge(i, l);
        } else {
            r = l;
        }
        while(r < n && x[r] - x[i] <= b) {
            d.merge(i, r);
            r++;
        }
    }
    rep(i, n) {
        cout << d.get_size(i) << endl;
    }
}