제출 #899751

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
899751		trMatherz	Pairs (IOI07_pairs)	C++17	60 / 100	4067 ms	260592 KiB

pairs

#include <iostream> //cin, cout

/*
#include <fstream>
std::ifstream cin ("ex.in");
std::ofstream cout ("ex.out");
*/




// includes
#include <cmath> 
#include <set>
#include <map>
#include <queue>
#include <string>
#include <vector>
#include <array>
#include <algorithm>
#include <numeric>
#include <iomanip>
#include <unordered_set>
#include <stack>
#include <ext/pb_ds/assoc_container.hpp>
#include <random>
#include <chrono>



//usings 
using namespace std;
using namespace __gnu_pbds;


// misc
#define ll long long
#define pb push_back
#define pq priority_queue
#define ub upper_bound
#define lb lower_bound
template<typename T, typename U> bool emin(T &a, const U &b){ return b < a ? a = b, true : false; }
template<typename T, typename U> bool emax(T &a, const U &b){ return b > a ? a = b, true : false; }
typedef uint64_t hash_t;

// vectors
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vpii vector<pair<int, int>>
#define vvpii vector<vector<pair<int, int>>>
#define vppipi vector<pair<int, pair<int, int>>>
#define vl vector<ll>
#define vvl vector<vl>
#define vvvl vector<vvl>
#define vpll vector<pair<ll, ll>>
#define vb vector<bool>
#define vvb vector<vb>
#define vs vector<string>
#define sz(x) (int)x.size()
#define rz(x,y) x.resize(y)
#define all(x) x.begin(), x.end()


// pairs
#define pii pair<int, int>
#define pll pair<ll, ll>
#define mp make_pair
#define f first
#define s second

// sets
#define si set<int>
#define sl set<ll>
#define ss set<string>
#define in insert
template <class T> using iset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// maps
#define mii map<int, int>
#define mll map<ll, ll>

// loops
#define FR(x, z, y) for (int x = z; x < y; x++)
#define FRe(x, z, y) FR(x, z, y + 1)
#define F(x, y) FR(x, 0, y)
#define Fe(x, y) F(x, y + 1)
#define A(x, y) for(auto &x : y)

vi bit;
vvvi rbit;
void add(int x, int v){
	for(x++; x <= 160'000; x += x & -x) bit[x] += v;
}

int get(int x){
	int ret = 0;
	for(x++; x; x -= x & -x) ret += bit[x];
	return ret;
}

void rad(int x, int y, int z, int v){
	emax(x, 0); emin(x, 400);
	emax(y, 0); emin(y, 400);
	emax(z, 0); emin(z, 400);
	for(int i = x; i <= 400; i += i & -i) 
		for(int j = y; j <= 400; j += j & -j) 
			for(int u = z; u <= 400; u += u & -u) 
				rbit[i][j][u] += v;
}

int ret(int x, int y, int z){
	int ret = 0;
	for(int i = x; i; i -= i & -i) 
		for(int j = y; j; j -= j & -j) 
			for(int u = z; u; u -= u & -u) 
				ret += rbit[i][j][u];
	return ret;
}

int main(){
	
	int b, n, d, m; cin >> b >> n >> d >> m;
	if(b == 1){
		queue<int> cur;
		ll an = 0;
		vi a(n); 
		A(u, a) cin >> u; 
		sort(all(a));
		F(i, n){
			cur.push(a[i]);
			while(!cur.empty() && a[i] - cur.front() > d) cur.pop();
			an += sz(cur) - 1;
		}
		cout << an;
	} else if(b == 2){
		vpii a(n);
		A(u, a) {
			int x, y; cin >> x >> y;
			u.f = x - y; u.s = x + y;
		}
		ll an = 0;
		bit = vi(160'001, 0);
		sort(all(a));
		queue<pii> cur;
		F(i, n){
			cur.push(a[i]);
			while(!cur.empty() && a[i].f - cur.front().f > d) {
				add(max(0, cur.front().s - d), -1);
				add(min(cur.front().s + d + 1, 159'000), 1);
				cur.pop();
			}
			an += get(a[i].s);
			add(max(0, a[i].s - d), 1);
			add(min(a[i].s + d + 1, 159'000), -1);
		}
		cout << an;
	} else {
		ll an = 0;
		vector<array<int, 4>> a(n);
		A(u, a){
			int x, y, z; cin >> x >> y >> z;
			u[0] = x - y - z;
			u[1] = x - y + z + 100;
			u[2] = x + y - z + 100;
			u[3] = x + y + z + 100;
		}
		rbit = vvvi(401, vvi(401, vi(401, 0)));
		sort(all(a));
		queue<array<int, 4>> cur;
		A(u, a){
			cur.push(u);
			while(!cur.empty() && u[0] - cur.front()[0] > d) {
				rad(cur.front()[1] - d, cur.front()[2] - d, cur.front()[3] - d, -1);
				rad(cur.front()[1] + d + 1, cur.front()[2] + d + 1, cur.front()[3] + d + 1, 1);
				cur.pop();
			}
			an += ret(u[1], u[2], u[3]);
			rad(u[1] - d, u[2] - d, u[3] - d, 1);
			rad(u[1] + d + 1, u[2] + d + 1, u[3] + d + 1, -1);
		}
		cout << an;
	}
   
    return 0;
}

• Subtask 1: 6 / 6
• Subtask 2: 6 / 6
• Subtask 3: 6 / 6
• Subtask 4: 6 / 6
• Subtask 5: 6 / 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