제출 #1040885

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1040885		ArthuroWich	Pairs (IOI07_pairs)	C++17	47 / 100	4077 ms	3420 KiB

pairs

#include <bits/stdc++.h>
using namespace std;
#define int long long int
int b, n, d, m, ans = 0;
void solve1() {
    vector<int> a(n);
    for (int &x : a) {
        cin >> x;
    }
    sort(a.begin(), a.end());
    for (int i = 0; i < n; i++) {
        int r = upper_bound(a.begin(), a.end(), a[i]+d) - a.begin();
        ans += r-i-1;
    }
}
void solve2() {
    vector<pair<int, int>> a(n);
    for (auto &[x, y] : a) {
        cin >> x >> y;
    }
    for (int i = 0; i < n; i++) {
        for (int j = i+1; j < n; j++) {
            auto [x1, y1] = a[i];
            auto [x2, y2] = a[j];
            if (abs(x1-x2)+abs(y1-y2) <= d) {
                ans++;
            }
        }
    }
}
void solve3() {
    vector<tuple<int, int, int>> a(n);
    for (auto &[x, y, z] : a) {
        cin >> x >> y >> z;
    }
    for (int i = 0; i < n; i++) {
        for (int j = i+1; j < n; j++) {
            auto [x1, y1, z1] = a[i];
            auto [x2, y2, z2] = a[j];
            if (abs(x1-x2)+abs(y1-y2)+abs(z1-z2) <= d) {
                ans++;
            }
        }
    }
}
void solve() {
    cin >> b >> n >> d >> m;
    if (b == 1) {
        solve1();
    } else if (b == 2) {
        solve2();
    } else {
        solve3();
    }
    cout << ans << endl;
}
int32_t main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t;
    t = 1;
    while(t--) {
        solve();
    }
}

• 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