結果
問題 | No.2355 Unhappy Back Dance |
ユーザー | AngrySadEight |
提出日時 | 2023-04-08 18:26:47 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 4,840 ms / 6,000 ms |
コード長 | 3,732 bytes |
コンパイル時間 | 1,737 ms |
コンパイル使用メモリ | 115,740 KB |
実行使用メモリ | 337,280 KB |
最終ジャッジ日時 | 2024-04-18 19:11:57 |
合計ジャッジ時間 | 56,643 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 2 ms
5,376 KB |
testcase_05 | AC | 2 ms
5,376 KB |
testcase_06 | AC | 183 ms
144,000 KB |
testcase_07 | AC | 182 ms
144,000 KB |
testcase_08 | AC | 220 ms
144,192 KB |
testcase_09 | AC | 1,314 ms
192,344 KB |
testcase_10 | AC | 792 ms
240,640 KB |
testcase_11 | AC | 738 ms
240,768 KB |
testcase_12 | AC | 217 ms
144,000 KB |
testcase_13 | AC | 253 ms
143,580 KB |
testcase_14 | AC | 1,386 ms
240,896 KB |
testcase_15 | AC | 1 ms
5,376 KB |
testcase_16 | AC | 4,840 ms
337,252 KB |
testcase_17 | AC | 4,695 ms
337,152 KB |
testcase_18 | AC | 4,753 ms
337,280 KB |
testcase_19 | AC | 4,760 ms
337,280 KB |
testcase_20 | AC | 4,820 ms
337,152 KB |
testcase_21 | AC | 1,704 ms
142,696 KB |
testcase_22 | AC | 220 ms
29,068 KB |
testcase_23 | AC | 242 ms
30,848 KB |
testcase_24 | AC | 4,167 ms
304,768 KB |
testcase_25 | AC | 2,086 ms
165,632 KB |
testcase_26 | AC | 2,075 ms
166,400 KB |
testcase_27 | AC | 1,752 ms
145,152 KB |
testcase_28 | AC | 21 ms
6,400 KB |
testcase_29 | AC | 56 ms
10,752 KB |
testcase_30 | AC | 3,834 ms
282,240 KB |
testcase_31 | AC | 2,668 ms
206,464 KB |
testcase_32 | AC | 163 ms
23,040 KB |
testcase_33 | AC | 1,398 ms
118,656 KB |
testcase_34 | AC | 8 ms
5,376 KB |
testcase_35 | AC | 25 ms
6,656 KB |
testcase_36 | AC | 1,820 ms
145,312 KB |
testcase_37 | AC | 833 ms
78,848 KB |
testcase_38 | AC | 1,070 ms
96,372 KB |
testcase_39 | AC | 792 ms
76,416 KB |
ソースコード
#include <iostream> #include <vector> #include <set> #include <map> #include <utility> #include <algorithm> using namespace std; typedef long long ll; #define vl vector<ll> #define pll pair<ll,ll> ll my_gcd(ll a, ll b){ ll ret = 0; if (a < b){ swap(a, b); } if (b == 0){ ret = a; } else{ ret = my_gcd(b, a % b); } return ret; } int main(){ ll N; cin >> N; vector<ll> X(N); vector<ll> Y(N); for (ll i = 0; i < N; i++){ cin >> X[i] >> Y[i]; } //map<ll, ll> mp1; //x軸に平行 //map<ll, ll> mp2; //y軸に平行 map<pair<pll, pll>, ll> mp3; //それ以外 vector<vector<pair<pll, pll>>> grad_vec(N, vector<pair<pll, pll>>(N)); for (ll i = 0; i < N; i++){ for (ll j = i + 1; j < N; j++){ if (X[i] == X[j]){ pair<ll,ll> g1 = pair<ll,ll>(X[i], 0); pair<ll,ll> g2 = pair<ll,ll>(-1, -1); mp3[pair<pll, pll>(g1, g2)]++; grad_vec[i][j] = pair<pll,pll>(g1, g2); } else if (Y[i] == Y[j]){ pair<ll,ll> g1 = pair<ll,ll>(0, Y[i]); pair<ll,ll> g2 = pair<ll,ll>(-1, -1); mp3[pair<pll, pll>(g1, g2)]++; grad_vec[i][j] = pair<pll, pll>(g1, g2); } else{ pll p1; pll p2; ll g1 = my_gcd(abs(Y[j] - Y[i]), abs(X[j] - X[i])); p1.first = (Y[j] - Y[i]) / g1; p1.second = (X[j] - X[i]) / g1; if (p1.second < 0){ p1.first *= -1; p1.second *= -1; } ll v1 = X[j] * Y[i] - X[i] * Y[j]; ll v2 = X[j] - X[i]; ll g2 = 1; if (v1 != 0){ g2 = my_gcd(abs(v1), abs(v2)); } else{ g2 = v2; } p2.first = v1 / g2; p2.second = v2 / g2; if (p2.second < 0){ p2.first *= -1; p2.second *= -1; } mp3[pair<pll, pll>(p1, p2)]++; grad_vec[i][j] = pair<pll,pll>(p1, p2); } } } ll now = 1; for (auto itr = mp3.begin(); itr != mp3.end(); itr++){ pair<pll, pll> p = itr->first; itr->second = now; now++; } vector<vector<ll>> grad_vec_num(N, vl(N)); for (ll i = 0; i < N; i++){ for (ll j = i + 1; j < N; j++){ grad_vec_num[i][j] = mp3[grad_vec[i][j]]; } } vector<set<ll>> set_vec(N * N / 2); for (ll i = 0; i < N; i++){ for (ll j = i + 1; j < N; j++){ set_vec[grad_vec_num[i][j]].insert(i); set_vec[grad_vec_num[i][j]].insert(j); } } vector<bool> pos(N, false); for (ll i = 0; i < N * N / 2; i++){ if (set_vec[i].size() <= 2){ continue; } else if (set_vec[i].size() >= 4){ for (auto itr = set_vec[i].begin(); itr != set_vec[i].end(); itr++){ pos[*itr] = true; } } else{ vector<pair<pll, ll>> st_to_vec(0); for (auto itr = set_vec[i].begin(); itr != set_vec[i].end(); itr++){ pll p = pll(X[*itr], Y[*itr]); st_to_vec.push_back(pair<pll, ll>(p, *itr)); } sort(st_to_vec.begin(), st_to_vec.end()); pos[st_to_vec[0].second] = true; pos[st_to_vec[2].second] = true; } } ll ans = 0; for (ll i = 0; i < N; i++){ if (pos[i]) ans++; } cout << ans << endl; }