제출 #1284934

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1284934		alizhan	Pairs (IOI07_pairs)	C++20	29 / 100	4094 ms	2624 KiB

pairs

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod =  1e9 + 7;
const int N = (int)5e5 + 7;
#define skip continue
#define uno first
#define duo second
#define GO while(tt--)
#define ins insert
#define pb push_back
#define all(x) x.begin(), x.end()
#define Kaldun ios::sync_with_stdio(false); cin.tie(nullptr)
#define int long long

int bp(int a, int n) {
    if(n == 0) return 1;
    if(n % 2 == 1) return (bp(a, n-1) * a) % mod;
    long long b = bp(a, n/2);
    return (b * b) % mod;
}int f[1001];
int comb(int n, int k){if(k < 0 || k > n) return 0;int d = (f[k] * 1LL * f[n - k]) % mod;return (f[n] * 1LL * bp(d, mod - 2)) % mod;}
int lcm(int a,int b){ return (a * b) / __gcd(a,b);}
void solve(){
    int k,n,d,m;
    cin>>k>>n>>d>>m;
    int a[n+1],b[n+1],c[n+1];
    if(k==1){
        for(int i=1;i<=n;i++){
            cin>>a[i];
        }
        int cnt = 0;
        for(int i=1;i<=n;i++){
            for(int j=i+1;j<=n;j++){
                if(abs(a[i] - a[j]) <= d) cnt++;
            }
        }
        cout<<cnt<<endl;
    }
    if(k==2){
        for(int i=1;i<=n;i++){
            cin>>a[i]>>b[i];
        }
        int cnt = 0;
        for(int i=1;i<=n;i++){
            for(int j=i+1;j<=n;j++){
                if(abs(a[i] - a[j]) + abs(b[i] - b[j]) <= d) cnt++;
            }
        }
        cout<<cnt<<endl;
    }
    if(k==3){
        for(int i=1;i<=n;i++){
            cin>>a[i]>>b[i]>>c[i];
        }
        int cnt = 0;
        for(int i=1;i<=n;i++){
            for(int j=i+1;j<=n;j++){
                if(abs(a[i] - a[j]) + abs(b[i] - b[j]) + abs(c[i] - c[j]) <= d) cnt++;
            }
        }
        cout<<cnt<<endl;
    }
}
signed main() {
    Kaldun;
    cout.precision(0);
    //freopen("time.in", "r", stdin);
    //freopen("time.out", "w", stdout);
    int tt=1;
    //cin>>tt;
    while(tt--){
        solve();
    }
}

• Subtask 1: 6 / 6
• Subtask 2: 6 / 6
• Subtask 3: 0 / 6
• Subtask 4: 0 / 6
• Subtask 5: 0 / 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