結果
問題 | No.2771 Personal Space |
ユーザー |
![]() |
提出日時 | 2024-05-31 21:40:36 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 111 ms / 2,000 ms |
コード長 | 19,564 bytes |
コンパイル時間 | 6,011 ms |
コンパイル使用メモリ | 320,940 KB |
実行使用メモリ | 16,408 KB |
最終ジャッジ日時 | 2024-12-20 22:54:46 |
合計ジャッジ時間 | 10,924 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 24 |
ソースコード
#line 1 "/home/maspy/compro/library/my_template.hpp"#if defined(LOCAL)#include <my_template_compiled.hpp>#else// https://codeforces.com/blog/entry/96344#pragma GCC optimize("Ofast,unroll-loops")// いまの CF だとこれ入れると動かない?// #pragma GCC target("avx2,popcnt")#include <bits/stdc++.h>using namespace std;using ll = long long;using u32 = unsigned int;using u64 = unsigned long long;using i128 = __int128;using u128 = unsigned __int128;using f128 = __float128;template <class T>constexpr T infty = 0;template <>constexpr int infty<int> = 1'000'000'000;template <>constexpr ll infty<ll> = ll(infty<int>) * infty<int> * 2;template <>constexpr u32 infty<u32> = infty<int>;template <>constexpr u64 infty<u64> = infty<ll>;template <>constexpr i128 infty<i128> = i128(infty<ll>) * infty<ll>;template <>constexpr double infty<double> = infty<ll>;template <>constexpr long double infty<long double> = infty<ll>;using pi = pair<ll, ll>;using vi = vector<ll>;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 vvvvvc = vector<vvvvc<T>>;template <class T>using pq = priority_queue<T>;template <class T>using pqg = priority_queue<T, vector<T>, greater<T>>;#define vv(type, name, h, ...) \vector<vector<type>> name(h, vector<type>(__VA_ARGS__))#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__))))// https://trap.jp/post/1224/#define FOR1(a) for (ll _ = 0; _ < ll(a); ++_)#define FOR2(i, a) for (ll i = 0; i < ll(a); ++i)#define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i)#define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c))#define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i)#define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i)#define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i)#define overload4(a, b, c, d, e, ...) e#define overload3(a, b, c, d, ...) d#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)#define FOR_R(...) overload3(__VA_ARGS__, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)#define FOR_subset(t, s) \for (ll t = (s); t >= 0; t = (t == 0 ? -1 : (t - 1) & (s)))#define all(x) x.begin(), x.end()#define len(x) ll(x.size())#define elif else if#define eb emplace_back#define mp make_pair#define mt make_tuple#define fi first#define se second#define stoi stollint popcnt(int x) { return __builtin_popcount(x); }int popcnt(u32 x) { return __builtin_popcount(x); }int popcnt(ll x) { return __builtin_popcountll(x); }int popcnt(u64 x) { return __builtin_popcountll(x); }int popcnt_mod_2(int x) { return __builtin_parity(x); }int popcnt_mod_2(u32 x) { return __builtin_parity(x); }int popcnt_mod_2(ll x) { return __builtin_parityll(x); }int popcnt_mod_2(u64 x) { return __builtin_parityll(x); }// (0, 1, 2, 3, 4) -> (-1, 0, 1, 1, 2)int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }int topbit(u32 x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }int topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }// (0, 1, 2, 3, 4) -> (-1, 0, 1, 0, 2)int lowbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }int lowbit(u32 x) { return (x == 0 ? -1 : __builtin_ctz(x)); }int lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }int lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }template <typename T>T floor(T a, T b) {return a / b - (a % b && (a ^ b) < 0);}template <typename T>T ceil(T x, T y) {return floor(x + y - 1, y);}template <typename T>T bmod(T x, T y) {return x - y * floor(x, y);}template <typename T>pair<T, T> divmod(T x, T y) {T q = floor(x, y);return {q, x - q * y};}template <typename T, typename U>T SUM(const vector<U> &A) {T sm = 0;for (auto &&a: A) sm += a;return sm;}#define MIN(v) *min_element(all(v))#define MAX(v) *max_element(all(v))#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))#define UNIQUE(x) \sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()template <typename T>T POP(deque<T> &que) {T a = que.front();que.pop_front();return a;}template <typename T>T POP(pq<T> &que) {T a = que.top();que.pop();return a;}template <typename T>T POP(pqg<T> &que) {T a = que.top();que.pop();return a;}template <typename T>T POP(vc<T> &que) {T a = que.back();que.pop_back();return a;}template <typename F>ll binary_search(F check, ll ok, ll ng, bool check_ok = true) {if (check_ok) assert(check(ok));while (abs(ok - ng) > 1) {auto x = (ng + ok) / 2;(check(x) ? ok : ng) = x;}return ok;}template <typename F>double binary_search_real(F check, double ok, double ng, int iter = 100) {FOR(iter) {double x = (ok + ng) / 2;(check(x) ? ok : ng) = x;}return (ok + ng) / 2;}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);}// ? は -1vc<int> s_to_vi(const string &S, char first_char) {vc<int> A(S.size());FOR(i, S.size()) { A[i] = (S[i] != '?' ? S[i] - first_char : -1); }return A;}template <typename T, typename U>vector<T> cumsum(vector<U> &A, int off = 1) {int N = A.size();vector<T> B(N + 1);FOR(i, N) { B[i + 1] = B[i] + A[i]; }if (off == 0) B.erase(B.begin());return B;}// stable sorttemplate <typename T>vector<int> argsort(const vector<T> &A) {vector<int> ids(len(A));iota(all(ids), 0);sort(all(ids),[&](int i, int j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });return ids;}// A[I[0]], A[I[1]], ...template <typename T>vc<T> rearrange(const vc<T> &A, const vc<int> &I) {vc<T> B(len(I));FOR(i, len(I)) B[i] = A[I[i]];return B;}#endif#line 1 "/home/maspy/compro/library/other/io.hpp"#define FASTIO#include <unistd.h>// https://judge.yosupo.jp/submission/21623namespace fastio {static constexpr uint32_t SZ = 1 << 17;char ibuf[SZ];char obuf[SZ];char out[100];// pointer of ibuf, obufuint32_t pil = 0, pir = 0, por = 0;struct Pre {char num[10000][4];constexpr Pre() : num() {for (int i = 0; i < 10000; i++) {int n = i;for (int j = 3; j >= 0; j--) {num[i][j] = n % 10 | '0';n /= 10;}}}} constexpr pre;inline void load() {memcpy(ibuf, ibuf + pil, pir - pil);pir = pir - pil + fread(ibuf + pir - pil, 1, SZ - pir + pil, stdin);pil = 0;if (pir < SZ) ibuf[pir++] = '\n';}inline void flush() {fwrite(obuf, 1, por, stdout);por = 0;}void rd(char &c) {do {if (pil + 1 > pir) load();c = ibuf[pil++];} while (isspace(c));}void rd(string &x) {x.clear();char c;do {if (pil + 1 > pir) load();c = ibuf[pil++];} while (isspace(c));do {x += c;if (pil == pir) load();c = ibuf[pil++];} while (!isspace(c));}template <typename T>void rd_real(T &x) {string s;rd(s);x = stod(s);}template <typename T>void rd_integer(T &x) {if (pil + 100 > pir) load();char c;doc = ibuf[pil++];while (c < '-');bool minus = 0;if constexpr (is_signed<T>::value || is_same_v<T, i128>) {if (c == '-') { minus = 1, c = ibuf[pil++]; }}x = 0;while ('0' <= c) { x = x * 10 + (c & 15), c = ibuf[pil++]; }if constexpr (is_signed<T>::value || is_same_v<T, i128>) {if (minus) x = -x;}}void rd(int &x) { rd_integer(x); }void rd(ll &x) { rd_integer(x); }void rd(i128 &x) { rd_integer(x); }void rd(u32 &x) { rd_integer(x); }void rd(u64 &x) { rd_integer(x); }void rd(u128 &x) { rd_integer(x); }void rd(double &x) { rd_real(x); }void rd(long double &x) { rd_real(x); }void rd(f128 &x) { rd_real(x); }template <class T, class U>void rd(pair<T, U> &p) {return rd(p.first), rd(p.second);}template <size_t N = 0, typename T>void rd_tuple(T &t) {if constexpr (N < std::tuple_size<T>::value) {auto &x = std::get<N>(t);rd(x);rd_tuple<N + 1>(t);}}template <class... T>void rd(tuple<T...> &tpl) {rd_tuple(tpl);}template <size_t N = 0, typename T>void rd(array<T, N> &x) {for (auto &d: x) rd(d);}template <class T>void rd(vc<T> &x) {for (auto &d: x) rd(d);}void read() {}template <class H, class... T>void read(H &h, T &... t) {rd(h), read(t...);}void wt(const char c) {if (por == SZ) flush();obuf[por++] = c;}void wt(const string s) {for (char c: s) wt(c);}void wt(const char *s) {size_t len = strlen(s);for (size_t i = 0; i < len; i++) wt(s[i]);}template <typename T>void wt_integer(T x) {if (por > SZ - 100) flush();if (x < 0) { obuf[por++] = '-', x = -x; }int outi;for (outi = 96; x >= 10000; outi -= 4) {memcpy(out + outi, pre.num[x % 10000], 4);x /= 10000;}if (x >= 1000) {memcpy(obuf + por, pre.num[x], 4);por += 4;} else if (x >= 100) {memcpy(obuf + por, pre.num[x] + 1, 3);por += 3;} else if (x >= 10) {int q = (x * 103) >> 10;obuf[por] = q | '0';obuf[por + 1] = (x - q * 10) | '0';por += 2;} elseobuf[por++] = x | '0';memcpy(obuf + por, out + outi + 4, 96 - outi);por += 96 - outi;}template <typename T>void wt_real(T x) {ostringstream oss;oss << fixed << setprecision(15) << double(x);string s = oss.str();wt(s);}void wt(int x) { wt_integer(x); }void wt(ll x) { wt_integer(x); }void wt(i128 x) { wt_integer(x); }void wt(u32 x) { wt_integer(x); }void wt(u64 x) { wt_integer(x); }void wt(u128 x) { wt_integer(x); }void wt(double x) { wt_real(x); }void wt(long double x) { wt_real(x); }void wt(f128 x) { wt_real(x); }template <class T, class U>void wt(const pair<T, U> val) {wt(val.first);wt(' ');wt(val.second);}template <size_t N = 0, typename T>void wt_tuple(const T t) {if constexpr (N < std::tuple_size<T>::value) {if constexpr (N > 0) { wt(' '); }const auto x = std::get<N>(t);wt(x);wt_tuple<N + 1>(t);}}template <class... T>void wt(tuple<T...> tpl) {wt_tuple(tpl);}template <class T, size_t S>void wt(const array<T, S> val) {auto n = val.size();for (size_t i = 0; i < n; i++) {if (i) wt(' ');wt(val[i]);}}template <class T>void wt(const vector<T> val) {auto n = val.size();for (size_t i = 0; i < n; i++) {if (i) wt(' ');wt(val[i]);}}void print() { wt('\n'); }template <class Head, class... Tail>void print(Head &&head, Tail &&... tail) {wt(head);if (sizeof...(Tail)) wt(' ');print(forward<Tail>(tail)...);}// gcc expansion. called automaticall after main.void __attribute__((destructor)) _d() { flush(); }} // namespace fastiousing fastio::read;using fastio::print;using fastio::flush;#if defined(LOCAL)#define SHOW(...) \SHOW_IMPL(__VA_ARGS__, SHOW4, SHOW3, SHOW2, SHOW1)(__VA_ARGS__)#define SHOW_IMPL(_1, _2, _3, _4, NAME, ...) NAME#define SHOW1(x) print(#x, "=", (x)), flush()#define SHOW2(x, y) print(#x, "=", (x), #y, "=", (y)), flush()#define SHOW3(x, y, z) print(#x, "=", (x), #y, "=", (y), #z, "=", (z)), flush()#define SHOW4(x, y, z, w) \print(#x, "=", (x), #y, "=", (y), #z, "=", (z), #w, "=", (w)), flush()#else#define SHOW(...)#endif#define INT(...) \int __VA_ARGS__; \read(__VA_ARGS__)#define LL(...) \ll __VA_ARGS__; \read(__VA_ARGS__)#define U32(...) \u32 __VA_ARGS__; \read(__VA_ARGS__)#define U64(...) \u64 __VA_ARGS__; \read(__VA_ARGS__)#define STR(...) \string __VA_ARGS__; \read(__VA_ARGS__)#define CHAR(...) \char __VA_ARGS__; \read(__VA_ARGS__)#define DBL(...) \double __VA_ARGS__; \read(__VA_ARGS__)#define VEC(type, name, size) \vector<type> name(size); \read(name)#define VV(type, name, h, w) \vector<vector<type>> name(h, vector<type>(w)); \read(name)void YES(bool t = 1) { print(t ? "YES" : "NO"); }void NO(bool t = 1) { YES(!t); }void Yes(bool t = 1) { print(t ? "Yes" : "No"); }void No(bool t = 1) { Yes(!t); }void yes(bool t = 1) { print(t ? "yes" : "no"); }void no(bool t = 1) { yes(!t); }#line 3 "main.cpp"#line 2 "/home/maspy/compro/library/ds/fastset.hpp"// 64-ary tree// space: (N/63) * u64struct FastSet {static constexpr u32 B = 64;int n, log;vvc<u64> seg;FastSet() {}FastSet(int n) { build(n); }int size() { return n; }template <typename F>FastSet(int n, F f) {build(n, f);}void build(int m) {seg.clear();n = m;do {seg.push_back(vc<u64>((m + B - 1) / B));m = (m + B - 1) / B;} while (m > 1);log = len(seg);}template <typename F>void build(int n, F f) {build(n);FOR(i, n) { seg[0][i / B] |= u64(f(i)) << (i % B); }FOR(h, log - 1) {FOR(i, len(seg[h])) {seg[h + 1][i / B] |= u64(bool(seg[h][i])) << (i % B);}}}bool operator[](int i) const { return seg[0][i / B] >> (i % B) & 1; }void insert(int i) {for (int h = 0; h < log; h++) {seg[h][i / B] |= u64(1) << (i % B), i /= B;}}void add(int i) { insert(i); }void erase(int i) {u64 x = 0;for (int h = 0; h < log; h++) {seg[h][i / B] &= ~(u64(1) << (i % B));seg[h][i / B] |= x << (i % B);x = bool(seg[h][i / B]);i /= B;}}void remove(int i) { erase(i); }// min[x,n) or nint next(int i) {assert(i <= n);chmax(i, 0);for (int h = 0; h < log; h++) {if (i / B == seg[h].size()) break;u64 d = seg[h][i / B] >> (i % B);if (!d) {i = i / B + 1;continue;}i += lowbit(d);for (int g = h - 1; g >= 0; g--) {i *= B;i += lowbit(seg[g][i / B]);}return i;}return n;}// max [0,x], or -1int prev(int i) {assert(i >= -1);if (i >= n) i = n - 1;for (int h = 0; h < log; h++) {if (i == -1) break;u64 d = seg[h][i / B] << (63 - i % B);if (!d) {i = i / B - 1;continue;}i -= __builtin_clzll(d);for (int g = h - 1; g >= 0; g--) {i *= B;i += topbit(seg[g][i / B]);}return i;}return -1;}bool any(int l, int r) { return next(l) < r; }// [l, r)template <typename F>void enumerate(int l, int r, F f) {for (int x = next(l); x < r; x = next(x + 1)) f(x);}string to_string() {string s(n, '?');for (int i = 0; i < n; ++i) s[i] = ((*this)[i] ? '1' : '0');return s;}};#line 2 "/home/maspy/compro/library/alg/monoid/max_idx.hpp"template <typename T, bool tie_is_left = true>struct Monoid_Max_Idx {using value_type = pair<T, int>;using X = value_type;static X op(X x, X y) {if (x.fi > y.fi) return x;if (x.fi < y.fi) return y;if (x.se > y.se) swap(x, y);return (tie_is_left ? x : y);}static constexpr X unit() { return {-infty<T>, -1}; }static constexpr bool commute = true;};#line 2 "/home/maspy/compro/library/ds/segtree/segtree.hpp"template <class Monoid>struct SegTree {using MX = Monoid;using X = typename MX::value_type;using value_type = X;vc<X> dat;int n, log, size;SegTree() {}SegTree(int n) { build(n); }template <typename F>SegTree(int n, F f) {build(n, f);}SegTree(const vc<X>& v) { build(v); }void build(int m) {build(m, [](int i) -> X { return MX::unit(); });}void build(const vc<X>& v) {build(len(v), [&](int i) -> X { return v[i]; });}template <typename F>void build(int m, F f) {n = m, log = 1;while ((1 << log) < n) ++log;size = 1 << log;dat.assign(size << 1, MX::unit());FOR(i, n) dat[size + i] = f(i);FOR_R(i, 1, size) update(i);}X get(int i) { return dat[size + i]; }vc<X> get_all() { return {dat.begin() + size, dat.begin() + size + n}; }void update(int i) { dat[i] = Monoid::op(dat[2 * i], dat[2 * i + 1]); }void set(int i, const X& x) {assert(i < n);dat[i += size] = x;while (i >>= 1) update(i);}void multiply(int i, const X& x) {assert(i < n);i += size;dat[i] = Monoid::op(dat[i], x);while (i >>= 1) update(i);}X prod(int L, int R) {assert(0 <= L && L <= R && R <= n);X vl = Monoid::unit(), vr = Monoid::unit();L += size, R += size;while (L < R) {if (L & 1) vl = Monoid::op(vl, dat[L++]);if (R & 1) vr = Monoid::op(dat[--R], vr);L >>= 1, R >>= 1;}return Monoid::op(vl, vr);}X prod_all() { return dat[1]; }template <class F>int max_right(F check, int L) {assert(0 <= L && L <= n && check(Monoid::unit()));if (L == n) return n;L += size;X sm = Monoid::unit();do {while (L % 2 == 0) L >>= 1;if (!check(Monoid::op(sm, dat[L]))) {while (L < size) {L = 2 * L;if (check(Monoid::op(sm, dat[L]))) { sm = Monoid::op(sm, dat[L++]); }}return L - size;}sm = Monoid::op(sm, dat[L++]);} while ((L & -L) != L);return n;}template <class F>int min_left(F check, int R) {assert(0 <= R && R <= n && check(Monoid::unit()));if (R == 0) return 0;R += size;X sm = Monoid::unit();do {--R;while (R > 1 && (R % 2)) R >>= 1;if (!check(Monoid::op(dat[R], sm))) {while (R < size) {R = 2 * R + 1;if (check(Monoid::op(dat[R], sm))) { sm = Monoid::op(dat[R--], sm); }}return R + 1 - size;}sm = Monoid::op(dat[R], sm);} while ((R & -R) != R);return 0;}// prod_{l<=i<r} A[i xor x]X xor_prod(int l, int r, int xor_val) {static_assert(Monoid::commute);X x = Monoid::unit();for (int k = 0; k < log + 1; ++k) {if (l >= r) break;if (l & 1) { x = Monoid::op(x, dat[(size >> k) + ((l++) ^ xor_val)]); }if (r & 1) { x = Monoid::op(x, dat[(size >> k) + ((--r) ^ xor_val)]); }l /= 2, r /= 2, xor_val /= 2;}return x;}};#line 7 "main.cpp"void solve() {LL(N, M);FastSet done(N);--M;vi ANS(N, -1);SegTree<Monoid_Max_Idx<int>> seg(N);auto upd = [&](int i) -> void {if (done[i]) return;SHOW("upd", i);int a = done.prev(i - 1);int b = done.next(i + 1);int d = infty<int>;if (0 <= a && a < N) chmin(d, abs(i - a));if (0 <= b && b < N) chmin(d, abs(i - b));SHOW(d, i);seg.set(i, {d, i});};auto set = [&](int i, int who) -> void {SHOW(i, who);ANS[i] = who;done.insert(i);seg.set(i, {-infty<int>, -1});int a = done.prev(i - 1);int b = done.next(i + 1);if (a == -1) { upd(0); }elif (a < i) { upd((a + i) / 2); }if (b == N) {upd(N - 1);} else {upd((b + i) / 2);}};set(M, 0);FOR(who, 1, N) {auto [x, idx] = seg.prod_all();SHOW(x, idx);set(idx, who);}for (auto& x: ANS) ++x;print(ANS);}signed main() {INT(T);FOR(T) solve();return 0;}