結果
問題 | No.1341 真ん中を入れ替えて門松列 |
ユーザー |
|
提出日時 | 2021-01-15 23:46:51 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 736 ms / 2,000 ms |
コード長 | 2,393 bytes |
コンパイル時間 | 2,753 ms |
コンパイル使用メモリ | 207,860 KB |
最終ジャッジ日時 | 2025-01-17 20:49:37 |
ジャッジサーバーID (参考情報) |
judge5 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 5 |
other | AC * 14 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define rep(i, n) for(int i = 0; i < n; i++)#define rep2(i, x, n) for(int i = x; i <= n; i++)#define rep3(i, x, n) for(int i = x; i >= n; i--)#define each(e, v) for(auto &e: v)#define pb push_back#define eb emplace_back#define all(x) x.begin(), x.end()#define rall(x) x.rbegin(), x.rend()#define sz(x) (int)x.size()using ll = long long;using pii = pair<int, int>;using pil = pair<int, ll>;using pli = pair<ll, int>;using pll = pair<ll, ll>;const int MOD = 1000000007;//const int MOD = 998244353;const int inf = (1<<30)-1;const ll INF = (1LL<<60)-1;template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};struct io_setup{io_setup(){ios_base::sync_with_stdio(false);cin.tie(NULL);cout << fixed << setprecision(15);}} io_setup;int main(){int N;ll M;cin >> N >> M;vector<ll> A(N), L(N), R(N);rep(i, N){cin >> L[i] >> A[i] >> R[i];if(L[i] > R[i]) swap(L[i], R[i]);}sort(all(A));vector<int> cnt(N, 0);rep(i, N){rep(j, N){if(R[i] >= A[j]) cnt[j]++;}}rep(i, N) cnt[i] -= N-1-i;ll ans = -INF;vector<int> v(N);iota(all(v), 0);sort(all(v), [&](int i, int j){return L[i] > L[j];});ll S = 0;rep(i, N) S += A[i];rep2(i, 0, N){if(i > 0) S -= A[i-1];vector<int> tmp(N, 0);priority_queue<ll> que;int ptr = 0;bool flag = true;ll T = 0;rep3(j, i-1, 0){while(ptr < N && L[v[ptr]] > A[j]){que.emplace(R[v[ptr]]), ptr++;}if(que.empty()){flag = false;break;}ll x = que.top(); que.pop();T += x;int id = upper_bound(all(A), x)-begin(A)-1;tmp[id]++;}if(!flag) continue;rep3(j, N-2, 0) tmp[j] += tmp[j+1];rep2(j, i, N-1){if(cnt[j]-tmp[j] > 0) flag = false;}if(flag) chmax(ans, S+T);}if(ans == -INF) cout << "NO\n";else{cout << "YES\n";if(ans >= M) cout << "KADOMATSU!\n";else cout << "NO\n";}}