# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
330924 | 2020-11-26T21:59:21 Z | ZwariowanyMarcin | 별들과 삼각형 (IZhO11_triangle) | C++14 | 397 ms | 10092 KB |
#include <bits/stdc++.h> #define pb push_back #define fi first #define se second #define sz(x) (int)x.size() using ll = long long; using namespace std; const int N = 1 << 20; int n, x[N], y[N]; ll res; map<int, int> dx, dy; int main() { scanf("%d", &n); for (int i = 0; i < n; ++i) { scanf("%d%d", x + i, y + i); dx[x[i]]++; dy[y[i]]++; } for (int i = 0; i < n; ++i) res += 1LL * (dx[x[i]] - 1) * (dy[y[i]] - 1); printf("%lld\n", res); return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Correct | 1 ms | 364 KB | Output is correct |
3 | Correct | 1 ms | 364 KB | Output is correct |
4 | Correct | 1 ms | 364 KB | Output is correct |
5 | Correct | 1 ms | 364 KB | Output is correct |
6 | Correct | 1 ms | 364 KB | Output is correct |
7 | Correct | 1 ms | 364 KB | Output is correct |
8 | Correct | 1 ms | 364 KB | Output is correct |
9 | Correct | 1 ms | 364 KB | Output is correct |
10 | Correct | 1 ms | 364 KB | Output is correct |
11 | Correct | 1 ms | 364 KB | Output is correct |
12 | Correct | 8 ms | 1004 KB | Output is correct |
13 | Correct | 10 ms | 1132 KB | Output is correct |
14 | Correct | 11 ms | 1388 KB | Output is correct |
15 | Correct | 141 ms | 6252 KB | Output is correct |
16 | Correct | 162 ms | 6508 KB | Output is correct |
17 | Correct | 136 ms | 6252 KB | Output is correct |
18 | Correct | 132 ms | 6252 KB | Output is correct |
19 | Correct | 389 ms | 9836 KB | Output is correct |
20 | Correct | 262 ms | 9324 KB | Output is correct |
21 | Correct | 397 ms | 10092 KB | Output is correct |
22 | Correct | 395 ms | 9964 KB | Output is correct |