제출 #443267

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
443267		Haruto810198	Lottery (CEOI18_lot)	C++17	0 / 100	3058 ms	916 KiB

lot

#include <bits/stdc++.h>

using namespace std;

#define int long long
#define double long double

#define FOR(i, l, r, d) for(int i=(l); i<=(r); i+=(d))
#define szof(x) ((int)(x).size())

#define vi vector<int>
#define pii pair<int, int>

#define F first
#define S second

#define pb push_back
#define eb emplace_back
#define mkp make_pair

const int INF = 2147483647;
const int LNF = INF*INF;
const int MOD = 1000000007;
const int mod = 998244353;
const double eps = 1e-12;

const int MAX = 10010;

int n, len;
int arr[MAX];

int q, sim;
int res[MAX];

vi KMP(vi str){

    int l = szof(str);
    vi ret(l);

    ret[0] = -1;
    int pos = -1;

    FOR(i, 1, l-1, 1){

        while(pos != -1 and str[pos+1] != str[i]){
            pos = ret[pos];
        }

        if(str[pos+1] == str[i]){
            pos++;
        }

        ret[i] = pos;

    }

    return ret;

}

signed main(){

    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    cin>>n>>len;
    FOR(i, 0, n-1, 1){
        cin>>arr[i];
    }

    cin>>q;
    while(q--){

        cin>>sim;

        FOR(i, 0, n-1, 1){

            vi sstr(arr+i, arr+n);
            vi kmp = KMP(sstr);

            bool valid[MAX];
            FOR(i, 0, n-1, 1){
                valid[i] = 0;
            }

            FOR(j, i+1, n-len, 1){

                int K = kmp[j - i + len - 1];
                int tmp = K;
                while(tmp > len-1){
                    if(valid[tmp]){
                        tmp = len-1;
                        break;
                    }
                    tmp = kmp[tmp];
                }

                if(tmp == len-1){
                    res[i]++;
                    res[j]++;
                    //cerr<<"("<<i<<", "<<j<<") "<<endl;
                    valid[K] = 1;
                }
            }

            /*
            cerr<<"kmp("<<i<<") : ";
            for(int i : kmp){
                cerr<<i<<" ";
            }
            cerr<<endl;
            */

        }

        FOR(i, 0, n-len, 1){
            cout<<res[i]<<" ";
        }
        cout<<'\n';

    }

    return 0;

}

• Subtask 1: 0 / 25
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20