Submission #1205754

#	Time	Username	Problem	Language	Result	Execution time	Memory
1205754		asli_bg	Lottery (CEOI18_lot)	C++20	45 / 100	3096 ms	9592 KiB

lot

#include <bits/stdc++.h>
using namespace std;
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;

#define int long long
 
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef vector<bool> vb;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef vector<pll> vll;
 
typedef tree<pii,null_type,less<pii>,rb_tree_tag,
tree_order_statistics_node_update> oset;
 
#define fi first
#define se second
#define pb push_back
#define pf push_front
 
#define mid (l+r)/2
#define all(x) x.begin(),x.end()
#define FOR(i,a) for(int i=0;i<(a);i++)
#define FORE(i,a,b) for(int i=(a);i<(b);i++)
 
#define cont(x) for(auto el:x) cout<<el<<' ';cout<<endl;
#define contp(x) for(auto el:x) cout<<el.fi<<'-'<<el.se<<' ';cout<<endl;
#define sp <<" "<<
 
#define DEBUG(x) cout<<(#x) sp x<<endl
#define carp(a,b) (((a%MOD)*(b%MOD))%MOD)
#define topla(a,b) (((a%MOD)+(b%MOD))%MOD)
 
const ll INF=1e18;
const int MAXN=1e5+5;
const int MAXK=30;
const int MOD=1e9+7;

map<int,int> pref[MAXN];

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

    int n,l;
    cin>>n>>l;
    vi a(n+1);
    FORE(i,1,n+1) cin>>a[i];
    
    FORE(i,1,n+1){
        if(i+l-1>n) break;
        FORE(j,i+1,n+1){
            if(j+l-1>n) break;
            int say=0;
            FOR(k,l){
                if(a[i+k]!=a[j+k]) say++;
            }

            pref[i][say]++;
            pref[j][say]++;
        }
    }

    FORE(i,1,n+1){
        int once=0;
        for(auto el:pref[i]){
            pref[i][el.fi]+=once;
            once=pref[i][el.fi];
        }
    }
    
    int q;
    cin>>q;
    while(q--){
        int k;
        cin>>k;
        FORE(i,1,n-l+2){
            auto it=pref[i].upper_bound(k);
            if(it!=pref[i].begin()){
                it--;
                //cout<<"it" sp it->fi sp it->se<<endl;
                cout<<pref[i][it->fi]<<' ';
            }
            else cout<<0<<' ';
        }
        cout<<endl;
    }
}

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