oj.uz

Submission #336083

# Submission time Handle Problem Language Result Execution time Memory
336083 2020-12-14T17:17:47 Z nikatamliani Hyper-minimum (IZhO11_hyper) C++14
0 / 100
 1 ms 364 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5+10;
int x[N], y[N];
map<int,int> X, Y;
int main() {
    int n;
    cin >> n;
    for(int i = 1; i <= n; ++i) {
        cin >> x[i] >> y[i];
        ++X[x[i]];
        ++Y[y[i]];
    }
    long long ans = 0;
    for(int i = 1; i <= n; ++i) {
        ans += (long long)(X[x[i]] - 1) * (Y[y[i]] - 1); 
    }
    cout << ans << '\n';
}

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -