Submission #94757

#	Time	Username	Problem	Language	Result	Execution time	Memory
94757		SuperJava	Pairs (IOI07_pairs)	C++17	20 / 100	4030 ms	102860 KiB

pairs

//fold
#ifndef KHALIL
#include <bits/stdc++.h>
#else
#include "header.h"
#endif
#define endl '\n'
#define mp make_pair
#define tostr(x) static_cast<ostringstream&>((ostringstream()<<dec<<x)).str()
#define rep(i,begin,end) for(auto i = begin;i < end;i++)
#define repr(i,begin,end) for(auto i = begin-1;i >= end;i--)
#define pb push_back
#define sz(a) ((int)(a).size())
#define fi first
#define se second
#define abs(a) ((a) < (0) ? (-1)*(a) : (a))
#define SQ(a) ((a)*(a))
#define eqd(a,b) (abs(a-b)<1e-9)
#define X real()
#define Y imag()
using namespace std;
typedef long long ll;
typedef long double ld;
template <typename t> t in(t q){cin >> q;return q;}
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v){os << "[";for (int i = 0; i < sz(v); ++i) { os << v[i]; if (i != sz(v) - 1) os << ",";}os << "]";return os;}
template <typename T, typename S>ostream& operator<<(ostream& os, const map<T, S>& v){for (auto it : v)os << "(" << it.first << ":" << it.second << ")";return os;}
template <typename T, typename S>ostream& operator<<(ostream& os, const pair<T, S>& v){os << "(" << v.first << "," << v.second << ")";return os;}
const long double PI = acosl(-1);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::steady_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);}
inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);}
//endfold
#define  N  (100'005)
#define MOD (1000000000l + 7l)
#define OO (1050000000)
#define OOL (1100000000000000000)
 
//vector<pair<ll,ll>> base;
vector<pair<int,int>> bs[76];
//vector<ll> seg[N*4];
int* segi[76][N*4];

int len[76][N*4];

/*
void build(int n,int l,int r){
	if(l == r){
		seg[n].push_back(base[l].first-base[l].second);
		return;
	}
	int mid = (l+r)/2;
	build(2*n,l,mid);
	build(2*n+1,mid+1,r);
	seg[n] = seg[2*n];
	seg[n].insert(seg[n].end(),seg[2*n+1].begin(),seg[2*n+1].end());
	sort(seg[n].begin(), seg[n].end());
}

ll get(int n,int l,int r,ll x,ll e,ll q,ll w){
	if(l > e || r < x) return 0;
	if(x <= l && r <= e)
		return upper_bound(seg[n].begin(), seg[n].end(), w) -
				lower_bound(seg[n].begin(), seg[n].end(), q);
	ll mid = (l+r)/2;
	return get(2*n,l,mid,x,e,q,w)+get(2*n+1,mid+1,r,x,e,q,w);
}
*/

void buildi(int i,int n,int l,int r){
	if(l == r){
		segi[i][n] = new int[1];
		len[i][n] = 1;
		segi[i][n][0] = bs[i][l].first-bs[i][l].second;
		return;
	}
	int mid = (l+r)/2;
	buildi(i,2*n,l,mid);
	buildi(i,2*n+1,mid+1,r);
	segi[i][n] = new int[r-l+1];
	len[i][n] = r-l+1;
	rep(j,l,mid+1){
		segi[i][n][j-l] = segi[i][2*n][j-l];
	}
	rep(j,mid+1,r+1){
		segi[i][n][j-l] = segi[i][2*n+1][j-mid-1];
	}
	sort(segi[i][n], segi[i][n]+len[i][n]);
}

int i1,x1,e1,q1,w1;

int bin(int n,int v){
	int mid,best = len[i1][n];
	int l = 0,r = len[i1][n]-1;
	while(l <= r){
		mid = (l+r)/2;
		if(segi[i1][n][mid] < v) l = mid+1;
		else{
			best = mid;
			r = mid-1;
		}
	}
	return best;
}

map<pair<pair<int,int>,tuple<int,int,int>>,int> m;

int geti(int n,int l,int r){
	if(l > e1 || r < x1) return 0;
	if(n == 1){
		if(m.count({{x1,e1},{q1,w1,i1}}))
			return m[{{x1,e1},{q1,w1,i1}}];
		if(x1 <= l && r <= e1){
			m[{{x1,e1},{q1,w1,i1}}] = bin(n,w1+1)-bin(n,q1);
			return m[{{x1,e1},{q1,w1,i1}}];
		}
		int mid = (l+r)/2;
		m[{{x1,e1},{q1,w1,i1}}] = geti(2*n,l,mid)+geti(2*n+1,mid+1,r);
		return m[{{x1,e1},{q1,w1,i1}}];
	}
	if(x1 <= l && r <= e1){
		return bin(n,w1+1)-bin(n,q1);
	}
	int mid = (l+r)/2;
	return geti(2*n,l,mid)+geti(2*n+1,mid+1,r);
}

int main(){
	//fold
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	cout << setprecision(10);
	//endfold
	int b,n,d,m;
	cin >> b >> n >> d >> m;
	if(b == 1){
		assert(0);
		/*vector<ll> v;
		rep(i,0,n){
			ll w;
			cin >> w;
			v.push_back(w);
		}
		sort(v.begin(), v.end());
		ll ans = 0;
		rep(i,0,n){
			ans += upper_bound(v.begin(), v.end(),v[i]+d)-lower_bound(v.begin(), v.end(),v[i]-d)-1;
		}
		cout << ans/2;*/
	}else if(b == 2){
		assert(0);
		/*vector<ll> z;
		rep(i,0,n){
			ll w,q;
			cin >> q >> w;
			base.push_back({q,w});
			z.push_back(q+w);
		}
		sort(z.begin(), z.end());
		sort(base.begin(), base.end(),
			[](pair<int,int> a,pair<int,int> b){
				return a.first+a.second < b.first+b.second;
			});
		build(1,0,n-1);
		ll ans = 0;
		rep(i,0,n){
			ll l = lower_bound(z.begin(), z.end(),z[i]-d)-z.begin();
			ll r = upper_bound(z.begin(), z.end(),z[i]+d)-z.begin()-1;
			ans += get(1,0,n-1,l,r,base[i].first-d-base[i].second,
									base[i].first+d-base[i].second);
		}
		cout << (ans-n)/2 << endl;*/
	}else{
		d = min(d,75*3);
		vector<tuple<int,int,int>> v;
		vector<int> z[76];
		rep(i,0,n){
			int w,q,e;
			cin >> q >> w >> e;
			v.emplace_back(q,w,e);
			z[q].push_back(w+e);
			bs[q].emplace_back(w,e);
		}
		sort(v.begin(), v.end());
		rep(i,1,m+1){
			if(z[i].empty()) continue;
			sort(z[i].begin(), z[i].end());
		}
		rep(i,1,m+1){
			sort(bs[i].begin(), bs[i].end(),
			[](pair<ll,ll> a,pair<ll,int> qw){
				return a.first+a.second < qw.first+qw.second;
			});
		}
		rep(i,1,76){
			if(sz(z[i]))
				buildi(i,1,0,sz(z[i])-1);
		}
		ll ans = 0;
		int x,y,p,dist,l,r;
		rep(i,0,n){
			tie(x,y,p) = v[i];
			for (int j = max(1,x-d); j <= min(x+d,m); ++j){
				if(z[j].empty()) continue;
				dist = abs(j-x);
				l = lower_bound(z[j].begin(), z[j].end(),y+p-(d-dist))-z[j].begin();
				r = upper_bound(z[j].begin(), z[j].end(),y+p+(d-dist))-z[j].begin()-1;
				if(l <= r && l != sz(z[j])){
					i1 = j;
					x1 = l; 
					e1 = r; 
					q1 = max(-74,y-(d-dist)-p); 
					w1 = min(y+(d-dist)-p,74);
					ans += geti(1,0,sz(z[j])-1);
				}
			}
		}
		cout << (ans-n)/2;
	}
	return 0;
}

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