제출 #1284930

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

pairs

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

#define pb push_back                    
#define ll long long 
#define s second
#define f first
#define all(v) v.begin(),v.end()
const long long inf = 2e9 + 7;
const int N = 1e5 + 10;
void solve(){
    int b,n,m,d;
    cin >> b >> n >> d >> m;
    int ans = 0;
    if(b == 1){
        vector <int> v;
        for(int i = 1; i <= n; i++){
            int x;
            cin >> x;
            v.pb(x);
        }
        for(int i = 0; i < v.size(); i++){
            for(int j = 0; j < i; j++){
                if(abs(v[j] - v[i]) <= d) ans++;
            }
        }
    }
    else if(b == 2){
        vector <array<int,2>> v;
        for(int i = 1; i <= n; i++){
            int x,y;
            cin >> x >> y;
            v.pb({x,y});
        }
        for(int i = 0; i < n; i++){
            for(int j = 0; j < i; j++){
                int sum = 0;
                for(int k = 0; k < 2; k++){
                    sum += abs(v[j][k] - v[i][k]);
                }
                if(sum <= d) ans++;
            }
        }
    }
    else{
        vector <array<int,3>> v;
        for(int i = 1; i <= n; i++){
            int x,y,z;
            cin >> x >> y >> z;
            v.pb({x,y,z});
        }
        for(int i = 0; i < n; i++){
            for(int j = 0; j < i; j++){
                int sum = 0;
                for(int k = 0; k < 3; k++){
                    sum += abs(v[j][k] - v[i][k]);
                }
                if(sum <= d) ans++;
            }
        }
    }
    cout << ans;
}
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    //freopen("promote.in", "r", stdin);
    //freopen("promote.out", "w", stdout);
    int t1 = 1;
    while(t1--){
     	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