Submission #1284918

#	Time	Username	Problem	Language	Result	Execution time	Memory
1284918		dobri_oke	Pairs (IOI07_pairs)	C++20	30 / 100	14 ms	1220 KiB

pairs

#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define pb push_back
#define int long long

const int N = 1e6+100;
int b, n, d, m, a[N];

void solve(){
    cin >> b >> n >> d >> m;
    for(int i = 1; i <= n; i++) cin >> a[i];
    if(b == 1){
        sort(a + 1, a + n + 1);
        int j = 1, ans = 0;
        for(int i = 1; i < n; i ++){
            while(j <= n && a[j] - a[i] <= d || j < i) j++;
            ans += j - i - 1;
        }
        cout << ans << '\n';
        return;
    }
    else if (b == 2){
           
    }
    else{
        
    }
}

signed main(){   
    ios_base::sync_with_stdio(0);   cin.tie(0);
    //freopen("promote.in","r",stdin);
    //freopen("promote.out","w",stdout);
    int tt=1;
   // cin >> tt;
    while(tt--){
        solve();
    }
}

• 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