제출 #94771

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
94771		SuperJava	Pairs (IOI07_pairs)	C++17	20 / 100	4035 ms	2604 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<int> u[76][76];

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);
	}else if(b == 2){
		assert(0);
	}else{
		vector<tuple<int,int,int>> v;
		rep(i,0,n){
			int w,q,e;
			cin >> q >> w >> e;
			v.emplace_back(q,w,e);
			u[q][w].push_back(e);
		}
		sort(v.begin(), v.end());
		rep(i,0,75){
			rep(j,0,75){
				sort(u[i+1][j+1].begin(), u[i+1][j+1].end());
			}
		}
		ll ans = 0;
		rep(i,0,n){
			int x,y,z;
			tie(x,y,z) = v[i];
			for (int j = max(1,x-d); j <= min(x+d,75); ++j){
				int dist = abs(j-x);
				for (int k = max(1,y-(d-dist)); k <= min(y+(d-dist),75); ++k){
					int dist2 = dist + abs(k-y);
					ans += upper_bound(u[j][k].begin(), u[j][k].end(),z+(d-dist2))-
							lower_bound(u[j][k].begin(), u[j][k].end(),z-(d-dist2));
				}
			}
		}
		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