結果
問題 | No.1341 真ん中を入れ替えて門松列 |
ユーザー | NyaanNyaan |
提出日時 | 2021-01-15 22:51:05 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,878 ms / 2,000 ms |
コード長 | 20,924 bytes |
コンパイル時間 | 4,469 ms |
コンパイル使用メモリ | 318,500 KB |
実行使用メモリ | 14,156 KB |
最終ジャッジ日時 | 2024-11-26 16:55:33 |
合計ジャッジ時間 | 15,183 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 1 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | AC | 1 ms
5,248 KB |
testcase_04 | AC | 1 ms
5,248 KB |
testcase_05 | AC | 2 ms
5,248 KB |
testcase_06 | AC | 7 ms
5,248 KB |
testcase_07 | AC | 324 ms
5,696 KB |
testcase_08 | AC | 8 ms
6,992 KB |
testcase_09 | AC | 198 ms
5,700 KB |
testcase_10 | AC | 414 ms
8,264 KB |
testcase_11 | AC | 416 ms
8,140 KB |
testcase_12 | AC | 340 ms
7,616 KB |
testcase_13 | AC | 1,038 ms
11,408 KB |
testcase_14 | AC | 1,601 ms
13,648 KB |
testcase_15 | AC | 1,830 ms
13,900 KB |
testcase_16 | AC | 1,878 ms
13,900 KB |
testcase_17 | AC | 1,818 ms
14,156 KB |
testcase_18 | AC | 224 ms
6,212 KB |
ソースコード
/*** date : 2021-01-15 22:50:54*/#define NDEBUG#pragma GCC optimize ("O3,unroll-loops")#pragma GCC target ("avx2")using namespace std;// intrinstic#include <immintrin.h>#include <algorithm>#include <array>#include <bitset>#include <cassert>#include <cctype>#include <cfenv>#include <cfloat>#include <chrono>#include <cinttypes>#include <climits>#include <cmath>#include <complex>#include <csetjmp>#include <csignal>#include <cstdarg>#include <cstddef>#include <cstdint>#include <cstdio>#include <cstdlib>#include <cstring>#include <ctime>#include <deque>#include <exception>#include <forward_list>#include <fstream>#include <functional>#include <initializer_list>#include <iomanip>#include <ios>#include <iosfwd>#include <iostream>#include <istream>#include <iterator>#include <limits>#include <list>#include <locale>#include <map>#include <memory>#include <new>#include <numeric>#include <ostream>#include <queue>#include <random>#include <ratio>#include <regex>#include <set>#include <sstream>#include <stack>#include <stdexcept>#include <streambuf>#include <string>#include <system_error>#include <tuple>#include <type_traits>#include <typeinfo>#include <unordered_map>#include <unordered_set>#include <utility>#include <valarray>#include <vector>// utilitynamespace Nyaan {using ll = long long;using i64 = long long;using u64 = unsigned long long;using i128 = __int128_t;using u128 = __uint128_t;template <typename T>using V = vector<T>;template <typename T>using VV = vector<vector<T>>;using vi = vector<int>;using vl = vector<long long>;using vd = V<double>;using vs = V<string>;using vvi = vector<vector<int>>;using vvl = vector<vector<long long>>;template <typename T, typename U>struct P : pair<T, U> {template <typename... Args>P(Args... args) : pair<T, U>(args...) {}using pair<T, U>::first;using pair<T, U>::second;T &x() { return first; }const T &x() const { return first; }U &y() { return second; }const U &y() const { return second; }P &operator+=(const P &r) {first += r.first;second += r.second;return *this;}P &operator-=(const P &r) {first -= r.first;second -= r.second;return *this;}P &operator*=(const P &r) {first *= r.first;second *= r.second;return *this;}P operator+(const P &r) const { return P(*this) += r; }P operator-(const P &r) const { return P(*this) -= r; }P operator*(const P &r) const { return P(*this) *= r; }};using pl = P<ll, ll>;using pi = P<int, int>;using vp = V<pl>;constexpr int inf = 1001001001;constexpr long long infLL = 4004004004004004004LL;template <typename T>int sz(const T &t) {return t.size();}template <typename T, size_t N>void mem(T (&a)[N], int c) {memset(a, c, sizeof(T) * N);}template <typename T, typename U>inline bool amin(T &x, U y) {return (y < x) ? (x = y, true) : false;}template <typename T, typename U>inline bool amax(T &x, U y) {return (x < y) ? (x = y, true) : false;}template <typename T>int lb(const vector<T> &v, const T &a) {return lower_bound(begin(v), end(v), a) - begin(v);}template <typename T>int ub(const vector<T> &v, const T &a) {return upper_bound(begin(v), end(v), a) - begin(v);}constexpr long long TEN(int n) {long long ret = 1, x = 10;for (; n; x *= x, n >>= 1) ret *= (n & 1 ? x : 1);return ret;}template <typename T, typename U>pair<T, U> mkp(const T &t, const U &u) {return make_pair(t, u);}template <typename T>vector<T> mkrui(const vector<T> &v, bool rev = false) {vector<T> ret(v.size() + 1);if (rev) {for (int i = int(v.size()) - 1; i >= 0; i--) ret[i] = v[i] + ret[i + 1];} else {for (int i = 0; i < int(v.size()); i++) ret[i + 1] = ret[i] + v[i];}return ret;};template <typename T>vector<T> mkuni(const vector<T> &v) {vector<T> ret(v);sort(ret.begin(), ret.end());ret.erase(unique(ret.begin(), ret.end()), ret.end());return ret;}template <typename F>vector<int> mkord(int N, F f) {vector<int> ord(N);iota(begin(ord), end(ord), 0);sort(begin(ord), end(ord), f);return ord;}template <typename T>vector<T> reord(const vector<T> &v, const vector<T> &ord) {int N = v.size();vector<T> ret(N);for (int i = 0; i < N; i++) ret[i] = v[ord[i]];return ret;};template <typename T = int>vector<T> mkiota(int N) {vector<T> ret(N);iota(begin(ret), end(ret), 0);return ret;}template <typename T>vector<int> mkinv(vector<T> &v, int max_val = -1) {if (max_val < (int)v.size()) max_val = v.size() - 1;vector<int> inv(max_val + 1, -1);for (int i = 0; i < (int)v.size(); i++) inv[v[i]] = i;return inv;}} // namespace Nyaan// bit operationnamespace Nyaan {__attribute__((target("popcnt"))) inline int popcnt(const u64 &a) {return _mm_popcnt_u64(a);}__attribute__((target("bmi"))) inline int lsb(const u64 &a) {return _tzcnt_u64(a);}__attribute__((target("bmi"))) inline int ctz(const u64 &a) {return _tzcnt_u64(a);}__attribute__((target("lzcnt"))) inline int msb(const u64 &a) {return 63 - _lzcnt_u64(a);}__attribute__((target("lzcnt"))) inline int clz64(const u64 &a) {return _lzcnt_u64(a);}template <typename T>inline int gbit(const T &a, int i) {return (a >> i) & 1;}template <typename T>inline void sbit(T &a, int i, bool b) {a ^= (gbit(a, i) == b ? 0 : (T(b) << i));}constexpr long long PW(int n) { return 1LL << n; }constexpr long long MSK(int n) { return (1LL << n) - 1; }} // namespace Nyaan// inoutnamespace Nyaan {template <typename T, typename U>ostream &operator<<(ostream &os, const pair<T, U> &p) {os << p.first << " " << p.second;return os;}template <typename T, typename U>istream &operator>>(istream &is, pair<T, U> &p) {is >> p.first >> p.second;return is;}template <typename T>ostream &operator<<(ostream &os, const vector<T> &v) {int s = (int)v.size();for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];return os;}template <typename T>istream &operator>>(istream &is, vector<T> &v) {for (auto &x : v) is >> x;return is;}void in() {}template <typename T, class... U>void in(T &t, U &... u) {cin >> t;in(u...);}void out() { cout << "\n"; }template <typename T, class... U, char sep = ' '>void out(const T &t, const U &... u) {cout << t;if (sizeof...(u)) cout << sep;out(u...);}void outr() {}template <typename T, class... U, char sep = ' '>void outr(const T &t, const U &... u) {cout << t;outr(u...);}struct IoSetupNya {IoSetupNya() {cin.tie(nullptr);ios::sync_with_stdio(false);cout << fixed << setprecision(15);cerr << fixed << setprecision(7);}} iosetupnya;} // namespace Nyaan// debugnamespace DebugImpl {template <typename U, typename = void>struct is_specialize : false_type {};template <typename U>struct is_specialize<U, typename conditional<false, typename U::iterator, void>::type>: true_type {};template <typename U>struct is_specialize<U, typename conditional<false, decltype(U::first), void>::type>: true_type {};template <typename U>struct is_specialize<U, enable_if_t<is_integral<U>::value, void>> : true_type {};void dump(const char& t) { cerr << t; }void dump(const string& t) { cerr << t; }template <typename U,enable_if_t<!is_specialize<U>::value, nullptr_t> = nullptr>void dump(const U& t) {cerr << t;}template <typename T>void dump(const T& t, enable_if_t<is_integral<T>::value>* = nullptr) {string res;if (t == Nyaan::inf) res = "inf";if (is_signed<T>::value)if (t == -Nyaan::inf) res = "-inf";if (sizeof(T) == 8) {if (t == Nyaan::infLL) res = "inf";if (is_signed<T>::value)if (t == -Nyaan::infLL) res = "-inf";}if (res.empty()) res = to_string(t);cerr << res;}template <typename T, typename U>void dump(const pair<T, U>&);template <typename T>void dump(const pair<T*, int>&);template <typename T>void dump(const T& t,enable_if_t<!is_void<typename T::iterator>::value>* = nullptr) {cerr << "[ ";for (auto it = t.begin(); it != t.end();) {dump(*it);cerr << (++it == t.end() ? "" : ", ");}cerr << " ]";}template <typename T, typename U>void dump(const pair<T, U>& t) {cerr << "( ";dump(t.first);cerr << ", ";dump(t.second);cerr << " )";}template <typename T>void dump(const pair<T*, int>& t) {cerr << "[ ";for (int i = 0; i < t.second; i++) {dump(t.first[i]);cerr << (i == t.second - 1 ? "" : ", ");}cerr << " ]";}void trace() { cerr << endl; }template <typename Head, typename... Tail>void trace(Head&& head, Tail&&... tail) {cerr << " ";dump(head);if (sizeof...(tail) != 0) cerr << ",";trace(forward<Tail>(tail)...);}} // namespace DebugImpl#ifdef NyaanDebug#define trc(...) \do { \cerr << "## " << #__VA_ARGS__ << " = "; \DebugImpl::trace(__VA_ARGS__); \} while (0)#else#define trc(...)#endif// macro#define each(x, v) for (auto&& x : v)#define each2(x, y, v) for (auto&& [x, y] : v)#define all(v) (v).begin(), (v).end()#define rep(i, N) for (long long i = 0; i < (long long)(N); i++)#define repr(i, N) for (long long i = (long long)(N)-1; i >= 0; i--)#define rep1(i, N) for (long long i = 1; i <= (long long)(N); i++)#define repr1(i, N) for (long long i = (N); (long long)(i) > 0; i--)#define reg(i, a, b) for (long long i = (a); i < (b); i++)#define regr(i, a, b) for (long long i = (b)-1; i >= (a); i--)#define repc(i, a, cond) for (long long i = (a); (cond); i++)#define enm(i, val, vec) \for (long long i = 0; i < (long long)(vec).size(); i++) \if (auto& val = vec[i]; false) \; \else#define ini(...) \int __VA_ARGS__; \in(__VA_ARGS__)#define inl(...) \long long __VA_ARGS__; \in(__VA_ARGS__)#define ins(...) \string __VA_ARGS__; \in(__VA_ARGS__)#define inc(...) \char __VA_ARGS__; \in(__VA_ARGS__)#define in2(s, t) \for (int i = 0; i < (int)s.size(); i++) { \in(s[i], t[i]); \}#define in3(s, t, u) \for (int i = 0; i < (int)s.size(); i++) { \in(s[i], t[i], u[i]); \}#define in4(s, t, u, v) \for (int i = 0; i < (int)s.size(); i++) { \in(s[i], t[i], u[i], v[i]); \}#define die(...) \do { \Nyaan::out(__VA_ARGS__); \return; \} while (0)namespace Nyaan {void solve();}int main() { Nyaan::solve(); }//namespace atcoder {namespace internal {template <class E> struct csr {std::vector<int> start;std::vector<E> elist;csr(int n, const std::vector<std::pair<int, E>>& edges): start(n + 1), elist(edges.size()) {for (auto e : edges) {start[e.first + 1]++;}for (int i = 1; i <= n; i++) {start[i] += start[i - 1];}auto counter = start;for (auto e : edges) {elist[counter[e.first]++] = e.second;}}};} // namespace internal} // namespace atcodernamespace atcoder {namespace internal {template <class T> struct simple_queue {std::vector<T> payload;int pos = 0;void reserve(int n) { payload.reserve(n); }int size() const { return int(payload.size()) - pos; }bool empty() const { return pos == int(payload.size()); }void push(const T& t) { payload.push_back(t); }T& front() { return payload[pos]; }void clear() {payload.clear();pos = 0;}void pop() { pos++; }};} // namespace internal} // namespace atcodernamespace atcoder {template <class Cap, class Cost> struct mcf_graph {public:mcf_graph() {}mcf_graph(int n) : _n(n) {}int add_edge(int from, int to, Cap cap, Cost cost) {assert(0 <= from && from < _n);assert(0 <= to && to < _n);assert(0 <= cap);assert(0 <= cost);int m = int(_edges.size());_edges.push_back({from, to, cap, 0, cost});return m;}struct edge {int from, to;Cap cap, flow;Cost cost;};edge get_edge(int i) {int m = int(_edges.size());assert(0 <= i && i < m);return _edges[i];}std::vector<edge> edges() { return _edges; }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);int m = int(_edges.size());std::vector<int> edge_idx(m);auto g = [&]() {std::vector<int> degree(_n), redge_idx(m);std::vector<std::pair<int, _edge>> elist;elist.reserve(2 * m);for (int i = 0; i < m; i++) {auto e = _edges[i];edge_idx[i] = degree[e.from]++;redge_idx[i] = degree[e.to]++;elist.push_back({e.from, {e.to, -1, e.cap - e.flow, e.cost}});elist.push_back({e.to, {e.from, -1, e.flow, -e.cost}});}auto _g = internal::csr<_edge>(_n, elist);for (int i = 0; i < m; i++) {auto e = _edges[i];edge_idx[i] += _g.start[e.from];redge_idx[i] += _g.start[e.to];_g.elist[edge_idx[i]].rev = redge_idx[i];_g.elist[redge_idx[i]].rev = edge_idx[i];}return _g;}();auto result = slope(g, s, t, flow_limit);for (int i = 0; i < m; i++) {auto e = g.elist[edge_idx[i]];_edges[i].flow = _edges[i].cap - e.cap;}return result;}private:int _n;std::vector<edge> _edges;// inside edgestruct _edge {int to, rev;Cap cap;Cost cost;};std::vector<std::pair<Cap, Cost>> slope(internal::csr<_edge>& g,int s,int t,Cap flow_limit) {// 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 edge// dual_dist[i] = (dual[i], dist[i])std::vector<std::pair<Cost, Cost>> dual_dist(_n);std::vector<int> prev_e(_n);std::vector<bool> vis(_n);struct Q {Cost key;int to;bool operator<(Q r) const { return key > r.key; }};std::vector<int> que_min;std::vector<Q> que;auto dual_ref = [&]() {for (int i = 0; i < _n; i++) {dual_dist[i].second = std::numeric_limits<Cost>::max();}std::fill(vis.begin(), vis.end(), false);que_min.clear();que.clear();// que[0..heap_r) was heapifiedsize_t heap_r = 0;dual_dist[s].second = 0;que_min.push_back(s);while (!que_min.empty() || !que.empty()) {int v;if (!que_min.empty()) {v = que_min.back();que_min.pop_back();} else {while (heap_r < que.size()) {heap_r++;std::push_heap(que.begin(), que.begin() + heap_r);}v = que.front().to;std::pop_heap(que.begin(), que.end());que.pop_back();heap_r--;}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)CCost dual_v = dual_dist[v].first, dist_v = dual_dist[v].second;for (int i = g.start[v]; i < g.start[v + 1]; i++) {auto e = g.elist[i];if (!e.cap) continue;// |-dual[e.to] + dual[v]| <= (n-1)C// cost <= C - -(n-1)C + 0 = nCCost cost = e.cost - dual_dist[e.to].first + dual_v;if (dual_dist[e.to].second - dist_v > cost) {Cost dist_to = dist_v + cost;dual_dist[e.to].second = dist_to;prev_e[e.to] = e.rev;if (dist_to == dist_v) {que_min.push_back(e.to);} else {que.push_back(Q{dist_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_dist[v].first -= dual_dist[t].second - dual_dist[v].second;}return true;};Cap flow = 0;Cost cost = 0, prev_cost_per_flow = -1;std::vector<std::pair<Cap, Cost>> result = {{Cap(0), Cost(0)}};while (flow < flow_limit) {if (!dual_ref()) break;Cap c = flow_limit - flow;for (int v = t; v != s; v = g.elist[prev_e[v]].to) {c = std::min(c, g.elist[g.elist[prev_e[v]].rev].cap);}for (int v = t; v != s; v = g.elist[prev_e[v]].to) {auto& e = g.elist[prev_e[v]];e.cap += c;g.elist[e.rev].cap -= c;}Cost d = -dual_dist[s].first;flow += c;cost += c * d;if (prev_cost_per_flow == d) {result.pop_back();}result.push_back({flow, cost});prev_cost_per_flow = d;}return result;}};} // namespace atcoderusing namespace Nyaan;using namespace atcoder;void Nyaan::solve() {inl(N, M);vl a(N), b(N), c(N);in3(a, b, c);auto zip = mkuni(b);sort(all(zip));int X = 1 << (msb(N) + 1);mcf_graph<ll, ll> g(5 * X + 2);int s = 5 * X;int t = 5 * X + 1;unordered_map<ll, ll> cnt;each(x, b) cnt[x]++;// スタートから a,cに該当する頂点へ辺を貼るrep(i, N) g.add_edge(s, i + 4 * X, 1, 0);// 0~1, 2~3にセグ木を作るfor (int i = 2; i < X; i++) {int p = i >> 1;g.add_edge(p + 0 * X, i + 0 * X, N, 0);g.add_edge(p + 2 * X, i + 2 * X, N, 0);}// うくちゃん~~~rep(i, sz(zip)) {int p = (i + X) >> 1;g.add_edge(p + 0 * X, i + 1 * X, cnt[zip[i]], 0);g.add_edge(p + 2 * X, i + 3 * X, cnt[zip[i]], 0);}// セグ木の根同士、あとスタートとゴールを結んでうくちゃんをするrep(i, sz(zip)) {g.add_edge(i + 3 * X, i + 1 * X, cnt[zip[i]], inf - zip[i]);g.add_edge(i + 1 * X, t, cnt[zip[i]], 0);}rep(i, N) {ll A = a[i], C = c[i];if (A > C) swap(A, C);// 選べるのはA未満とC超過int S = 4 * X + i, L, R;// A未満 ... [0, l)int l = lb(zip, A);L = 0 + X, R = l + X;while (L < R) {if (L & 1) g.add_edge(S, L++, 1, inf - C);if (R & 1) g.add_edge(S, --R, 1, inf - C);L >>= 1;R >>= 1;}int r = ub(zip, C);// C超過 .. [r, N)L = r + X, R = sz(zip) + X;while (L < R) {if (L & 1) g.add_edge(S, L + 2 * X, 1, 0), L++;if (R & 1) --R, g.add_edge(S, R + 2 * X, 1, 0);L >>= 1;R >>= 1;}}auto res = g.flow(s, t, N);ll mx = ll(inf) * N - res.second;if (res.first != N) die("NO");out("YES");out(mx >= M ? "KADOMATSU!" : "NO");}