#include <bits/stdc++.h>
#define REP(v, i, j) for (ll v = i; v < j; v++)
#define FORI(v) for (auto i : v)
#define FORJ(v) for (auto j : v)
#define OUT(v, a) FORI(v) cout << i << a;
#define OUTS(v, a, b) cout << v.size() << a; OUT(v, b)
#define in(a, n) REP(i, 0, n) cin >> a[i];
#define SORT(v) sort(begin(v), end(v))
#define REV(v) reverse(begin(v), end(v))
#define pb push_back
#define fi first
#define se second
#define detachIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
typedef pair<pii, ll> piii;
typedef pair<pii, pii> piiii;
map<ll, ll> x, y;
vector<pii> v;
int main()
{
detachIO;
ll N;
cin >> N;
while (N--)
{
ll a, b;
cin >> a >> b;
x[a]++, y[b]++;
v.pb({a, b});
}
ll ans = 0;
FORI(v)
{
ans += (x[i.fi] - 1) * (y[i.se] - 1);
}
cout << ans << '\n';
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
0 ms |
204 KB |
Output is correct |
4 |
Correct |
0 ms |
204 KB |
Output is correct |
5 |
Correct |
1 ms |
312 KB |
Output is correct |
6 |
Correct |
1 ms |
204 KB |
Output is correct |
7 |
Correct |
1 ms |
332 KB |
Output is correct |
8 |
Correct |
1 ms |
312 KB |
Output is correct |
9 |
Correct |
1 ms |
332 KB |
Output is correct |
10 |
Correct |
1 ms |
332 KB |
Output is correct |
11 |
Correct |
1 ms |
324 KB |
Output is correct |
12 |
Correct |
6 ms |
1228 KB |
Output is correct |
13 |
Correct |
6 ms |
1228 KB |
Output is correct |
14 |
Correct |
10 ms |
1756 KB |
Output is correct |
15 |
Correct |
109 ms |
7848 KB |
Output is correct |
16 |
Correct |
111 ms |
8308 KB |
Output is correct |
17 |
Correct |
132 ms |
7844 KB |
Output is correct |
18 |
Correct |
101 ms |
7856 KB |
Output is correct |
19 |
Correct |
294 ms |
18500 KB |
Output is correct |
20 |
Correct |
206 ms |
11784 KB |
Output is correct |
21 |
Correct |
310 ms |
18432 KB |
Output is correct |
22 |
Correct |
312 ms |
18484 KB |
Output is correct |