# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
976393 | vjudge1 | Star triangles (IZhO11_triangle) | C++17 | 273 ms | 9232 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 bismillah ios_base::sync_with_stdio(0); cin.tie(0);
#define int long long
#define v vector
#define pb push_back
#define ppb pop_back
#define all(x) x.begin(), x.end()
#define rall(x) x.begin(), x.end()
#define pii pair<int, int>
#define pll pair<long long, long long>
#define fi first
#define se second
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define endl '\n'
#define tc int t = 1; while (t--)
// #define tc int t; cin >> t; while (t--)
const int MOD = 1e9 + 7;
const int INF = 1e17;
using namespace std;
signed main(){
bismillah;
tc {
//input
int n; cin >> n;
map<int, int> mpx, mpy;
int coordX[n + 1], coordY[n + 1];
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
mpx[x]++; mpy[y]++;
coordX[i] = x;
coordY[i] = y;
}
//solve
int ans = 0;
for (int i = 0; i < n; i++) {
ans += (mpx[coordX[i]] - 1) * (mpy[coordY[i]] - 1);
}
//output
cout << ans << endl;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |