# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
481520 | 2021-10-21T05:50:46 Z | Kalashnikov | 별들과 삼각형 (IZhO11_triangle) | C++17 | 876 ms | 30952 KB |
#include <bits/stdc++.h> #define ios ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0) #define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout) #define all(a) a.begin() , a.end() #define F first #define S second using namespace std; using ll = long long; const int N = 3e5+5 , inf = 2e9 + 7; const ll INF = 1e18 , mod = 1e9+7 , P = 6547; int x[N] , y[N]; void solve(int tc) { int n; cin >> n; map<int,int> cntx , cnty; map<pair<int,int>,int> cnt; for(int i= 1; i <= n; i ++) { cin >> x[i] >> y[i]; cntx[x[i]] ++; cnty[y[i]] ++; cnt[{x[i] , y[i]}] ++; } ll ans = 0; for(int i = 1; i <= n; i ++) { int X = cntx[x[i]] - cnt[{x[i] , y[i]}]; int Y = cnty[y[i]] - cnt[{x[i] , y[i]}]; ans += 1ll*X*Y*cnt[{x[i] , y[i]}]; } cout << ans; } /* */ main() { file("triangles"); ios; int tt = 1 , tc = 0; // cin >> tt; while(tt --) { solve(++tc); } return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 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 | 332 KB | Output is correct |
5 | Correct | 0 ms | 332 KB | Output is correct |
6 | Correct | 0 ms | 332 KB | Output is correct |
7 | Correct | 0 ms | 332 KB | Output is correct |
8 | Correct | 1 ms | 332 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 | 332 KB | Output is correct |
12 | Correct | 11 ms | 1484 KB | Output is correct |
13 | Correct | 10 ms | 1484 KB | Output is correct |
14 | Correct | 15 ms | 1844 KB | Output is correct |
15 | Correct | 226 ms | 10312 KB | Output is correct |
16 | Correct | 234 ms | 10876 KB | Output is correct |
17 | Correct | 216 ms | 10180 KB | Output is correct |
18 | Correct | 224 ms | 10376 KB | Output is correct |
19 | Correct | 746 ms | 24448 KB | Output is correct |
20 | Correct | 514 ms | 21868 KB | Output is correct |
21 | Correct | 876 ms | 30908 KB | Output is correct |
22 | Correct | 844 ms | 30952 KB | Output is correct |