Submission #71020

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
71020	2018-08-24 02:33:47	Diuven	Lottery (CEOI18_lot)	C++14	100 / 100	1735 ms	9132 KiB

lot

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
int n, l, q, m, A[10010], cnt[101][10010], lim, now[10010], K[101], sum[10010], tmp[20010];
vector<int> X, P[10010];
vector<pair<int, int>> Q;
int main(){
  ios::sync_with_stdio(0); cin.tie(0);
  cin>>n>>l; m=n-l+1;
  for(int i=1; i<=n; i++) cin>>A[i], X.push_back(A[i]);
  cin>>q; for(int i=1; i<=q; i++) cin>>K[i], Q.push_back({K[i], i});
  sort(Q.begin(), Q.end());
  sort(X.begin(), X.end());
  lim=unique(X.begin(), X.end())-X.begin();
  X.resize(lim);
  for(int i=1; i<=n; i++) A[i]=lower_bound(X.begin(), X.end(), A[i])-X.begin();
  for(int i=1; i<=n; i++) P[A[i]].push_back(i);
  for(int i=1, lft=1, rig=0; i<=m; i++){
    while(rig+1<i+l){
      rig++;
//      cout<<"IN: "<<rig<<'\n';
      for(int j=1; j<=n; j++)
        if(A[j]==A[rig])
          tmp[j-rig+10000]++;
    }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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