Submission #263206

#	Time	Username	Problem	Language	Result	Execution time	Memory
263206		sjimed	Pairs (IOI07_pairs)	C++14	30 / 100	150 ms	91952 KiB

pairs

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

#define fast ios::sync_with_stdio(false); cin.tie(0);
#define pre(a) cout << fixed; cout.precision(a);
#define fi first
#define se second
#define em emplace
#define eb emplace_back
#define all(v) (v).begin() (v).end()
#define mp make_pair
#define mt make_tuple

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const ll INF = 1e18;
const int inf = 1e9;

struct point {
	ll x[3];
	point() {
		x[0] = x[1] = x[2] = 0;
	}

	bool operator<(point &p) {
		return mt(x[0], x[1], x[2]) < mt(p.x[0], p.x[1], p.x[2]);
	}
};

ll b, n, d, m;
point p[100010];
ll tree[150010];
vector<int> v[1500010];
vector<pii> st[150010], ed[150010];


void update(int i) {
	while(i <= 150010) {
		tree[i]++;

		i += i & -i;
	}
}

ll cal(int i) {
	ll ret = 0;
	while(i) {
		ret += tree[i];
		i -= i & -i;
	}

	return ret;
}

int main() {
	fast;

	cin >> b >> n >> d >> m;

	for(int i=1; i<=n; i++) {
		for(int j=0; j<b; j++) {
			cin >> p[i].x[j];
		}
	}

	for(int i=1; i<=n; i++) {
		int x = p[i].x[0];
		int y = p[i].x[1];

		v[x+y].eb(x - y);

		st[max(2LL, x + y - d)].eb(max(1-m, x-y-d), min(m-1, x-y+d));
		ed[min(2*m, x + y + d)].eb(max(1-m, x-y-d), min(m-1, x-y+d));
	}

	ll ans = 0;
	for(int i=2; i<=2*m; i++) {
		for(auto j : st[i]) {
			ans -= cal(m+j.se) - cal(m+j.fi-1);
		}

		for(auto j : v[i]) {
			update(m+j);
		}

		for(auto j : ed[i]) {
			ans += cal(m+j.se) - cal(m+j.fi-1);
		}
	}

	cout << (ans - n)/2;
}

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