Submission #868131

#	Time	Username	Problem	Language	Result	Execution time	Memory
868131		Cookie	Lottery (CEOI18_lot)	C++14	100 / 100	1012 ms	8276 KiB

lot

#include<bits/stdc++.h>
#include<fstream>
using namespace std;
ifstream fin("HCN.INP");
ofstream fout("HCN.OUT");
#define sz(a) (int)a.size()
#define ll long long
#define pb push_back
#define forr(i, a, b) for(int i = a; i < b; i++)
#define dorr(i, a, b) for(int i = a; i >= b; i--)
#define ld long double
#define vt vector
#include<fstream>
#define fi first
#define se second
#define pll pair<ll, ll>
#define pii pair<int, int>
const ld PI = 3.14159265359;
//using u128 = __uint128_t;
//const int x[4] = {1, -1, 0, 0};
//const int y[4] = {0, 0, 1, -1};
const ll mod = 1e9 + 9;
const int mxn = 1e5 + 5, mxq = 2e5 + 5, sq = 200, mxv = 2e6 + 5;
const ll inf = 1e17 + 5;
//const int base= (1 << 18);
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
int n, l;
int a[10005], pref[105][10005], to[10005], k[105];
int res = 0, ok = 0;
void add(int diag, int row){
    int col = diag - n + row;
    if(col >= 1 && col <= n){
        ok++;
        res += (a[row] != a[col]);
    }
}
void rem(int diag, int row){
    int col = diag - n + row;
    if(col >= 1 && col <= n){
        ok--;
        res -= (a[row] != a[col]);
    }
}
signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> l;
    for(int i = 1; i <= n; i++)cin >> a[i];
    int q; cin >> q;
    vt<int>comp;
    forr(i, 0, q){
        cin >> k[i];
        comp.pb(k[i]);
    }
    sort(comp.begin(), comp.end()); comp.resize(unique(comp.begin(), comp.end()) - comp.begin());
    for(int i = 0; i <= comp[0]; i++)to[i] = 0;
    for(int i = 0; i < sz(comp) - 1; i++){
        for(int j = comp[i] + 1; j <= comp[i + 1]; j++){
            to[j] = i + 1;
        }
    }
    for(int i = comp.back() + 1; i <= l; i++){
        to[i] = sz(comp);
    }
    for(int i = 1; i <= n + n - 1; i++){
        res = ok = 0; 
        if(i == n)continue;
        for(int j = 1; j <= l; j++)add(i, j);
        if(ok == l){
            pref[to[res]][1]++;
        }
        
        for(int j = 2; j + l - 1 <= n; j++){
            rem(i, j - 1);
            add(i, j + l - 1);
            if(ok == l){
                pref[to[res]][j]++;
            }
        }
        
        
    }
    for(int i = 1; i + l - 1 <= n; i++){
        for(int j = 1; j < sz(comp); j++){
            pref[j][i] += pref[j - 1][i];
        }
    }
    for(int i = 0; i < q; i++){
        
        for(int j = 1; j + l - 1 <= n; j++){
            cout << pref[to[k[i]]][j] << " ";
        }
        cout << "\n";
    }
    return(0);
}

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