Submission #336083

#TimeUsernameProblemLanguageResultExecution timeMemory
336083nikatamlianiHyper-minimum (IZhO11_hyper)C++14
0 / 100
1 ms364 KiB
#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'; }
#Verdict Execution timeMemoryGrader output
Fetching results...