Submission #583002

#TimeUsernameProblemLanguageResultExecution timeMemory
583002snasibov05Pairs (IOI07_pairs)C++14
29 / 100
4078 ms6860 KiB
#include <bits/stdc++.h>

using namespace std;

int 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];
    }

    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";

    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...