제출 #583012

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
583012		snasibov05	Pairs (IOI07_pairs)	C++14	47 / 100	61 ms	6556 KiB

pairs

#include <bits/stdc++.h>

using namespace std;

#define int long long

signed main() {
    int b, n, d, m; cin >> b >> n >> d >> m;
    vector<vector<int>> coord(n, vector<int>(b));
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < b; ++j) cin >> coord[i][j];
    }

    if (n <= 1000){
        int ans = 0;
        for (int i = 0; i < n; ++i){
            for (int j = i+1; j < n; ++j){
                int dist = 0;
                for (int k = 0; k < b; ++k) dist += abs(coord[i][k] - coord[j][k]);
                if (dist <= d) ans++;
            }
        }

        cout << ans << "\n";
    } else if (b == 1){
        int ans = 0;
        vector<int> c(n);
        for (int i = 0; i < n; ++i) c[i] = coord[i][0];
        sort(c.begin(), c.end());
        int r = 0;
        for (int i = 0; i < n; ++i){
            while (r < n-1 && c[r+1] - c[i] <= d) r++;
            ans += r - i;
        }

        cout << ans << "\n";
    }



    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