結果
問題 | No.2173 Nightcord |
ユーザー | Kude |
提出日時 | 2022-12-25 09:30:20 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
MLE
|
実行時間 | - |
コード長 | 6,846 bytes |
コンパイル時間 | 3,262 ms |
コンパイル使用メモリ | 252,336 KB |
実行使用メモリ | 793,332 KB |
最終ジャッジ日時 | 2024-11-18 20:15:29 |
合計ジャッジ時間 | 85,371 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 3 ms
10,496 KB |
testcase_01 | MLE | - |
testcase_02 | AC | 2 ms
13,764 KB |
testcase_03 | MLE | - |
testcase_04 | AC | 3 ms
10,496 KB |
testcase_05 | MLE | - |
testcase_06 | AC | 2 ms
10,496 KB |
testcase_07 | MLE | - |
testcase_08 | AC | 3 ms
10,496 KB |
testcase_09 | AC | 1,969 ms
265,544 KB |
testcase_10 | AC | 1,001 ms
134,452 KB |
testcase_11 | AC | 77 ms
11,520 KB |
testcase_12 | AC | 1,782 ms
265,660 KB |
testcase_13 | AC | 138 ms
19,720 KB |
testcase_14 | TLE | - |
testcase_15 | TLE | - |
testcase_16 | TLE | - |
testcase_17 | AC | 295 ms
36,044 KB |
testcase_18 | AC | 1,142 ms
134,444 KB |
testcase_19 | AC | 14 ms
5,488 KB |
testcase_20 | AC | 1,120 ms
134,448 KB |
testcase_21 | AC | 1,578 ms
134,596 KB |
testcase_22 | AC | 1,849 ms
265,564 KB |
testcase_23 | AC | 1,635 ms
134,464 KB |
testcase_24 | TLE | - |
testcase_25 | AC | 2,266 ms
265,684 KB |
testcase_26 | TLE | - |
testcase_27 | AC | 21 ms
5,496 KB |
testcase_28 | TLE | - |
testcase_29 | AC | 371 ms
36,120 KB |
testcase_30 | TLE | - |
testcase_31 | AC | 606 ms
68,988 KB |
testcase_32 | AC | 2,031 ms
265,552 KB |
testcase_33 | TLE | - |
testcase_34 | TLE | - |
testcase_35 | AC | 1,492 ms
134,352 KB |
testcase_36 | AC | 1,849 ms
265,572 KB |
testcase_37 | TLE | - |
testcase_38 | TLE | - |
testcase_39 | TLE | - |
testcase_40 | TLE | - |
testcase_41 | AC | 1,968 ms
265,652 KB |
testcase_42 | TLE | - |
testcase_43 | AC | 166 ms
19,720 KB |
testcase_44 | AC | 9 ms
5,248 KB |
testcase_45 | AC | 559 ms
68,904 KB |
testcase_46 | TLE | - |
testcase_47 | AC | 843 ms
134,444 KB |
testcase_48 | AC | 941 ms
134,452 KB |
testcase_49 | AC | 19 ms
5,488 KB |
testcase_50 | AC | 314 ms
36,112 KB |
testcase_51 | AC | 925 ms
134,452 KB |
testcase_52 | AC | 11 ms
5,248 KB |
testcase_53 | AC | 990 ms
134,456 KB |
testcase_54 | AC | 1,402 ms
134,452 KB |
testcase_55 | AC | 284 ms
36,216 KB |
testcase_56 | MLE | - |
ソースコード
#include<bits/stdc++.h> namespace { #pragma GCC diagnostic ignored "-Wunused-function" #include<atcoder/all> #pragma GCC diagnostic warning "-Wunused-function" using namespace std; using namespace atcoder; #define rep(i,n) for(int i = 0; i < (int)(n); i++) #define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--) #define all(x) begin(x), end(x) #define rall(x) rbegin(x), rend(x) template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; } template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; } using ll = long long; using P = pair<int,int>; using VI = vector<int>; using VVI = vector<VI>; using VL = vector<ll>; using VVL = vector<VL>; struct Vec { using etype = long long; // type of elements using ptype = long long; // type of product results etype x = 0, y = 0; constexpr Vec operator-() const { return {-x, -y}; } friend constexpr Vec operator+(const Vec& a, const Vec& b) { return {a.x + b.x, a.y + b.y}; } friend constexpr Vec operator-(const Vec& a, const Vec& b) { return {a.x - b.x, a.y - b.y}; } friend constexpr etype operator*(const Vec& a, const Vec& b) { return a.x * b.y - a.y * b.x; } template <class T, enable_if_t<is_integral_v<T>>* = nullptr> friend constexpr Vec operator*(T c, const Vec& a) { return {c * a.x, c * a.y}; } template <class T, enable_if_t<is_integral_v<T>>* = nullptr> friend constexpr Vec operator*(const Vec& a, T c) { return c * a; } template <class T, enable_if_t<is_integral_v<T>>* = nullptr> friend constexpr Vec operator/(const Vec& a, T c) { return {a.x / c, a.y / c}; } Vec& operator+=(const Vec& a) { x += a.x; y += a.y; return *this; } Vec& operator-=(const Vec& a) { x -= a.x; y -= a.y; return *this; } template <class T, enable_if_t<is_integral_v<T>>* = nullptr> Vec& operator*=(T c) { x *= c; y *= c; return *this; } friend constexpr bool operator==(const Vec& a, const Vec& b) { return a.x == b.x && a.y == b.y; } friend constexpr bool operator!=(const Vec& a, const Vec& b) { return !(a == b); } constexpr int quadrant() const { return y > 0 ? (x > 0 ? 0 : 1) : y < 0 ? (x < 0 ? 2 : 3) : (x > 0 ? 0 : x < 0 ? 2 : -1); } friend constexpr bool operator<(const Vec& a, const Vec& b) { int qa = a.quadrant(), qb = b.quadrant(); if (qa != qb) return qa < qb; ptype p1 = (ptype)a.x * b.y, p2 = (ptype)a.y * b.x; return p1 > p2 || (p1 == p2 && (a.x != 0 ? abs(a.x) < abs(b.x) : abs(a.y) < abs(b.y))); } friend constexpr bool operator>(const Vec& a, const Vec& b) { return b < a; } friend constexpr bool operator<=(const Vec& a, const Vec& b) { return !(b < a); } friend constexpr bool operator>=(const Vec& a, const Vec& b) { return !(a < b); } constexpr int ccw(const Vec& u, const Vec& v) const { ptype p = (u - *this) * (v - *this); return p > 0 ? 1 : p < 0 ? -1 : 0; } static constexpr bool intersects(const Vec& a, const Vec& b, const Vec& c, const Vec& d) { return a.ccw(b, c) * a.ccw(b, d) <= 0 && c.ccw(d, a) * c.ccw(d, b) <= 0; } constexpr bool parallel_to(const Vec& a) const { return (ptype)x * a.y == (ptype)y * a.x; } constexpr ptype dot(const Vec& a) const { return (ptype)x * a.x + (ptype)y * a.y; } constexpr ptype norm2() const { return (ptype)x * x + (ptype)y * y; } constexpr bool is_zero() const { return x == 0 && y == 0; } constexpr Vec normalize() const { if (y == 0) return Vec{x == 0 ? 0 : 1, 0}; etype g = gcd(x, y); return *this / (y > 0 ? g : -g); } constexpr Vec rot90() const { return {-y, x}; } // exclusive constexpr bool in_between(const Vec& a, const Vec& b) const { Vec x = a - *this, y = b - *this; return x.parallel_to(y) && x.dot(y) < 0; } friend std::ostream& operator<< (std::ostream& os, const Vec& t) { return os << t.x << ' ' << t.y; } friend std::istream& operator>> (std::istream& os, Vec& t) { return os >> t.x >> t.y; } }; vector<int> convex_hull(const vector<Vec>& ps) { const int n = ps.size(); if (n <= 1) { if (n == 0) return {}; else return {0}; } vector<int> ord(n); iota(ord.begin(), ord.end(), 0); sort(ord.begin(), ord.end(), [&](int i, int j) { return ps[i].y < ps[j].y || (ps[i].y == ps[j].y && ps[i].x < ps[j].x); }); vector<int> st1, st2; for(int i: ord) { int sz = st1.size(); while(sz >= 2 && (ps[st1[sz - 1]] - ps[st1[sz - 2]]) * (ps[i] - ps[st1[sz - 1]]) <= 0) { st1.pop_back(); sz--; } st1.push_back(i); } for(int i: ord) { int sz = st2.size(); while(sz >= 2 && (ps[st2[sz - 1]] - ps[st2[sz - 2]]) * (ps[i] - ps[st2[sz - 1]]) >= 0) { st2.pop_back(); sz--; } st2.push_back(i); } assert(st1.front() == st2.front() && st1.back() == st2.back()); st1.insert(st1.end(), st2.rbegin() + 1, st2.rend() - 1); return st1; } } int main() { ios::sync_with_stdio(false); cin.tie(0); int n, k; cin >> n >> k; vector<Vec> p1, p2, p(n); VI c(n); rep(i, n) { cin >> p[i] >> c[i]; (c[i] == 1 ? p1 : p2).emplace_back(p[i]); } if (p1.empty() || p2.empty()) { cout << "No\n"; return 0; } bool ok = false; { vector<pair<pair<Vec, ll>, int>> d; rep(i, n) rep(j, i) { Vec v = (p[i] - p[j]).normalize(); ll h = v.rot90().dot(p[i]); d.emplace_back(pair(v, h), i); d.emplace_back(pair(v, h), j); } sort(all(d)); int sz = d.size(); VI idx; for(int l = 0; l < sz;) { int r = l + 1; while(r < sz && d[r].first == d[l].first) r++; idx.clear(); for(int i = l; i < r; i++) idx.emplace_back(d[i].second); Vec v = d[l].first.first; sort(all(idx), [&](int i, int j) { return v * p[i] < v * p[j]; }); int cnt = 0; int last = -1; for(int i: idx) if (c[i] != last) { cnt++; last = c[i]; } if (cnt >= 3) { ok = true; break; } l = r; } } if (!ok && k >= 4) { VI ch1 = convex_hull(p1), ch2 = convex_hull(p2); rep(_, 2) { if (int sz = ch1.size(); sz >= 2) { ch1.emplace_back(ch1[0]); for(Vec v: p2) { int cnt = 0; rep(i, sz) cnt += Vec::intersects(v, Vec{v.x + 1, 1001001001}, p1[ch1[i]], p1[ch1[i + 1]]); if (cnt % 2 == 1) { ok = true; break; } } } if (ok) break; swap(p1, p2); swap(ch1, ch2); } if (!ok) { int sz1 = ch1.size(), sz2 = ch2.size(); if (sz1 >= 2 && sz2 >= 2) { sz1--, sz2--; rep(i, sz1) { rep(j, sz2) { if (Vec::intersects(p1[ch1[i]], p1[ch1[i + 1]], p2[ch2[j]], p2[ch2[j + 1]])) { ok = true; break; } } if (ok) break; } } } } cout << (ok ? "Yes\n" : "No\n"); }