結果

問題 No.1313 N言っちゃダメゲーム (4)
ユーザー rniyarniya
提出日時 2020-12-10 00:31:11
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 60 ms / 2,000 ms
コード長 5,222 bytes
コンパイル時間 2,938 ms
コンパイル使用メモリ 204,572 KB
実行使用メモリ 5,972 KB
最終ジャッジ日時 2023-10-19 10:49:38
合計ジャッジ時間 3,919 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge12
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,348 KB
testcase_01 AC 2 ms
4,348 KB
testcase_02 AC 2 ms
4,348 KB
testcase_03 AC 2 ms
4,348 KB
testcase_04 AC 2 ms
4,348 KB
testcase_05 AC 2 ms
4,348 KB
testcase_06 AC 2 ms
4,348 KB
testcase_07 AC 2 ms
4,348 KB
testcase_08 AC 2 ms
4,348 KB
testcase_09 AC 2 ms
4,348 KB
testcase_10 AC 2 ms
4,348 KB
testcase_11 AC 2 ms
4,348 KB
testcase_12 AC 2 ms
4,348 KB
testcase_13 AC 5 ms
5,972 KB
testcase_14 AC 5 ms
5,972 KB
testcase_15 AC 60 ms
5,972 KB
testcase_16 AC 53 ms
5,180 KB
testcase_17 AC 5 ms
4,388 KB
testcase_18 AC 36 ms
4,784 KB
testcase_19 AC 32 ms
4,520 KB
testcase_20 AC 5 ms
4,348 KB
testcase_21 AC 18 ms
4,348 KB
testcase_22 AC 15 ms
4,348 KB
testcase_23 AC 17 ms
4,348 KB
testcase_24 AC 4 ms
4,348 KB
testcase_25 AC 20 ms
4,784 KB
testcase_26 AC 2 ms
4,348 KB
testcase_27 AC 8 ms
4,348 KB
testcase_28 AC 28 ms
4,588 KB
testcase_29 AC 28 ms
4,620 KB
testcase_30 AC 31 ms
5,180 KB
testcase_31 AC 28 ms
4,640 KB
testcase_32 AC 33 ms
5,180 KB
testcase_33 AC 4 ms
4,588 KB
testcase_34 AC 4 ms
4,388 KB
testcase_35 AC 5 ms
5,708 KB
testcase_36 AC 4 ms
4,732 KB
testcase_37 AC 4 ms
4,916 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
const long long MOD=1000000007;
// const long long MOD=998244353;
#define LOCAL
#pragma region Macros
typedef long long ll;
typedef __int128_t i128;
typedef unsigned int uint;
typedef unsigned long long ull;
#define ALL(x) (x).begin(),(x).end()
const int INF=1e9;
const long long IINF=1e18;
const int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
const char dir[4]={'D','R','U','L'};

template<typename T>
istream &operator>>(istream &is,vector<T> &v){
    for (T &x:v) is >> x;
    return is;
}
template<typename T>
ostream &operator<<(ostream &os,const vector<T> &v){
    for (int i=0;i<v.size();++i){
        os << v[i] << (i+1==v.size()?"": " ");
    }
    return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const pair<T,U> &p){
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template<typename T,typename U,typename V>
ostream&operator<<(ostream &os,const tuple<T,U,V> &t){
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')';
    return os;
}
template<typename T,typename U,typename V,typename W>
ostream&operator<<(ostream &os,const tuple<T,U,V,W> &t){
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')';
    return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const map<T,U> &m){
    os << '{';
    for (auto itr=m.begin();itr!=m.end();){
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr!=m.end()) os << ',';
    }
    os << '}';
    return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const unordered_map<T,U> &m){
    os << '{';
    for (auto itr=m.begin();itr!=m.end();){
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr!=m.end()) os << ',';
    }
    os << '}';
    return os;
}
template<typename T>
ostream &operator<<(ostream &os,const set<T> &s){
    os << '{';
    for (auto itr=s.begin();itr!=s.end();){
        os << *itr;
        if (++itr!=s.end()) os << ',';
    }
    os << '}';
    return os;
}
template<typename T>
ostream &operator<<(ostream &os,const multiset<T> &s){
    os << '{';
    for (auto itr=s.begin();itr!=s.end();){
        os << *itr;
        if (++itr!=s.end()) os << ',';
    }
    os << '}';
    return os;
}
template<typename T>
ostream &operator<<(ostream &os,const unordered_set<T> &s){
    os << '{';
    for (auto itr=s.begin();itr!=s.end();){
        os << *itr;
        if (++itr!=s.end()) os << ',';
    }
    os << '}';
    return os;
}
template<typename T>
ostream &operator<<(ostream &os,const deque<T> &v){
    for (int i=0;i<v.size();++i){
        os << v[i] << (i+1==v.size()?"": " ");
    }
    return os;
}

void debug_out(){cerr << '\n';}
template<class Head,class... Tail>
void debug_out(Head&& head,Tail&&... tail){
    cerr << head;
    if (sizeof...(Tail)>0) cerr << ", ";
    debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...) cerr << " ";\
cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n';\
cerr << " ";\
debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

template<typename T> T gcd(T x,T y){return y!=0?gcd(y,x%y):x;}
template<typename T> T lcm(T x,T y){return x/gcd(x,y)*y;}

template<class T1,class T2> inline bool chmin(T1 &a,T2 b){
    if (a>b){a=b; return true;} return false;
}
template<class T1,class T2> inline bool chmax(T1 &a,T2 b){
    if (a<b){a=b; return true;} return false;
}
#pragma endregion

template<typename T>
class BinaryIndexedTree{
    T sum(int i){
        T res=T();
        for (;i>0;i-=(i&-i)) res+=dat[i];
        return res;
    }
public:
    int n;
    vector<T> dat;
    BinaryIndexedTree(int n_):n(n_+1),dat(n+1,0){}
    void add(int i,const T &x){
        for (++i;i<=n;i+=(i&-i)) dat[i]+=x;
    }
    T query(int l,int r){return sum(r)-sum(l);}
    int lower_bound(T x) const {
        if (x<=0) return 0;
        int pos=0,k=1;
        while (k<n) k<<=1;
        for (;k>0;k>>=1){
            if (pos+k<=n&&dat[pos+k]<x){
                x-=dat[pos+k]; pos+=k;
            }
        }
        return pos;
    }
    int upper_bound(T x) const {return lower_bound(x+1);}
    T operator[](int i){return query(i,i+1);}
};

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N,K; string S; cin >> N >> K >> S;

    vector<int> dp(N+1,-1);
    dp[N]=1;
    for (int i=0;i<N-1;++i){
        if (S[i]=='x'){
            dp[i+1]=1;
        }
    }

    vector<int> cnt(K+1,0);
    BinaryIndexedTree<int> BIT(K+1);
    auto add=[&](int i,int x){
        if (x>0){
            cnt[i]+=x;
            if (cnt[i]==1) BIT.add(i,1);
        } else {
            cnt[i]+=x;
            if (cnt[i]==0) BIT.add(i,-1);
        }
    };
    auto mex=[&](){
        int lb=-1,ub=K+1;
        while (ub-lb>1){
            int mid=(ub+lb)>>1;
            (BIT.query(0,mid)==mid?lb:ub)=mid;
        }
        return lb;
    };
    for (int i=N;i>=0;--i){
        if (dp[i]<0) dp[i]=mex();
        add(dp[i],1);
        if (i+K<=N) add(dp[i+K],-1);
    }

    if (!dp[0]){
        cout << 0 << '\n';
        return 0;
    }
    for (int i=1;i<=K;++i){
        if (!dp[i]){
            cout << i << '\n';
        }
    }
}
0