# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
839213 | Alfraganus | Star triangles (IZhO11_triangle) | C++17 | 1 ms | 212 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define fs first
#define ss second
#define ll long long
int main(){
int n;
cin >> n;
map<int, int> X, Y;
vector<pair<int, int>> a(n);
for(int i = 0; i < n; i ++){
cin >> a[i].fs >> a[i].ss;
X[a[i].fs] ++;
Y[a[i].ss] ++;
}
ll ans = 0;
for(int i = 0; i < n; i ++)
ans += 1ll * X[a[i].fs] * Y[a[i].ss];
cout << ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |