# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1111974 | KK_1729 | Star triangles (IZhO11_triangle) | C++17 | 292 ms | 20656 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 int long long
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define pb push_back
#define all(a) a.begin(), a.end()
#define endl "\n"
void printVector(vector<int> a){
for (auto x: a) cout << x << " ";
cout << endl;
}
void solve(){
int n; cin >> n;
map<int, int> abc;
map<int, int> oord;
vector<pair<int, int>> points;
FOR(i,0,n){
int x, y; cin >> x >> y;
points.pb({x, y});
abc[x]++;
oord[y]++;
}
int ans = 0;
for (auto point: points){
ans += (abc[point.first]-1)*(oord[point.second]-1);
}
cout << ans << endl;
}
int32_t main(){
ios::sync_with_stdio(false);cin.tie(nullptr);
int t = 1; // cin >> t;
while (t--) solve();
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |