Submission #874896

#	Time	Username	Problem	Language	Result	Execution time	Memory
874896		veehj	Pairs (IOI07_pairs)	C++17	30 / 100	41 ms	3128 KiB

pairs

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
#define F first
#define S second
#define pb push_back
#define sz(a) (int)a.size()
#define all(x) (x).begin(), (x).end()
ll b, n, d, m;

void f2(){
    vector<pair<ll, ll>> v(n);
    for(auto& u : v) cin >> u.F >> u.S;
    
}

void f1(){
    vector<ll> v(n);
    for(auto& u : v) cin >> u;
    sort(all(v));
    ll ans=0;
    for(ll i=0; i<n; i++){
        ans+=upper_bound(all(v), v[i]+d)-v.begin();
        ans-=i+1;
    }
    cout << ans << endl;
}

int main() {
    cin >> b >> n >> d >> m;
    if(b==1) f1();
    if(b==2) f2();
}

• 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