Submission #835234

#	Time	Username	Problem	Language	Result	Execution time	Memory
835234		GrindMachine	Lottery (CEOI18_lot)	C++17	0 / 100	2 ms	1748 KiB

lot

// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

void solve(int test_case)
{
    int n,l; cin >> n >> l;
    vector<int> a(n);
    rep(i,n) cin >> a[i];

    int q; cin >> q;
    vector<int> queries(q);
    rep(i,q) cin >> queries[i];
        
    auto b = queries;
    sort(all(b));
    b.resize(unique(all(b))-b.begin());
    int siz = sz(b);

    vector<int> nxt(l+1,inf1);
    rep(i,siz) nxt[b[i]] = i;
    rev(i,l-1,0) amin(nxt[i],nxt[i+1]);

    vector<vector<int>> pref(n,vector<int>(siz));
    vector<int> dp(n+1);

    rep1(d,n){
        // d = j-i
        fill(all(dp),0);

        rev(i,n-d-1,0){
            int j = i+d;
            dp[i] = (a[i]!=a[j]) + dp[i+1];
        }

        rep(i,n-d){
            int j = i+d;
            if(j+l-1 >= n) break;

            int k = dp[i]-dp[i+l];
            int ck = nxt[k];
            pref[i][ck]++;
            pref[j][ck]++;            
        }
    }

    rep(i,n){
        rep1(j,siz-1){
            pref[i][j] += pref[i][j-1];
        }
    }

    rep(id,q){
        int k = queries[id];
        int ck = nxt[k];
        rep(i,n){
            if(i+l-1 >= n) break;
            int ans = pref[i][ck];
            cout << ans << " ";
        }
        cout << endl;
    }
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

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