Submission #19123720

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i =0;i<(int)(n);i++)
#define endl '\n'
typedef pair<int,int> P;
typedef long long ll;
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin >> n;
    vector<int> x(n);
    vector<int> y(n);
    rep(i,n){
        cin >> x[i] >> y[i];
    }
    int ans = 0;
    for(int i =0;i<n;i++){
        for(int j =i+1;j<n;j++){
            if(abs(x[j]-x[i])>=abs(y[j]-y[i])){
                ans++;
            }
        }
    }
    cout << ans << endl;
}

Submission Info

Submission Time
Task B - Gentle Pairs
User octo
Language C++ (GCC 9.2.1)
Score 200
Code Size 583 Byte
Status AC
Exec Time 9 ms
Memory 3656 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 21
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All random_01.txt, random_02.txt, random_03.txt, random_04.txt, random_05.txt, random_06.txt, random_07.txt, random_08.txt, random_09.txt, random_10.txt, random_11.txt, random_12.txt, random_13.txt, random_14.txt, random_15.txt, random_16.txt, random_17.txt, random_18.txt, sample_01.txt, sample_02.txt, sample_03.txt
Case Name Status Exec Time Memory
random_01.txt AC 6 ms 3656 KiB
random_02.txt AC 3 ms 3564 KiB
random_03.txt AC 2 ms 3584 KiB
random_04.txt AC 2 ms 3616 KiB
random_05.txt AC 3 ms 3568 KiB
random_06.txt AC 2 ms 3612 KiB
random_07.txt AC 2 ms 3564 KiB
random_08.txt AC 2 ms 3640 KiB
random_09.txt AC 2 ms 3584 KiB
random_10.txt AC 2 ms 3656 KiB
random_11.txt AC 5 ms 3652 KiB
random_12.txt AC 6 ms 3568 KiB
random_13.txt AC 6 ms 3528 KiB
random_14.txt AC 5 ms 3624 KiB
random_15.txt AC 9 ms 3580 KiB
random_16.txt AC 4 ms 3620 KiB
random_17.txt AC 5 ms 3624 KiB
random_18.txt AC 4 ms 3524 KiB
sample_01.txt AC 2 ms 3616 KiB
sample_02.txt AC 2 ms 3508 KiB
sample_03.txt AC 3 ms 3612 KiB