結果
問題 | No.1341 真ん中を入れ替えて門松列 |
ユーザー | haruki_K |
提出日時 | 2021-01-17 11:27:29 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 744 ms / 2,000 ms |
コード長 | 7,116 bytes |
コンパイル時間 | 2,828 ms |
コンパイル使用メモリ | 219,344 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-05-06 23:55:57 |
合計ジャッジ時間 | 10,496 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | AC | 2 ms
5,248 KB |
testcase_04 | AC | 2 ms
5,376 KB |
testcase_05 | AC | 2 ms
5,376 KB |
testcase_06 | AC | 4 ms
5,376 KB |
testcase_07 | AC | 512 ms
5,376 KB |
testcase_08 | AC | 322 ms
5,376 KB |
testcase_09 | AC | 342 ms
5,376 KB |
testcase_10 | AC | 665 ms
5,376 KB |
testcase_11 | AC | 666 ms
5,376 KB |
testcase_12 | AC | 620 ms
5,376 KB |
testcase_13 | AC | 662 ms
5,376 KB |
testcase_14 | AC | 744 ms
5,376 KB |
testcase_15 | AC | 696 ms
5,376 KB |
testcase_16 | AC | 663 ms
5,376 KB |
testcase_17 | AC | 674 ms
5,376 KB |
testcase_18 | AC | 342 ms
5,376 KB |
ソースコード
// >>> TEMPLATES #include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; using i32 = int32_t; using i64 = int64_t; using u32 = uint32_t; using u64 = uint64_t; #define int ll #define rep(i,n) for (int i = 0; i < (int)(n); i++) #define rep1(i,n) for (int i = 1; i <= (int)(n); i++) #define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--) #define rep1R(i,n) for (int i = (int)(n); i >= 1; i--) #define loop(i,a,B) for (int i = a; i B; i++) #define loopR(i,a,B) for (int i = a; i B; i--) #define all(x) begin(x), end(x) #define allR(x) rbegin(x), rend(x) #define rng(x,l,r) begin(x) + (l), begin(x) + (r) #define pb push_back #define eb emplace_back #define fst first #define snd second template <class A, class B> auto mp(A &&a, B &&b) { return make_pair(forward<A>(a), forward<B>(b)); } template <class... T> auto mt(T&&... x) { return make_tuple(forward<T>(x)...); } template <class Int> auto constexpr inf = numeric_limits<Int>::max()/2-1; auto constexpr INF32 = inf<int32_t>; auto constexpr INF64 = inf<int64_t>; auto constexpr INF = inf<int>; #ifdef LOCAL #include "debug.hpp" #else #define dump(...) (void)(0) #define say(x) (void)(0) #define debug if (0) #endif template <class T, class Comp> struct pque : priority_queue<T, vector<T>, Comp> { vector<T> &data() { return this->c; } void clear() { this->c.clear(); } }; template <class T> using pque_max = pque<T, less<T>>; template <class T> using pque_min = pque<T, greater<T>>; template <class T, class = typename T::iterator, enable_if_t<!is_same<T, string>::value, int> = 0> ostream& operator<<(ostream& os, T const& a) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; } template <class T, size_t N, enable_if_t<!is_same<T, char>::value, int> = 0> ostream& operator<<(ostream& os, const T (&a)[N]) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; } template <class T, class = decltype(begin(declval<T&>())), class = typename enable_if<!is_same<T, string>::value>::type> istream& operator>>(istream& is, T &a) { for (auto& x : a) is >> x; return is; } template <class T, class S> ostream& operator<<(ostream& os, pair<T, S> const& p) { return os << p.first << " " << p.second; } template <class T, class S> istream& operator>>(istream& is, pair<T, S>& p) { return is >> p.first >> p.second; } struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup; template <class F> struct FixPoint : private F { constexpr FixPoint(F&& f) : F(forward<F>(f)) {} template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); } }; struct MakeFixPoint { template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); } }; #define MFP MakeFixPoint()| #define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__) template <class T, size_t d> struct vec_impl { using type = vector<typename vec_impl<T,d-1>::type>; template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); } }; template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } }; template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type; template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); } template <class T> void quit(T const& x) { cout << x << endl; exit(0); } template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > y) { x = y; return true; } return false; } template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < y) { x = y; return true; } return false; } template <class It> constexpr auto sumof(It b, It e) { return accumulate(b, e, typename iterator_traits<It>::value_type{}); } template <class T> int sz(T const& x) { return x.size(); } template <class C, class T> int lbd(C const& v, T const& x) { return lower_bound(begin(v), end(v), x)-begin(v); } template <class C, class T> int ubd(C const& v, T const& x) { return upper_bound(begin(v), end(v), x)-begin(v); } const int dx[] = { 1,0,-1,0,1,-1,-1,1 }; const int dy[] = { 0,1,0,-1,1,1,-1,-1 }; constexpr int popcnt(ll x) { return __builtin_popcountll(x); } // [a,b] template <class Int> Int rand(Int a, Int b) { static mt19937_64 mt{random_device{}()}; return uniform_int_distribution<Int>(a,b)(mt); } i64 irand(i64 a, i64 b) { return rand<i64>(a,b); } u64 urand(u64 a, u64 b) { return rand<u64>(a,b); } template <class It> void shuffle(It l, It r) { shuffle(l, r, mt19937_64(random_device{}())); } // <<< // >>> reord void reord_impl(vector<int> const&) { } template <class C, class... Args> void reord_impl(vector<int> const& idx, C& v, Args&&... args) { auto t = v; rep (i,v.size()) t[i] = v[idx[i]]; swap(v,t); reord_impl(idx, forward<Args>(args)...); } template <class Comp, class C, class... Args, class = decltype(declval<Comp>()(0,0))> void reord(Comp comp, C& v, Args&&... args) { vector<int> idx(v.size()); iota(idx.begin(), idx.end(), 0); sort(idx.begin(), idx.end(), comp); reord_impl(idx, v, args...); } template <class C, class... Args> void reord(C& v, Args&&... args) { vector<int> idx(v.size()); iota(idx.begin(), idx.end(), 0); sort(idx.begin(), idx.end(), [&](int i, int j) { return v[i] < v[j]; }); reord_impl(idx, v, args...); } template <class C, class... Args> void reordR(C& v, Args&&... args) { vector<int> idx(v.size()); iota(idx.begin(), idx.end(), 0); sort(idx.begin(), idx.end(), [&](int i, int j) { return v[i] > v[j]; }); reord_impl(idx, v, args...); } // <<< int32_t main() { int n, m; cin >> n >> m; vector<int> a(n), b(n), c(n); rep (i, n) { cin >> a[i] >> b[i] >> c[i]; if (a[i] > c[i]) swap(a[i], c[i]); } sort(all(b)); reord(c, a); auto f = [&](int k) -> int { multiset<int> s; rep (i, k) s.insert(b[i]); vector<int> B; loop (i, k, <n) B.eb(b[i]); int sum = 0; repR (i, n) { auto it = s.lower_bound(a[i]); if (it == s.begin()) { if (B.size() and c[i] < B.back()) { sum += B.back(); B.pop_back(); } else { return -1; } } else { sum += c[i]; s.erase(--it); } } return sum; }; // int l = -1, r = n+1; // while (l+2 < r) { // auto m1 = (l*2+r)/3; // auto m2 = (l+r*2)/3; // if (f(m1) <= f(m2)) { // l = m1; // } else { // r = m2; // } // } // int res = f((l+r)/2); // dump((l+r)/2, n, res); int res = -1; rep (k, n+1) chmax(res, f(k)); if (res == -1) { cout << "NO" << "\n"; } else { cout << "YES" << "\n"; cout << (res >= m ? "KADOMATSU!" : "NO") << "\n"; } }