結果
| 問題 |
No.3223 K-XOR Increasing Sequence
|
| ユーザー |
 hitonanode
|
| 提出日時 | 2025-08-01 22:36:40 |
| 言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 465 ms / 2,000 ms |
| コード長 | 10,787 bytes |
| コンパイル時間 | 2,374 ms |
| コンパイル使用メモリ | 227,352 KB |
| 実行使用メモリ | 19,488 KB |
| 最終ジャッジ日時 | 2025-08-01 22:37:01 |
| 合計ジャッジ時間 | 15,749 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 70 |
ソースコード
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <optional>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }
template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }
const std::vector<std::pair<int, int>> grid_dxs{{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <class T1, class T2> T1 floor_div(T1 num, T2 den) { return (num > 0 ? num / den : -((-num + den - 1) / den)); }
template <class T1, class T2> std::pair<T1, T2> operator+(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first + r.first, l.second + r.second); }
template <class T1, class T2> std::pair<T1, T2> operator-(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first - r.first, l.second - r.second); }
template <class T> std::vector<T> sort_unique(std::vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <class T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }
template <class T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }
template <class IStream, class T> IStream &operator>>(IStream &is, std::vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec);
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr);
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const pair<T, U> &pa);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa);
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp);
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp);
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
template <class... T> std::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; }
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl
#define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl : std::cerr)
#else
#define dbg(x) ((void)0)
#define dbgif(cond, x) ((void)0)
#endif
void Yes(const vector<int> &A) {
cout << "Yes\n";
REP(i, A.size()) cout << A.at(i) << (i + 1 < (int)A.size() ? ' ' : '\n');
exit(0);
}
bool validate(int K, const vector<int> &A, int X, int Y) {
if (A.front() != X) return false;
if (A.back() != Y) return false;
const int N = A.size();
vector<int> cs(N + 1);
REP(i, N) cs.at(i + 1) = cs.at(i) ^ A.at(i);
FOR(i, K, N) {
auto prv = cs.at(i) ^ cs.at(i - K);
if (prv >= A.at(i)) {
dbg(make_tuple(i, prv, A));
return false;
}
}
return true;
}
vector<int> greedy_build(int n, int k) {
vector<int> ret(k, 0);
vector<int> csret(k + 1, 0);
while ((int)ret.size() < n) {
// int cs = 0;
// REP(i, k) cs ^= ret.at(ret.size() - 1 - i);
const int cs = csret.at(csret.size() - 1) ^ csret.at(csret.size() - 1 - k);
// int nxt_cs = 0;
// REP(i, k - 1) nxt_cs ^= ret.at(ret.size() - 1 - i);
const int nxt_cs = csret.at(csret.size() - 1) ^ csret.at(csret.size() - 1 - k + 1);
int best_eval = 1 << 30;
int best = -1;
FOR(v, cs + 1, (cs + 100) * 4) {
if (chmin(best_eval, nxt_cs ^ v)) { best = v; }
}
ret.push_back(best);
csret.push_back(csret.back() ^ best);
}
return ret;
}
vector<int> solve(int N, int K, int X, int Y) {
if (Y == 0) return {};
if (K == 1) {
vector<int> ret(N);
REP(i, N) ret.at(i) = X + i;
if (ret.back() <= Y) {
ret.back() = Y;
return ret;
} else {
return {};
}
}
assert(K >= 2);
if (X) {
if (K % 2 == 0) {
vector<int> ret(N, X);
ret.back() = Y;
return ret;
} else {
assert(K >= 3);
const int n0 = X;
const int n1 = (n0 == 1 ? 2 : 1);
vector<int> C(K, n1);
C.at(0) = n0;
C.back() = n0 ^ n1;
vector<int> ret(N);
REP(i, N) {
ret.at(i) = C.at(i % C.size());
}
ret.back() = Y;
return ret;
}
} else {
if (K == N - 1) {
vector<int> ret(N);
ret.back() = Y;
return ret;
}
if (K == N - 2) {
if (Y == 1) return {};
vector<int> ret(N);
ret.at(N - 3) = 2;
ret.at(N - 2) = 3;
ret.back() = Y;
return ret;
}
if (K % 2 == 0) {
vector<int> ret(N);
FOR(i, K, N) { ret.at(i) = ((i - K) % (K + 1) == 0) ? 2 : 3; }
ret.back() = Y;
return ret;
}
if (Y >= 3) {
auto gri = greedy_build(N + K - 1, K);
gri.erase(gri.begin(), gri.begin() + K - 1);
gri.back() = Y;
return gri;
// vector<int> ret(N);
// FOR(i, K, N) ret.at(i) = ((i - K) % (K + 1) == 0 ? 1 : 3);
// ret.back() = Y;
// return ret;
}
return {};
// ret.back() = 0;
// reverse(ALL(ret));
// return ret;
}
}
#include <chrono>
#include <random>
struct rand_int_ {
using lint = long long;
std::mt19937 mt;
rand_int_() : mt(std::chrono::steady_clock::now().time_since_epoch().count()) {}
lint operator()(lint x) { return this->operator()(0, x); } // [0, x)
lint operator()(lint l, lint r) {
std::uniform_int_distribution<lint> d(l, r - 1);
return d(mt);
}
} rnd;
int main() {
dbg(greedy_build(100, 8));
while (true) {
break;
int n = rnd(2, 10);
int k = rnd(1, n);
int x = rnd(0, 16);
int y = rnd(0, 16);
auto ret = solve(n, k, x, y);
if (ret.size() and !validate(k, ret, x, y)) {
cerr << "Invalid output for n=" << n << ", k=" << k << ", x=" << x << ", y=" << y << ": " << ret << endl;
exit(1);
}
}
int N, K, X, Y;
cin >> N >> K >> X >> Y;
const auto ret = solve(N, K, X, Y);
if (ret.empty()) {
puts("No");
} else {
Yes(ret);
}
}