Submission #872254

#	Time	Username	Problem	Language	Result	Execution time	Memory
872254		Matjaz	Pairs (IOI07_pairs)	C++14	47 / 100	4059 ms	7176 KiB

pairs

//
//  IOI2007Pairs.cpp
//  
//
//  Created by Matjaz Leonardis on 12/11/2023.
//

#include <iostream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;

int B,N,D,M;

int main(){
    
    cin >> B >> N >> D >> M;
    
    vector<vector<int> > c(N, vector<int> (B));
    
    for (int i=0;i<N;i++){
        for (int j=0;j<B;j++) cin >> c[i][j];
    }
    
    if (B == 1){
        
        long long pairs = 0;
        vector<int> x(N);
        for (int i=0;i<N;i++) x[i] = c[i][0];
        sort(x.begin(), x.end());
        for (int i=0;i<N;i++){
            vector<int>::iterator start = lower_bound(x.begin(), x.end(), x[i] - D);
            vector<int>::iterator end = upper_bound(x.begin(), x.end(), x[i] + D);
            pairs += (end - start) - 1;
        }
        
        cout << pairs / 2 << endl;
        
        
    } else {
        
        long long pairs=0;
        
        for (int i=0;i<N;i++){
            for (int j=i+1;j<N;j++){
                
                long long distance = 0;
                
                for (int k=0;k<B;k++) distance += abs(c[i][k] - c[j][k]);
                
                if (distance <= D) pairs++;
            }
        }
        
        cout << pairs << endl;
    }
    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