제출 #525421

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
525421		ammar2000	Lottery (CEOI18_lot)	C++17	0 / 100	196 ms	65540 KiB

lot

#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define F first
#define S second
#define coy cout<<"YES\n"
#define con cout<<"NO\n"
#define co1 cout<<"-1\n"
#define sc(x) scanf("%lld",&x)
#define all(x) x.begin(),x.end()
#define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
const int SI=3e5+7;
ll INF=8e18+7;
int dx[] = {1 , -1 , 0 , 0};
int dy[] = {0 , 0 , 1 , -1};
int MOD=1e9+7;
ll n,a[SI],Q,l,k;
map <queue<ll> ,ll> mp;
queue <ll> q;
int main()
{
   fast
   cin>>n>>l;
   for (int i=0;i<n;i++)
    cin>>a[i];
   for (int i=0;i<l;i++)
    q.push(a[i]);
   mp[q]++;
   for (int i=l;i<n;i++)
   {
     q.pop();
     q.push(a[i]);
     mp[q]++;
   }
   cin>>Q>>Q;
   while (q.size())
        q.pop();
   for (int i=0;i<l;i++)
    q.push(a[i]);
   cout << mp[q]-1<<" ";
   for (int i=l;i<n;i++)
   {
     q.pop();
     q.push(a[i]);
     //mp[q]++;
   cout << mp[q]-1<<" ";
   }
   // use scanf not cin
   return 0;
}

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