제출 #482370

#제출 시각아이디문제언어결과실행 시간메모리
482370Blistering_BarnaclesLottery (CEOI18_lot)C++11
0 / 100
461 ms49120 KiB
//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 < vector < short > , ll > mp ; map < ll , ll > pp ; ll q, a[10005] , k, l, m, n, o, p; void solve(){ cin >> n >> l ; set < ll > se; for(ll i = 1 ; i <= n ; i++){ cin >> a[i] ; se.insert(a[i]) ; } for(auto u : se){ pp[u] = ++m ; } for(ll i = 1 ; i <= n ; i++){ a[i] = pp[a[i]] ; } pp.clear() , se.clear() ; for(ll i = 1 ; i <= n - l + 1 ; i++){ vector < short > v ; for(ll j = i ; j <= i + l - 1 ; j++){ v.pb(a[j]) ; } mp[v]++ ; } cin >> o >> k ; for(ll i = 1 ; i <= n - l + 1 ; i++){ vector < short > v ; for(ll j = i ; j <= i + l - 1 ; j++){ v.pb(a[j]) ; } cout << mp[v] - 1 << " " ; } } int main(){ fast ; q = 1 ; //cin >> q ; while(q--){ solve() ; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...