제출 #598550

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
598550		jiahng	Lottery (CEOI18_lot)	C++14	0 / 100	86 ms	65536 KiB

lot

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
#define ll int
typedef pair<int,int> pi;
typedef vector <int> vi;
typedef vector <pi> vpi;
typedef pair<pi, ll> pii;
typedef set <ll> si;
typedef long double ld;
#define f first
#define s second
#define mp make_pair
#define FOR(i,s,e) for(int i=s;i<=int(e);++i)
#define DEC(i,s,e) for(int i=s;i>=int(e);--i)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define lbd(x, y) lower_bound(all(x), y)
#define ubd(x, y) upper_bound(all(x), y)
#define aFOR(i,x) for (auto i: x)
#define mem(x,i) memset(x,i,sizeof x)
#define fast ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define maxn 10001
#define INF (ll)(1e9+10)
#define MOD 1000000007
typedef pair <vi, int> pvi;
typedef pair <int,pi> ipi;
typedef vector <pii> vpii;
typedef pair <pi,pi> pipi;
int N,L,A[maxn];
vi occ[maxn];
//vpi num[maxn];
int Q,k;
int32_t main(){
    fast;
    cin >> N >> L;
    FOR(i,1,N) cin >> A[i];
    
    FOR(i,2,N+1-L){
       int cur = 0;
       FOR(j,1,L) cur += (A[j] != A[i+j-1]);
       FOR(j,0,N+1-L-i){
            occ[j+1].pb(cur); occ[i+j].pb(cur);
            //cout << i+j << ' ' << j+1  << ' ' << cur << '\n';
            cur -= A[j+1] != A[j+i];
            cur += A[j+1+L] != A[j+i+L];
        }
    }
    
    cin >> Q;
    FOR(i,1,Q){
        cin >> k;
        FOR(j,1,N+1-L){
            cout << upper_bound(all(occ[j]), k) - occ[j].begin() << ' ';
        }
        cout << '\n';
    }
}

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