제출 #306461

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
306461		sofapuden	Pairs (IOI07_pairs)	C++14	30 / 100	90 ms	1784 KiB

pairs

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

int main(){
	int b; cin >> b;
	if(b == 1){
		ll n, d, m; cin >> n >> d >> m;
		vector<int> v(n);
		for(auto &x : v)cin >> x;
		sort(v.begin(), v.end());
		int ptrl = 0, ptrh = 0;
		ll ans = 0;
		for(; ptrh < n; ++ptrh){
			while(abs(v[ptrh]-v[ptrl])> d){
				ptrl++;
			}
			ans+=ptrh-ptrl;
		}
		cout << ans << "\n";
	}
	if(b == 2){
		ll n, d, m; cin >> n >> d >> m;
		
	}
	if(b == 3){
		ll n, d, m; cin >> n >> d >> m;
		
	}
}
	

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