結果
| 問題 |
No.3188 K-th Lexmin
|
| コンテスト | |
| ユーザー |
 hos.lyric
|
| 提出日時 | 2025-06-20 22:00:50 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 261 ms / 3,500 ms |
| コード長 | 9,765 bytes |
| コンパイル時間 | 1,727 ms |
| コンパイル使用メモリ | 129,396 KB |
| 実行使用メモリ | 45,656 KB |
| 最終ジャッジ日時 | 2025-06-20 22:01:06 |
| 合計ジャッジ時間 | 15,311 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 |
| other | AC * 47 |
コンパイルメッセージ
main.cpp: In function ‘int main()’:
main.cpp:280:12: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
280 | scanf("%d%lld", &len, &X[0]);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~
main.cpp:283:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
283 | scanf("%d", &S[0][i]);
| ~~~~~^~~~~~~~~~~~~~~~
ソースコード
//https://atcoder.jp/contests/abc280/submissions/36977301
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using Int = long long;
template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
////////////////////////////////////////////////////////////////////////////////
// SA-IS
// String: string, vector<int>, vector<long long>
// if sigma <= n, O(n) time, O(n) space
// if sigma > n, O(n log n) time, O(n) space
template <class String> vector<int> suffixArrayRec(const String &as) {
const int n = as.size();
if (n == 0) return {};
const auto minmaxA = minmax_element(as.begin(), as.end());
const auto minA = *minmaxA.first, maxA = *minmaxA.second;
if (static_cast<unsigned long long>(maxA) - minA >=
static_cast<unsigned long long>(n)) {
vector<int> us(n);
for (int u = 0; u < n; ++u) us[u] = u;
std::sort(us.begin(), us.end(), [&](int u, int v) -> bool {
return (as[u] < as[v]);
});
int b = 0;
vector<int> bs(n, 0);
for (int i = 1; i < n; ++i) {
if (as[us[i - 1]] != as[us[i]]) ++b;
bs[us[i]] = b;
}
return suffixArrayRec(bs);
}
const int sigma = maxA - minA + 1;
vector<int> pt(sigma + 1, 0), poss(sigma);
for (int u = 0; u < n; ++u) ++pt[as[u] - minA + 1];
for (int a = 0; a < sigma; ++a) pt[a + 1] += pt[a];
// cmp[u] := (as[u, n) < as[u + 1, n))
vector<bool> cmp(n);
cmp[n - 1] = false;
for (int u = n - 1; --u >= 0; ) {
cmp[u] = (as[u] != as[u + 1]) ? (as[u] < as[u + 1]) : cmp[u + 1];
}
// ><, nn - id (0 <= id < n)
int nn = 0;
vector<int> ids(n, 0);
int last = n;
vector<int> nxt(n, 0);
// put ><, from the tail of each bucket
vector<int> us(n, 0);
memcpy(poss.data(), pt.data() + 1, sigma * sizeof(int));
for (int u = n - 1; --u >= 1; ) if (!cmp[u - 1] && cmp[u]) {
ids[u] = ++nn;
nxt[u] = last;
last = u;
us[--poss[as[u] - minA]] = u;
}
// follow > backwards, from the head of each bucket
memcpy(poss.data(), pt.data(), sigma * sizeof(int));
us[poss[as[n - 1] - minA]++] = n - 1;
for (int i = 0; i < n; ++i) {
const int u = us[i];
if (u && !cmp[u - 1]) us[poss[as[u - 1] - minA]++] = u - 1;
}
// follow < backwards, from the tail of each bucket
memcpy(poss.data(), pt.data() + 1, sigma * sizeof(int));
for (int i = n; --i >= 0; ) {
const int u = us[i];
if (u && cmp[u - 1]) us[--poss[as[u - 1] - minA]] = u - 1;
}
if (nn) {
int vsLen = 0;
vector<int> vs(nn);
for (const int u : us) if (ids[u]) vs[vsLen++] = u;
int b = 0;
vector<int> bs(nn, 0);
for (int j = 1; j < nn; ++j) {
// as[v1, w1] (< or =) as[v0, w0]
int v1 = vs[j - 1], v0 = vs[j];
const int w1 = nxt[v1], w0 = nxt[v0];
if (w1 - v1 != w0 - v0) {
++b;
} else {
for (; ; ++v1, ++v0) {
if (v1 == n) { ++b; break; }
if (as[v1] != as[v0]) { ++b; break; }
if (v1 == w1) break;
}
}
bs[nn - ids[vs[j]]] = b;
}
for (int u = 0; u < n; ++u) if (ids[u]) vs[nn - ids[u]] = u;
const auto sub = suffixArrayRec(bs);
// put ><, from the tail of each bucket
memset(us.data(), 0, n * sizeof(int));
memcpy(poss.data(), pt.data() + 1, sigma * sizeof(int));
for (int j = nn; --j >= 0; ) {
const int u = vs[sub[j]];
us[--poss[as[u] - minA]] = u;
}
// follow > backwards, from the head of each bucket
memcpy(poss.data(), pt.data(), sigma * sizeof(int));
us[poss[as[n - 1] - minA]++] = n - 1;
for (int i = 0; i < n; ++i) {
const int u = us[i];
if (u && !cmp[u - 1]) us[poss[as[u - 1] - minA]++] = u - 1;
}
// follow < backwards, from the tail of each bucket
memcpy(poss.data(), pt.data() + 1, sigma * sizeof(int));
for (int i = n; --i >= 0; ) {
const int u = us[i];
if (u && cmp[u - 1]) us[--poss[as[u - 1] - minA]] = u - 1;
}
}
return us;
}
// us[i]: i-th suffix
// su[u]: index of as[u, n)
// hs[i]: longest common prefix of as[us[i - 1], n) and as[us[i], n)
struct SuffixArray {
int n;
bool rmq;
vector<int> us, su, hs, bsr;
SuffixArray() : n(0), rmq(false) {}
SuffixArray(const string &as, bool rmq_) : rmq(rmq_) { build(as); }
SuffixArray(const vector<int> &as, bool rmq_) : rmq(rmq_) { build(as); }
SuffixArray(const vector<long long> &as, bool rmq_) : rmq(rmq_) { build(as); }
template <class String> void build(const String &as) {
n = as.size();
us = suffixArrayRec(as);
su.resize(n + 1);
for (int i = 0; i < n; ++i) su[us[i]] = i;
su[n] = -1;
hs.assign(n, 0);
for (int h = 0, u = 0; u < n; ++u) if (su[u]) {
for (int v = us[su[u] - 1]; v + h < n && as[v + h] == as[u + h]; ++h) {}
hs[su[u]] = h;
if (h) --h;
}
if (rmq) {
const int logN = n ? (31 - __builtin_clz(n)) : 0;
hs.resize((logN + 1) * n - (1 << logN) + 1);
for (int e = 0; e < logN; ++e) {
int *hes = hs.data() + e * n;
for (int i = 0; i <= n - (1 << (e + 1)); ++i) {
hes[n + i] = min(hes[i], hes[i + (1 << e)]);
}
}
bsr.resize(n + 1);
bsr[0] = -1;
for (int i = 1; i <= n; ++i) bsr[i] = bsr[i >> 1] + 1;
}
}
// Returns longest common prefix of as[u, n) and as[v, n).
// 0 <= u, v <= n
// Assumes rmq.
inline int lcp(int u, int v) const {
if (u == v) return n - u;
int i = su[u], j = su[v];
if (i > j) swap(i, j);
const int e = bsr[j - i];
return min(hs[e * n + i + 1], hs[e * n + j + 1 - (1 << e)]);
}
};
////////////////////////////////////////////////////////////////////////////////
// root: min (tie-break: left)
struct MinCartesianTree {
int n, rt;
vector<int> par, lef, rig;
template <class T> void build(int n_, T *as) {
assert(n_ >= 1);
n = n_;
rt = 0;
par.assign(n, -1);
lef.assign(n, -1);
rig.assign(n, -1);
int top = 0;
vector<int> stack(n, 0);
for (int u = 1; u < n; ++u) {
if (as[stack[top]] > as[u]) { // >
for (; top >= 1 && as[stack[top - 1]] > as[u]; --top) {} // >
if (top == 0) {
rt = par[lef[u] = stack[top]] = u;
} else {
par[lef[u] = stack[top]] = u;
rig[par[u] = stack[top - 1]] = u;
}
stack[top] = u;
} else {
rig[par[u] = stack[top]] = u;
stack[++top] = u;
}
}
}
template <class T> void build(const T &as) {
build(as.size(), as.data());
}
};
char buf[100'010];
int N;
//vector<string> S;
vector<vector<int>> S;
int Q;
vector<Int> X;
vector<pair<int, pair<int, int>>> ans;
vector<int> cat;
vector<int> is, js;
SuffixArray sa;
vector<int> hs;
MinCartesianTree ct;
int cur;
Int now;
void dfs(int u, int l, int r, int d) {
// cerr<<"dfs "<<u<<" "<<l<<" "<<r<<" "<<d<<": now = "<<now<<endl;
const int i = is[sa.us[l]];
const int j = js[sa.us[l]];
Int here;
if (r - l == 1) {
here = (int)S[i].size() - j - d;
} else {
here = (Int)(r - l) * (hs[u] - d);
}
for (; cur < Q && X[cur] < now + here; ++cur) {
const Int quo = (X[cur] - now) / (r - l);
ans[cur] = make_pair(i, make_pair(j, j + d + 1 + quo));
}
now += here;
if (r - l == 1) {
} else {
dfs(ct.lef[u], l, u + 1, hs[u]);
dfs(ct.rig[u], u + 1, r, hs[u]);
}
}
int main() {
for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
N = 1;
S.resize(N);
Q = 1;
X.resize(Q);
{
int len;
scanf("%d%lld", &len, &X[0]);
S[0].resize(len);
for (int i = 0; i < len; ++i) {
scanf("%d", &S[0][i]);
}
--X[0];
}
cat.clear();
is.clear();
js.clear();
for (int i = 0; i < N; ++i) {
for (int j = 0; j < (int)S[i].size(); ++j) {
cat.push_back(S[i][j]);
is.push_back(i);
js.push_back(j);
}
cat.push_back(~i);
is.push_back(i);
js.push_back(S[i].size());
}
sa = SuffixArray(cat, true);
hs.resize(sa.n - 1);
for (int i = 0; i < sa.n - 1; ++i) {
hs[i] = sa.hs[i + 1];
}
ct.build(hs);
// for(int i=0;i<sa.n;++i)pv(cat.begin()+sa.us[i],cat.end());
// cerr<<"hs = "<<hs<<endl;
// cerr<<"sa.n = "<<sa.n<<endl;
// cerr<<"|hs| = "<<hs.size()<<endl;
ans.assign(Q, make_pair(-1, make_pair(-1, -1)));
cur = 0;
now = 0;
dfs(ct.rt, 0, sa.n, 0);
assert(cur == Q);
for (int q = 0; q < Q; ++q) {
// fprintf(stderr, "%d %d %d\n", ans[q].first + 1, ans[q].second.first + 1, ans[q].second.second);
}
int ou = 0;
for (int i = ans[0].second.first; i < ans[0].second.second; ++i) {
if (ou++) printf(" ");
printf("%d", S[0][i]);
}
puts("");
}
#ifndef LOCAL
break;
#endif
}
return 0;
}