Submission #386304

#	Time	Username	Problem	Language	Result	Execution time	Memory
386304		AmineTrabelsi	Pairs (IOI07_pairs)	C++14	30 / 100	58 ms	1644 KiB

pairs

#include <bits/stdc++.h>
using namespace std;
long long solve_D(){
    int n,d,m;
    cin>>n>>d>>m;
    vector<int> a(n);
    for(auto &i:a)cin>>i;
        sort(a.begin(),a.end());
    int p = 0;
    long long res = 0;
    for(int i=0;i<n;i++){
        while(p < i && a[i]-a[p] > d)p++;
        res += i-p; 
    }
    return res;
}
int main(){
	int b;
    cin>>b;
    if(b == 1)cout<<solve_D()<<'\n';
    else cout<<"to do\n";
	return 0;
}
/*
1 6 5 100
10 20 23 25 50 50 
1

*/

• 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