# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
20814 | jjwdi0 | Star triangles (IZhO11_triangle) | C++11 | 9 ms | 29300 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 <stdio.h>
#include <set>
#define sz(x) ((int)(x).size())
using namespace std;
set<int> s1[300005], s2[300005];
int N;
long long ans;
int main() {
scanf("%d", &N);
for(int i=0, x, y; i<N; i++) {
scanf("%d %d", &x, &y);
s1[x].insert(y);
s2[y].insert(x);
}
for(int i=1; i<=100000; i++) {
if(sz(s1[i]) >= 2) {
for(auto it : s1[i]) {
ans += (long long)(sz(s1[i]) - 1) * (sz(s2[it]) - 1);
}
}
}
printf("%lld", ans);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |