Submission #697340

#	Time	Username	Problem	Language	Result	Execution time	Memory
697340		starplat	Pairs (IOI07_pairs)	C++14	70 / 100	2964 ms	7068 KiB

pairs

#include <bits/stdc++.h>
#define int long long
#define mp make_pair
using namespace std;
int b,n,d,m,ans;
void d1(){
    vector<int> c;
    for (int i=0;i<n;i++){
        c.push_back(0); cin>>c[i];
    }
    sort(c.begin(),c.end());
    int pt=0;
    for (int i=0;i<n;i++){
        while (pt+1<n && c[pt+1]<=c[i]+d) ++pt;
        ans+=pt-i;
    }
}

void d2(){
    vector<pair<int,int>> c;    

}
int frq[85][85][85],x[100005],y[100005],z[100005];
void d3(){
    for (int i=1;i<=n;i++){
        cin>>x[i]>>y[i]>>z[i];
        frq[x[i]][y[i]][z[i]]++;
    }
    for (int i=1;i<=m;i++){
        for (int j=1;j<=m;j++){
            for (int k=1;k<=m;k++) frq[i][j][k]+=frq[i][j][k-1];
        }
    }
    for (int k=1;k<=n;k++){
        for (int i=1;i<=m;i++){
            for (int j=1;j<=m;j++){
                int dist=d-abs(x[k]-i)-abs(y[k]-j);
                if (dist<0) continue;
                ans+=frq[i][j][min(m,z[k]+dist)]-frq[i][j][max(0LL,z[k]-dist-1)];
            }
        }
    }
    ans-=n; ans/=2;
}
signed main(){
    cin>>b>>n>>d>>m;
    if (b==1) d1();
    else if (b==2) d2();
    else d3();
    cout<<ans<<"\n";
}

• 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: 10 / 10
• Subtask 11: 10 / 10
• Subtask 12: 10 / 10
• Subtask 13: 10 / 10