結果
問題 | No.1341 真ん中を入れ替えて門松列 |
ユーザー |
|
提出日時 | 2021-01-15 22:46:56 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 16,773 bytes |
コンパイル時間 | 18,465 ms |
コンパイル使用メモリ | 315,948 KB |
最終ジャッジ日時 | 2025-01-17 20:10:43 |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 5 |
other | AC * 12 TLE * 2 |
ソースコード
#pragma region Macros#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#include <bits/stdc++.h>#define ll long long#define ld long double#define rep2(i, a, b) for(ll i = a; i <= b; ++i)#define rep(i, n) for(ll i = 0; i < n; ++i)#define rep3(i, a, b) for(ll i = a; i >= b; --i)#define pii pair<int, int>#define pll pair<ll, ll>#define pb push_back#define eb emplace_back#define vi vector<int>#define vll vector<ll>#define vpi vector<pii>#define vpll vector<pll>#define overload2(_1, _2, name, ...) name#define vec(type, name, ...) vector<type> name(__VA_ARGS__)#define VEC(type, name, size)\vector<type> name(size);\IN(name)#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))#define VV(type, name, h, w)\vector<vector<type>> name(h, vector<type>(w));\IN(name)#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))#define vvvv(type, name, a, b, c, ...)\vector<vector<vector<vector<type>>>> name(a, vector<vector<vector<type>>>(b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))#define mt make_tuple#define fi first#define se second#define all(c) begin(c), end(c)#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))using namespace std;constexpr pii dx4[4] = {pii{1, 0}, pii{0, 1}, pii{-1, 0}, pii{0, -1}};constexpr pii dx8[8] = {{1, 0}, {1, 1}, {0, 1}, {-1, 1}, {-1, 0}, {-1, -1}, {0, -1}, {1, -1}};const string YESNO[2] = {"NO", "YES"};const string YesNo[2] = {"No", "Yes"};const string yesno[2] = {"no", "yes"};void YES(bool t = 1) { cout << YESNO[t] << endl; }void Yes(bool t = 1) { cout << YesNo[t] << endl; }void yes(bool t = 1) { cout << yesno[t] << endl; }template <class T> using vc = vector<T>;template <class T> using vvc = vector<vc<T>>;template <class T> using vvvc = vector<vvc<T>>;template <class T> using vvvvc = vector<vvvc<T>>;template <class T> using pq = priority_queue<T>;template <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;#define si(c) (int)(c).size()#define INT(...)\int __VA_ARGS__;\IN(__VA_ARGS__)#define LL(...)\ll __VA_ARGS__;\IN(__VA_ARGS__)#define STR(...)\string __VA_ARGS__;\IN(__VA_ARGS__)#define CHR(...)\char __VA_ARGS__;\IN(__VA_ARGS__)#define DBL(...)\double __VA_ARGS__;\IN(__VA_ARGS__)int scan() { return getchar(); }void scan(int &a) { cin >> a; }void scan(long long &a) { cin >> a; }void scan(char &a) { cin >> a; }void scan(double &a) { cin >> a; }void scan(string &a) { cin >> a; }template <class T, class S> void scan(pair<T, S> &p) { scan(p.first), scan(p.second); }template <class T> void scan(vector<T> &);template <class T> void scan(vector<T> &a) {for(auto &i : a) scan(i);}template <class T> void scan(T &a) { cin >> a; }void IN() {}template <class Head, class... Tail> void IN(Head &head, Tail &... tail) {scan(head);IN(tail...);}template <class T, class S> inline bool chmax(T &a, const S &b) { return (a < b ? a = b, 1 : 0); }template <class T, class S> inline bool chmin(T &a, const S &b) { return (a > b ? a = b, 1 : 0); }vi iota(int n) {vi a(n);iota(all(a), 0);return a;}template <typename T> vi iota(vector<T> &a, bool greater = false) {vi res(a.size());iota(all(res), 0);sort(all(res), [&](int i, int j) {if(greater) return a[i] > a[j];return a[i] < a[j];});return res;}#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())template <class T> T POW(T x, int n) {T res = 1;for(; n; n >>= 1, x *= x)if(n & 1) res *= x;return res;}vector<pll> factor(ll x) {vector<pll> ans;for(ll i = 2; i * i <= x; i++)if(x % i == 0) {ans.push_back({i, 1});while((x /= i) % i == 0) ans.back().second++;}if(x != 1) ans.push_back({x, 1});return ans;}template <class T> vector<T> divisor(T x) {vector<T> ans;for(T i = 1; i * i <= x; i++)if(x % i == 0) {ans.pb(i);if(i * i != x) ans.pb(x / i);}return ans;}template <typename T> void zip(vector<T> &x) {vector<T> y = x;sort(all(y));for(int i = 0; i < x.size(); ++i) { x[i] = lb(y, x[i]); }}int topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }int topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }int lowbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }int lowbit(ll a) { return a == 0 ? 64 : __builtin_ctzll(a); }// int allbit(int n) { return (1 << n) - 1; }ll allbit(ll n) { return (1LL << n) - 1; }int popcount(signed t) { return __builtin_popcount(t); }int popcount(ll t) { return __builtin_popcountll(t); }bool ispow2(int i) { return i && (i & -i) == i; }int in() {int x;cin >> x;return x;}ll lin() {unsigned long long x;cin >> x;return x;}template <class T> pair<T, T> operator-(const pair<T, T> &x, const pair<T, T> &y) { return pair<T, T>(x.fi - y.fi, x.se - y.se); }template <class T> pair<T, T> operator+(const pair<T, T> &x, const pair<T, T> &y) { return pair<T, T>(x.fi + y.fi, x.se + y.se); }template <class T> ll operator*(const pair<T, T> &x, const pair<T, T> &y) { return (ll)x.fi * y.fi + (ll)x.se * y.se; }template <typename T> struct edge {int from, to;T cost;int id;edge(int to, T cost) : from(-1), to(to), cost(cost) {}edge(int from, int to, T cost) : from(from), to(to), cost(cost) {}edge(int from, int to, T cost, int id) : from(from), to(to), cost(cost), id(id) {}edge &operator=(const int &x) {to = x;return *this;}operator int() const { return to; }};template <typename T> using Edges = vector<edge<T>>;using Tree = vector<vector<int>>;using Graph = vector<vector<int>>;template <class T> using Wgraph = vector<vector<edge<T>>>;Graph getG(int n, int m = -1, bool directed = false, int margin = 1) {Tree res(n);if(m == -1) m = n - 1;while(m--) {int a, b;cin >> a >> b;a -= margin, b -= margin;res[a].emplace_back(b);if(!directed) res[b].emplace_back(a);}return move(res);}template <class T> Wgraph<T> getWg(int n, int m = -1, bool directed = false, int margin = 1) {Wgraph<T> res(n);if(m == -1) m = n - 1;while(m--) {int a, b;T c;cin >> a >> b >> c;a -= margin, b -= margin;res[a].emplace_back(b, c);if(!directed) res[b].emplace_back(a, c);}return move(res);}#define i128 __int128_t#define ull unsigned long long int#define TEST\INT(testcases);\while(testcases--)template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {for(auto it = begin(v); it != end(v); ++it) {if(it == begin(v))os << *it;elseos << " " << *it;}return os;}template <class T, class S> ostream &operator<<(ostream &os, const pair<T, S> &p) {os << p.first << " " << p.second;return os;}template <class S, class T> string to_string(pair<S, T> p) { return "(" + to_string(p.first) + "," + to_string(p.second) + ")"; }template <class A> string to_string(A v) {if(v.empty()) return "{}";string ret = "{";for(auto &x : v) ret += to_string(x) + ",";ret.back() = '}';return ret;}string to_string(string s) { return "\"" + s + "\""; }void dump() { cerr << endl; }template <class Head, class... Tail> void dump(Head head, Tail... tail) {cerr << to_string(head) << " ";dump(tail...);}#define endl '\n'#ifdef _LOCAL#undef endl#define debug(x)\cout << #x << ": ";\dump(x)#else#define debug(x)#endiftemplate <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;struct Setup_io {Setup_io() {ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);cout << fixed << setprecision(15);}} setup_io;#define drop(s) cout << #s << endl, exit(0)#pragma endregion#include <algorithm>#include <cassert>#include <limits>#include <queue>#include <vector>namespace atcoder {template <class Cap, class Cost> struct mcf_graph {public:mcf_graph() {}mcf_graph(int n) : _n(n), g(n) {}int add_edge(int from, int to, Cap cap, Cost cost) {assert(0 <= from && from < _n);assert(0 <= to && to < _n);int m = int(pos.size());pos.push_back({from, int(g[from].size())});g[from].push_back(_edge{to, int(g[to].size()), cap, cost});g[to].push_back(_edge{from, int(g[from].size()) - 1, 0, -cost});return m;}struct edge {int from, to;Cap cap, flow;Cost cost;};edge get_edge(int i) {int m = int(pos.size());assert(0 <= i && i < m);auto _e = g[pos[i].first][pos[i].second];auto _re = g[_e.to][_e.rev];return edge{pos[i].first, _e.to, _e.cap + _re.cap, _re.cap, _e.cost,};}std::vector<edge> edges() {int m = int(pos.size());std::vector<edge> result(m);for(int i = 0; i < m; i++) { result[i] = get_edge(i); }return result;}std::pair<Cap, Cost> flow(int s, int t) { return flow(s, t, std::numeric_limits<Cap>::max()); }std::pair<Cap, Cost> flow(int s, int t, Cap flow_limit) { return slope(s, t, flow_limit).back(); }std::vector<std::pair<Cap, Cost>> slope(int s, int t) { return slope(s, t, std::numeric_limits<Cap>::max()); }std::vector<std::pair<Cap, Cost>> slope(int s, int t, Cap flow_limit) {assert(0 <= s && s < _n);assert(0 <= t && t < _n);assert(s != t);// variants (C = maxcost):// -(n-1)C <= dual[s] <= dual[i] <= dual[t] = 0// reduced cost (= e.cost + dual[e.from] - dual[e.to]) >= 0 for all edgestd::vector<Cost> dual(_n, 0), dist(_n);std::vector<int> pv(_n), pe(_n);std::vector<bool> vis(_n);auto dual_ref = [&]() {std::fill(dist.begin(), dist.end(), std::numeric_limits<Cost>::max());std::fill(pv.begin(), pv.end(), -1);std::fill(pe.begin(), pe.end(), -1);std::fill(vis.begin(), vis.end(), false);struct Q {Cost key;int to;bool operator<(Q r) const { return key > r.key; }};std::priority_queue<Q> que;dist[s] = 0;que.push(Q{0, s});while(!que.empty()) {int v = que.top().to;que.pop();if(vis[v]) continue;vis[v] = true;if(v == t) break;// dist[v] = shortest(s, v) + dual[s] - dual[v]// dist[v] >= 0 (all reduced cost are positive)// dist[v] <= (n-1)Cfor(int i = 0; i < int(g[v].size()); i++) {auto e = g[v][i];if(vis[e.to] || !e.cap) continue;// |-dual[e.to] + dual[v]| <= (n-1)C// cost <= C - -(n-1)C + 0 = nCCost cost = e.cost - dual[e.to] + dual[v];if(dist[e.to] - dist[v] > cost) {dist[e.to] = dist[v] + cost;pv[e.to] = v;pe[e.to] = i;que.push(Q{dist[e.to], e.to});}}}if(!vis[t]) { return false; }for(int v = 0; v < _n; v++) {if(!vis[v]) continue;// dual[v] = dual[v] - dist[t] + dist[v]// = dual[v] - (shortest(s, t) + dual[s] - dual[t]) + (shortest(s, v) + dual[s] - dual[v])// = - shortest(s, t) + dual[t] + shortest(s, v)// = shortest(s, v) - shortest(s, t) >= 0 - (n-1)Cdual[v] -= dist[t] - dist[v];}return true;};Cap flow = 0;Cost cost = 0, prev_cost = -1;std::vector<std::pair<Cap, Cost>> result;result.push_back({flow, cost});while(flow < flow_limit) {if(!dual_ref()) break;Cap c = flow_limit - flow;for(int v = t; v != s; v = pv[v]) { c = std::min(c, g[pv[v]][pe[v]].cap); }for(int v = t; v != s; v = pv[v]) {auto &e = g[pv[v]][pe[v]];e.cap -= c;g[v][e.rev].cap += c;}Cost d = -dual[s];flow += c;cost += c * d;if(prev_cost == d) { result.pop_back(); }result.push_back({flow, cost});prev_cost = cost;}return result;}private:int _n;struct _edge {int to, rev;Cap cap;Cost cost;};std::vector<std::pair<int, int>> pos;std::vector<std::vector<_edge>> g;};} // namespace atcoderint main() {INT(n);LL(m);vll b;vll l, r;rep(i, n) {LL(x, y, z);l.eb(min(x, z));r.eb(max(x, z));b.eb(y);}atcoder::mcf_graph<int, ll> flow(n * 3 + 2);int s = n * 3, t = n * 3 + 1;sort(all(b));rep(i, n) flow.add_edge(s, i, 1, 0);// rep(i, n) flow.add_edge(i, i + n, 1, 0);rep(i, n) flow.add_edge(i, i + n, 1, b[i]);rep3(i, n - 1, 1) flow.add_edge(i, i - 1, n - i, 0);rep(i, n - 1) flow.add_edge(i + n, i + n + 1, i + 1, 0);rep(i, n) {int k = lb(b, l[i]) - 1;if(k >= 0) flow.add_edge(k + n, n * 2 + i, 1, 0);k = ub(b, r[i]);if(k < n) flow.add_edge(k, n * 2 + i, 1, r[i]);flow.add_edge(n * 2 + i, t, 1, 0);}ll sum = accumulate(all(b), 0LL) + accumulate(all(r), 0LL);auto [cap, cost] = flow.flow(s, t);if(cap != n) drop(NO);YES();if(cost <= sum - m)cout << "KADOMATSU!" << endl;elsecout << "NO" << endl;}