# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
88603 | Badral | Star triangles (IZhO11_triangle) | C++17 | 2 ms | 608 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>
#define maxn 300000
using namespace std;
pair<int,int> a[maxn+5];
int u[maxn+5];
int o[maxn+5];
int main() {
int n;
cin >>n;
for(int i = 1; i <= n; i++) {
cin >>a[i].first >>a[i].second;
u[a[i].first]++;
o[a[i].second]++;
}
int s = 0;
for(int i = 1; i <= n; i++) {
s += (u[a[i].first]-1) * (o[a[i].second]-1);
}
cout<<s;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |