제출 #890845

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
890845		Sir_Ahmed_Imran	Pairs (IOI07_pairs)	C++17	47 / 100	4067 ms	1760 KiB

pairs

                              ///~~~LOTA~~~///
#include <bits/stdc++.h>
using namespace std;
#define nl '\n'
#define ff first
#define ss second
#define ll long long 
#define append push_back
#define all(x) (x).begin(),(x).end()
void solvefor1(){
    ll r;
    int n,m,o,p;
    cin>>n>>o>>m;
    vector<int> v;
    for(int i=0;i<n;i++){
        cin>>p;
        v.append(p);
    }
    sort(all(v));
    for(int i=r=0;i<n;i++){
        p=i;
        for(int j=65536;j>0;j/=2){
            if(p+j>=n) continue;
            if(v[p+j]-v[i]<=o) p+=j;
        }
        r+=p-i;
    }
    cout<<r;
}
void solvefor2(){
    int n,m,o,p,q,r;
    cin>>n>>o>>m;
    vector<int> x,y;
    for(int i=0;i<n;i++){
        cin>>p>>q;
        x.append(p);
        y.append(q);
    }
    for(int i=r=0;i<n;i++)
        for(int j=i+1;j<n;j++)
            r+=(abs(x[i]-x[j])+abs(y[i]-y[j])<=o);
    cout<<r;
}
void solvefor3(){
    int n,m,o,p,q,r;
    cin>>n>>o>>m;
    vector<int> x,y,z;
    for(int i=0;i<n;i++){
        cin>>p>>q>>r;
        x.append(p);
        y.append(q);
        z.append(r);
    }
    for(int i=r=0;i<n;i++)
        for(int j=i+1;j<n;j++)
            r+=(abs(x[i]-x[j])+abs(y[i]-y[j])
            +abs(z[i]-z[j])<=o);
    cout<<r;
}
void solve(){
    int t;
    cin>>t;
    if(t==1) solvefor1();
    if(t==2) solvefor2();
    if(t==3) solvefor3();
}
int main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    solve();
    return 0;
}

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