제출 #482366

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
482366		Blistering_Barnacles	Lottery (CEOI18_lot)	C++11	0 / 100	191 ms	65540 KiB

lot

//apig's property
//Happiness can be found, even in the darkest of times, if one only remembers to turn on the light
//El Pueblo Unido Jamas Sera Vencido
//Do or do not... there is no try
//Billions of bilious blue blistering barnacles in a thundering typhoon!
#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0)
#define F first
#define S second
#define pb push_back
#define vll vector< ll >
#define vi vector< int >
#define pll pair< ll , ll >
#define pi pair< int , int >
#define all(s) s.begin() , s.end()
#define sz(s) s.size()
#define str string
#define md ((s + e) / 2)
#define mid ((l + r) / 2)
#define msdp(dp) memset(dp , -1 , sizeof dp)
#define mscl(dp) memset(dp , 0 , sizeof dp)
#define C continue
#define R return
#define B break
#define lx node * 2
#define rx node * 2 + 1
#define br(o) o ; break
#define co(o) o ; continue
using namespace std;
typedef int ll;
map < vll , ll > mp ;
ll q,b[100005] ,  a[100005] , k, l, m, n, o, p;
void solve(){
    cin >> n >> l ;
    for(ll i = 1 ; i <= n ; i++){
        cin >> a[i] ;
    }
    for(ll i = 1 ; i <= n - l + 1 ; i++){
        vll v ;
        for(ll j = i ; j <= i + l - 1 ; j++){
            v.pb(a[j]) ;
        }
        mp[v]++ ;
    }
    for(ll i = 1 ; i <= n - l + 1 ; i++){
        vll v ;
        for(ll j = i ; j <= i + l - 1 ; j++){
            v.pb(a[j]) ;
        }
        b[i] = mp[v] - 1 ;
    }
    cin >> o >> k ;
    for(ll i = 1 ; i <= n - l + 1 ; i++){
        cout << b[i] << " " ;
    }
}
int main(){
    fast ;
    q = 1 ;
    //cin >> q ;
    while(q--){
        solve() ;
    }
}

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