# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
901394 | LOLOLO | Star triangles (IZhO11_triangle) | C++14 | 268 ms | 16320 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;
typedef long long ll;
#define sz(x) (int)(x).size()
#define len(x) (int)(x).length()
#define cntbit(x) builtin_popcnt(x)
#define f first
#define s second
#define pb push_back
ll solve() {
int n;
cin >> n;
vector <pair <int, int>> save;
map <int, ll> row, col;
for (int i = 1; i <= n; i++) {
int x, y;
cin >> x >> y;
row[x]++;
col[y]++;
save.pb(make_pair(x, y));
}
ll ans = 0;
for (auto x : save) {
ans += (row[x.f] - 1) * (col[x.s] - 1);
}
return ans;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
//cin >> t;
while (t--) {
cout << solve() << '\n';
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |