# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1257438 | kaitou | Star triangles (IZhO11_triangle) | C++20 | 539 ms | 9216 KiB |
#include <bits/stdc++.h>
using namespace std;
using L = long long;
int main(){
int N;
cin >> N;
vector <L> X(N+1),Y(N+1);
map<L,L> baris, kolom;
L hasil = 0;
for(int i = 1; i <= N; i++){
cin >> X[i] >> Y[i];
baris[X[i]]++;
kolom[Y[i]]++;
}
for (int i = 1; i <= N; i++){
L hasilX = baris[X[i]] -1;
L hasilY = kolom[Y[i]] - 1;
hasil += hasilX * hasilY;
}
cout << hasil;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |