結果
問題 | No.1770 N言っちゃダメゲーム (6) |
ユーザー |
|
提出日時 | 2021-12-08 19:06:57 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 92 ms / 2,000 ms |
コード長 | 7,984 bytes |
コンパイル時間 | 2,156 ms |
コンパイル使用メモリ | 204,292 KB |
最終ジャッジ日時 | 2025-01-26 06:55:18 |
ジャッジサーバーID (参考情報) |
judge4 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 44 |
ソースコード
/*** author: otera* created: 08.12.2021 11:22:51**/#include<bits/stdc++.h>#include<atcoder/lazysegtree>using namespace std;using ll = long long;using ld = long double;using ull = unsigned long long;using uint = unsigned;#define repa(i, n) for(int i = 0; i < n; ++ i)#define repb(i, a, b) for(int i = a; i < b; ++ i)#define repc(i, a, b, c) for(int i = a; i < b; i += c)#define overload4(a, b, c, d, e, ...) e#define rep(...) overload4(__VA_ARGS__, repc, repb, repa)(__VA_ARGS__)#define rep1a(i, n) for(int i = 0; i <= n; ++ i)#define rep1b(i, a, b) for(int i = a; i <= b; ++ i)#define rep1c(i, a, b, c) for(int i = a; i <= b; i += c)#define rep1(...) overload4(__VA_ARGS__, rep1c, rep1b, rep1a)(__VA_ARGS__)#define per(i,n) for(int i=n-1;i>=0;i--)#define per1(i,n) for(int i=n;i>=1;i--)typedef pair<int, int> P;typedef pair<ll, ll> LP;#define pb push_back#define eb emplace_back#define fr first#define sc second#define all(c) c.begin(),c.end()#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 Sort(a) sort(all(a))#define Rev(a) reverse(all(a))#define Uniq(a) sort(all(a));a.erase(unique(all(a)),end(a))#define si(c) (int)(c).size()inline ll popcnt(ull a){ return __builtin_popcountll(a); }#define tpow(n) (1LL<<(n))#define unless(A) if(!(A))ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }ll intpow(ll a, ll b, ll m) {ll ans = 1; while(b){ if(b & 1) (ans *= a) %= m; (a *= a) %= m; b /= 2; } return ans; }template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)#define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__)#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)#define LD(...) ld __VA_ARGS__;in(__VA_ARGS__)#define vec(type,name,...) vector<type>name(__VA_ARGS__)#define VEC(type,name,size) vector<type>name(size);in(name)#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))#define VV(type,name,h,w) vector<vector<type>>name(h,vector<type>(w));in(name)#define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))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 pq = priority_queue<T>;template <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;template<class T> void scan(T& a){ cin >> a; }template<class T> void scan(vector<T>& a){ for(auto&& i : a) scan(i); }void in(){}template <class Head, class... Tail> void in(Head& head, Tail&... tail){ scan(head); in(tail...); }void print(){ cout << ' '; }template<class T> void print(const T& a){ cout << a; }template<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ cout << ' '; print(*i); } }int out(){ cout << '\n'; return 0; }template<class T> int out(const T& t){ print(t); cout << '\n'; return 0; }template<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); cout << ' '; out(tail...); return 0; }#define CHOOSE(a) CHOOSE2 a#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x#define debug_1(x1) cout<<#x1<<": "<<x1<<endl#define debug_2(x1,x2) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<endl#define debug_3(x1,x2,x3) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<endl#define debug_4(x1,x2,x3,x4) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<", "#x4<<": "<<x4<<endl#define debug_5(x1,x2,x3,x4,x5) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<", "#x4<<": "<<x4<<", "#x5<<": "<<x5<<endl#ifdef DEBUG#define debug(...) CHOOSE((__VA_ARGS__,debug_5,debug_4,debug_3,debug_2,debug_1,~))(__VA_ARGS__)#define dump(...) { print(#__VA_ARGS__); print(":"); out(__VA_ARGS__); }#else#define debug(...)#define dump(...)#endiftemplate <class Abel> struct BIT {Abel UNITY_SUM = 0;vector<Abel> dat[2];// [0, n)BIT(int n, Abel unity = 0) : UNITY_SUM(unity) {init(n);}void init(int n) {for (int iter = 0; iter < 2; ++iter)dat[iter].assign(n + 1, UNITY_SUM);}// [a, b), a and b are 0-indexedinline void sub_add(int p, int a, Abel x) {for (int i = a; i < (int)dat[p].size(); i |= i + 1)dat[p][i] = dat[p][i] + x;}inline void add(int a, int b, Abel x) {sub_add(0, a, x * (-a));sub_add(1, a, x);sub_add(0, b, x * b);sub_add(1, b, x * (-1));}// [a, b), a and b are 0-indexedinline Abel sub_sum(int p, int a) {Abel res = UNITY_SUM;for (int i = a - 1; i >= 0; i = (i & (i + 1)) - 1)res = res + dat[p][i];return res;}inline Abel sum(int a, int b) {return sub_sum(0, b)+ sub_sum(1, b) * b- sub_sum(0, a)- sub_sum(1, a) * a;}// debugvoid print() {for (int i = 0; i < (int)dat[0].size(); ++i)cout << sum(i, i + 1) << ",";cout << endl;}};using S = int;using F = int;const S INF = 8e8;const F ID = 8e8;S op(S a, S b){ return std::max(a, b); }S e(){ return -INF; }S mapping(F f, S x){ return (f == ID ? x : f); }F composition(F f, F g){ return (f == ID ? g : f); }F id(){ return ID; }void solve() {INT(n, k);// DP: O(NK^2)// {// map<P, bool> memo;// auto dfs = [&](auto&&dfs, int num, int pre) -> bool {// P key = {num, pre};// if(memo.count(key)) return memo[key];// bool res = 0;// if(num <= 0) return true;// for(int i = 1; i <= k; ++ i) {// if(i == pre) continue;// if(num - i <= 0) continue;// else if(not dfs(dfs, num - i, i)) res |= 1;// }// return memo[key] = res;// };// for(int i = 0; i <= k; ++ i) {// for(int j = 0; j <= n; ++ j) {// cout << dfs(dfs, j, i) << " ";// }// cout << endl;// }// }{BIT<int> bit(n + k + 1);vc<int> v(n + k + 1, -1);vc<int> ks(n + 1, -1);atcoder::lazy_segtree<S, op, e, F, mapping, composition, id> seg(v);vc<bool> win(n + 1, 0);win[0] = 1;for(int i = 1; i <= n; ++ i) {int sum = bit.sum(i, i + 1);if(sum == 0) {// loseks[i] = ID;bit.add(i + 1, i + k + 1, 1);seg.apply(i + 1, i + k + 1, i);} else if(sum == 1) {win[i] = 1;int id = seg.get(i);ks[i] = i - id;assert(id != -1);bit.add(i + ks[i], i + ks[i] + 1, 1);seg.apply(i + ks[i], i + ks[i] + 1, i);} else {// winwin[i] = 1;}debug(i, ks[i]);}if(!win[n]) out(0);else {vc<int> ans;for(int j = n - 1; j >= n - k and j >= 0; -- j) {debug(j, ks[j]);if(ks[j] == ID or j + ks[j] == n) {ans.eb(n - j);}}for(int x: ans) {out(x);}}}}signed main() {ios::sync_with_stdio(false);cin.tie(0);// cout << fixed << setprecision(20);// INT(t); rep(i, t)solve();solve();return 0;}