#421503 (C++14) No.956 Number of Unbalanced

• 問題: No.956 Number of Unbalanced
• ユーザー: QCFium
• 提出日時: 2020-01-26 00:25:11
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: WA
• 実行時間: -
• コード長: 1,870 bytes
• コンパイル時間: 1,851 ms
• コンパイル使用メモリ: 180,876 KB
• 実行使用メモリ: 41,912 KB
• 最終ジャッジ日時: 2024-09-14 04:19:20
• 合計ジャッジ時間: 6,737 ms
• ジャッジサーバーID （参考情報）: judge3 / judge2

入力	結果	実行時間; 実行使用メモリ
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	WA	-
testcase_07	WA	-
testcase_08	WA	-
testcase_09	WA	-
testcase_10	WA	-
testcase_11	WA	-
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	WA	-
testcase_23	WA	-
testcase_24	WA	-
testcase_25	WA	-
testcase_26	WA	-
testcase_27	WA	-
testcase_28	WA	-
testcase_29	WA	-

ソースコード

#include <bits/stdc++.h>

int ri() {
	int n;
	scanf("%d", &n);
	return n;
}

struct BIT {
	int n;
	std::vector<int64_t> data;
	std::vector<int> written;
	BIT (int n) : n(n), data(n + 1, 0) {}
	void add(int i, int val) {
		for (i++; i <= n; i += i & -i) data[i] += val, written.push_back(i);
	}
	int64_t sum(int r) {
		int res = 0;
		for (; r; r &= r - 1) res += data[r];
		return res;
	}
	void clear() {
		for (auto i : written) data[i] = 0;
		written.clear();
	}
};

struct BIT2 {
	int n;
	BIT tree0, tree1, tree2;
	BIT2(int n) : n(n), tree0(2 * n + 1), tree1(2 * n + 1), tree2(2 * n + 1) {}
	void add(int l, int r, int val) {
		l += n;
		r += n;
		tree0.add(l, val);
		tree1.add(l, -val * l);
		tree2.add(l, val * ((int64_t) l * (l - 1) / 2));
		tree0.add(r, -val);
		tree1.add(r, val * r);
		tree2.add(r, -val * ((int64_t) l * (l - 1) / 2 + (int64_t) r * (r - l) - (int64_t) (r - l) * (r - l + 1) / 2));
	}
private :
	int64_t sum1(int r) {
		return ((int64_t) r * (r + 1) / 2 * tree0.sum(r) + (int64_t) r * tree1.sum(r) + tree2.sum(r));
	}
public :
	int64_t sum2(int l, int r) {
		l += n;
		r += n;
		return sum1(r) - sum1(l);
	}
	void clear() {
		tree0.clear();
		tree1.clear();
		tree2.clear();
	}
};

int main() {
	int n = ri();
	int a[n];
	std::map<int, std::vector<int> > indexes;
	for (int i = 0; i < n; i++) a[i] = ri(), indexes[a[i]].push_back(i);
	BIT2 tree(n);
	int64_t res = 0;
	for (auto &i : indexes) {
		tree.add(0, 1, 1);
		int last = 0;
		int cur = 0;
		auto process_empty = [&] (int len) {
			if (!len) return;
			res += tree.sum2(cur - len - 1, cur - 1);
			tree.add(cur - len, cur, 1);
			cur -= len;
		};
		for (auto j : i.second) {
			process_empty(j - last);
			res += tree.sum2(cur, cur + 1);
			cur++;
			tree.add(cur, cur + 1, 1);
			last = j + 1;
		}
		process_empty(n - last);
		tree.clear();
	}
	std::cout << res << std::endl;
	return 0;
}