제출 #991481

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
991481		goats_9	Sails (IOI07_sails)	C++17	60 / 100	70 ms	3164 KiB

sails

/* Author: goats_9 */

#include <bits/stdc++.h>
using namespace std;

using ll = long long;

#define LSOne(s) (s & -(s))

class BIT {
	int n;
	vector<ll> values;

public:
	BIT(int _n) : n(_n), values(n + 1, 0LL) {}

	void update(int l, int r, int v) {
		if (r <= l) return;
		for (; l <= n; l += LSOne(l)) values[l] += v;
		for (; r <= n; r += LSOne(r)) values[r] -= v;
	}

	ll query(int i) {
		if (i > n) return -1;
		ll ret = 0;
		for (; i; i -= LSOne(i)) ret += values[i];
		return ret;
	}
};

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int n;
	cin >> n;
	BIT ft(n);
	vector<array<int, 2>> mast(n);
	for (int i = 0; i < n; i++) cin >> mast[i][0] >> mast[i][1];
	sort(mast.begin(), mast.end());
	for (auto [h, k] : mast) {
		int ht = ft.query(h - k + 1);
		int l = 0, r = h;
		while (r - l > 1) {
			int g = (l + r) / 2;
			if (ft.query(g) > ht) l = g;
			else r = g;
		}
		int l1 = r;
		l = 1, r = h + 1;
		while (r - l > 1) {
			int g = (l + r) / 2;
			if (ft.query(g) >= ht) l = g;
			else r = g;
		}
		ft.update(r, h + 1, 1);
		ft.update(l1, l1 + k + r - h - 1, 1);
	}
	ll ans = 0;
	for (int i = 1; i <= n; i++) {
		ll u = ft.query(i);
		ans += u*(u - 1)/2;
	}
	cout << ans;
	return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 5 / 5
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10
• Subtask 11: 10 / 10