제출 #620015

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
620015		1ne	Pairs (IOI07_pairs)	C++14	70 / 100	4073 ms	5744 KiB

pairs

#include<bits/stdc++.h>
using namespace std;
struct dataa{
	long long v = 0;
	void add(long long left,long long right,long long val){
		v+=val;
		//sum += val *(right - left + 1);
	}
};
long long S,T;
struct Segment_Tree{
	vector<dataa>tree;
	void init(long long n){
		tree.resize(2*n - 1);
	}
	dataa combine(dataa left,dataa right){
		dataa res;
		res.v = left.v + right.v;
		return res;
	}
	long long query(long long node,long long left,long long right,long long qleft,long long qright){
		if (qright<left|| qleft > right)return 0;
		if (qleft<=left && qright>=right){
			return tree[node].v;
		}
		long long mid = (left + right)>>1;
		long long z = node + ((mid - left + 1)<<1);
		return query(node + 1,left,mid,qleft,qright) + query(z,mid + 1,right,qleft,qright);
	}
	void update(long long node,long long left,long long right,long long uleft,long long uright,long long v){
		if (left > uright || right < uleft) return;
		if (uleft <= left && right <=uright){
			tree[node].add(left,right,v);
			return;
		}
		long long mid = (left + right)>>1;
		long long z = node + ((mid - left + 1)<<1);
		if (uleft<=mid){
			update(node + 1,left,mid,uleft,uright,v);
		}
		if (uright > mid){
			update(z,mid + 1,right,uleft,uright,v);
		}
		tree[node] = combine(tree[node + 1],tree[z]);
	}
};

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	int b,n,d,m;cin>>b>>n>>d>>m;
	if (b == 1){
		vector<int>arr(n);
		for (int i = 0;i<n;++i)cin>>arr[i];
		sort(arr.begin(),arr.end());
		long long ans = 0;
		int l = 0;
		for (int i = 0;i<n;++i){
			while(l<n && arr[l] - arr[i]<=d)++l;
			ans+=l - i - 1;
		}
		cout<<ans<<'\n';
	}
	else if (b == 2){
		vector<int>arr(n),brr(n);
		for (int i = 0;i<n;++i){
			int x,y;cin>>x>>y;
			arr[i] = x + y;
			brr[i] = x - y + m;
		}
		vector<int>order(n);
		iota(order.begin(),order.end(),0);
		sort(order.begin(),order.end(),[&](int i,int j){
			return arr[i] < arr[j];
		});
		long long ans = 0;
		Segment_Tree st;
		st.init(m * 2 + 5);
		int l = 0;
		for (int i = 0;i<n;++i){
			while(l<n && arr[order[l]] - arr[order[i]]<=d){st.update(0,0,m * 2 + 4,brr[order[l]],brr[order[l]],1);++l;}
			ans+=st.query(0,0,m * 2 + 4,brr[order[i]] - d,brr[order[i]] + d);
			st.update(0,0,m * 2 + 4,brr[order[i]],brr[order[i]],-1);
		}
		cout<<ans - n<<'\n';
	}
	else{
		long long ans = 0;
		vector<vector<int>>arr(n,vector<int>(3));
		for (int i = 0;i<n;++i){
			for (int j = 0;j<3;++j){
				cin>>arr[i][j];
			}
		}
		for (int i = 0;i<n;++i){
			for (int j = i + 1;j<n;++j){
				long long sum = abs(arr[i][0] - arr[j][0]) + abs(arr[i][1] - arr[j][1]) + abs(arr[i][2] - arr[j][2]);
				if (sum<=d)ans++;
			}
		}
		cout<<ans<<'\n';
	}
	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: 10 / 10
• Subtask 11: 0 / 10
• Subtask 12: 0 / 10
• Subtask 13: 0 / 10