結果

問題 No.3188 K-th Lexmin
コンテスト
ユーザー _yes
提出日時 2025-11-15 20:37:43
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 8,075 bytes
コンパイル時間 3,356 ms
コンパイル使用メモリ 295,200 KB
実行使用メモリ 17,904 KB
最終ジャッジ日時 2025-11-15 20:37:57
合計ジャッジ時間 13,083 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other WA * 1 TLE * 1 -- * 45
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i< (n); ++i)
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define all(x) (x).begin(), (x).end()
#define fore(i, a) for(auto &i:a)
using ll = long long;
using int64 = long long;
#define DEBUG(x) cerr << #x << ": "; for (auto _ : x) cerr << _ << " "; cerr << endl;
const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
	IoSetup() {
		cin.tie(nullptr);
		ios::sync_with_stdio(false);
		cout << fixed << setprecision(10);
		cerr << fixed << setprecision(10);
	}
} iosetup;

template <typename T1, typename T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& p) {
	os << p.first << " " << p.second;
	return os;
}

template <typename T1, typename T2>
istream& operator>>(istream& is, pair<T1, T2>& p) {
	is >> p.first >> p.second;
	return is;
}

template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
	for (int i = 0; i < (int)v.size(); i++) {
		os << v[i] << (i + 1 != v.size() ? " " : "");
	}
	return os;
}

template <typename T>
istream& operator>>(istream& is, vector<T>& v) {
	for (T& in : v) is >> in;
	return is;
}

template <typename T1, typename T2>
inline bool chmax(T1& a, T2 b) {
	return a < b && (a = b, true);
}

template <typename T1, typename T2>
inline bool chmin(T1& a, T2 b) {
	return a > b && (a = b, true);
}

template <typename T = int64>
vector<T> make_v(size_t a) {
	return vector<T>(a);
}

template <typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
	return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}

template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T& t, const V& v) {
	t = v;
}

template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T& t, const V& v) {
	for (auto& e : t) fill_v(e, v);
}

template <typename F>
struct FixPoint : F {
	explicit FixPoint(F&& f) : F(std::forward<F>(f)) {}

	template <typename... Args>
		decltype(auto) operator()(Args&&... args) const {
			return F::operator()(*this, std::forward<Args>(args)...);
		}
};

template <typename F>
inline decltype(auto) MFP(F&& f) {
	return FixPoint<F>{std::forward<F>(f)};
}

template <typename T>
struct SuffixArray : vector<int> {
 private:
  vector<int> sa_is(const vector<int>& s) const {
    const int n = (int)s.size();
    vector<int> ret(n);

    vector<int> is_s(n), is_lms(n);
    int m = 0;
    for (int i = n - 2; i >= 0; i--) {
      is_s[i] = (s[i] > s[i + 1]) or (s[i] == s[i + 1] and is_s[i + 1]);
      m += (is_lms[i + 1] = is_s[i] and not is_s[i + 1]);
    }

    auto induced_sort = [&](const vector<int>& lms) {
      int upper = *max_element(s.begin(), s.end());
      vector<int> l(upper + 2), r(upper + 2);
      for (auto&& v : s) {
        ++l[v + 1];
        ++r[v];
      }
      partial_sum(l.begin(), l.end(), l.begin());
      partial_sum(r.begin(), r.end(), r.begin());
      fill(ret.begin(), ret.end(), -1);
      for (int i = (int)lms.size() - 1; i >= 0; i--) {
        ret[--r[s[lms[i]]]] = lms[i];
      }
      for (auto&& v : ret) {
        if (v >= 1 and is_s[v - 1]) ret[l[s[v - 1]]++] = v - 1;
      }
      fill(r.begin(), r.end(), 0);
      for (auto&& v : s) ++r[v];
      partial_sum(r.begin(), r.end(), r.begin());
      for (int k = (int)ret.size() - 1, i = ret[k]; k >= 1; i = ret[--k]) {
        if (i >= 1 and not is_s[i - 1]) {
          ret[--r[s[i - 1]]] = i - 1;
        }
      }
    };

    vector<int> lms;
    lms.reserve(m);
    for (int i = 1; i < n; i++) {
      if (is_lms[i]) lms.push_back(i);
    }

    induced_sort(lms);

    vector<int> new_lms;
    new_lms.reserve(m);
    for (int i = 0; i < n; i++) {
      if (not is_s[ret[i]] and ret[i] > 0 and is_s[ret[i] - 1]) {
        new_lms.push_back(ret[i]);
      }
    }

    auto is_same = [&](int a, int b) {
      if (s[a++] != s[b++]) return false;
      for (;; ++a, ++b) {
        if (s[a] != s[b]) return false;
        if (is_lms[a] or is_lms[b]) return is_lms[a] and is_lms[b];
      }
    };

    int rank = 0;
    ret[n - 1] = 0;
    for (int i = 1; i < m; i++) {
      if (not is_same(new_lms[i - 1], new_lms[i])) ++rank;
      ret[new_lms[i]] = rank;
    }

    if (rank + 1 < m) {
      vector<int> new_s(m);
      for (int i = 0; i < m; i++) {
        new_s[i] = ret[lms[i]];
      }
      auto lms_sa = sa_is(new_s);
      for (int i = 0; i < m; i++) {
        new_lms[i] = lms[lms_sa[i]];
      }
    }

    induced_sort(new_lms);

    return ret;
  }

 public:
  T vs;

  explicit SuffixArray(const T& vs, bool compress = false) : vs(vs) {
    vector<int> new_vs(vs.size() + 1);
    if (compress) {
      T xs = vs;
      sort(xs.begin(), xs.end());
      xs.erase(unique(xs.begin(), xs.end()), xs.end());
      for (int i = 0; i < (int)vs.size(); i++) {
        new_vs[i] =
            std::lower_bound(xs.begin(), xs.end(), vs[i]) - xs.begin() + 1;
      }
    } else {
      auto d = *min_element(vs.begin(), vs.end());
      for (int i = 0; i < (int)vs.size(); i++) {
        new_vs[i] = vs[i] - d + 1;
      }
    }
    auto ret = sa_is(new_vs);
    assign(ret.begin(), ret.end());
  }

  void output() const {
    for (int i = 0; i < size(); i++) {
      cout << i << ":[" << (*this)[i] << "]";
      for (int j = (*this)[i]; j < (int)vs.size(); j++) cout << " " << vs[j];
      cout << "\n";
    }
  }


  bool lt_substr(const T& t, int si = 0, int ti = 0) {
      int sn = (int)vs.size(), tn = (int)t.size();
      while (si < sn && ti < tn) {
        if (vs[si] < t[ti]) return true;
        if (vs[si] > t[ti]) return false;
        ++si, ++ti;
      }
      return si >= sn && ti < tn;
  }

  // t <= s[i,N) なる最小の i を返す O(|t| log |s|)
  int lower_bound(const T& t) {
    int ng = 0, ok = (int)size();
    while (ok - ng > 1) {
      int mid = (ok + ng) / 2;
      if (lt_substr(t, at(mid)))
        ng = mid;
      else
        ok = mid;
    }
    return ok;
  }

  // O(|t| log |s|)
  pair<int, int> equal_range(T& t) {
    int low = lower_bound(t);
    int ng = low - 1, ok = (int)size();
    t.back()++;
    while (ok - ng > 1) {
      int mid = (ok + ng) / 2;
      if (lt_substr(t, at(mid)))
        ng = mid;
      else
        ok = mid;
    }
    t.back()--;
    return {low, ok};
  }
};

template <>
void SuffixArray<string>::output() const {
  for (int i = 0; i < (int)size(); i++) {
    cout << i << ":[" << (*this)[i] << "] " << vs.substr((*this)[i]) << "\n";
  }
}
template <class T>
struct CumulativeSum {
	vector<T> data;

	CumulativeSum() = default;

	explicit CumulativeSum(size_t sz) : data(sz + 1, 0) {}

	void add(int k, const T& x) { data[k + 1] += x; }

	void build() {
		for (int i = 1; i < data.size(); i++) {
			data[i] += data[i - 1];
		}
	}

	T fold(int r) const {
		if (r < 0) return 0;
		return data[min(r, (int)data.size() - 1)];
	}

	T fold(int l, int r) const { return fold(r) - fold(l); }
};
template <typename T, typename F> T bisect(T ok, T bad, F pred) {
	if (!pred(ok)) {
		return ok;
	}

	while (bad - ok > 1) {
		T mid = ok + (bad - ok) / 2;
		(pred(mid) ? ok : bad) = mid;
	}
	return bad;
}
int main(){
  int t; cin >> t;
	while(t--){
		ll n, k;
		cin >> n >> k;
		vector<int> a(n);
		rep(i, n){
			cin >> a[i];
		}
		SuffixArray<vector<int>> sa(a);
		CumulativeSum<ll> c(n+1);
		rep(i, n+1){
			c.add(i, n-sa[i]);
		}
		c.build();
		vector<int> res;
		ll l = 0, r = n+1;
		rep(i, n){
			auto pr = [&](int x){
				if(c.fold(l, x+1)-i*(x-l+1) < k)return true;
				return false;
			};
			int pos = bisect(l, r, pr);
			res.push_back(a[sa[pos]+i]);
			auto[ll, rr] = sa.equal_range(res);
      k -= c.fold(l, ll);
      l = ll, r = rr;
			k -= (r-l);
			if(k <= 0){
				break;
			}
		}
		cout << res << "\n";
	}
}
0