Submission #960429

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
960429	2024-04-10 12:51:01	vjudge1	Lottery (CEOI18_lot)	C++14	100 / 100	327 ms	8656 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;
const int N=1e4+10, Q=110;
int n, l, q, a[N];
int cnt[N][Q];
int qq[Q];
int mp[N];
int32_t main(){
   ios_base::sync_with_stdio(false);
   cin.tie(nullptr);
   cin >> n >> l;
   for (int i=1; i<=n; ++i) cin >> a[i];
   cin >> q;
   vector<int> vals{-1};
   for (int i=1; i<=q; ++i) cin >> qq[i], vals.push_back(qq[i]);
   sort(vals.begin(), vals.end());
   for (int i=0, j=1; i<=n; ++i){
      while (j<=q && i>vals[j]) ++j;
      mp[i]=j;
   }
   for (int d=1; d<=n; ++d){
      int cur=0;
      for (int l1=1, r1=l, l2=l1+d, r2=r1+d; r2<=n; ++l1, ++r1, ++l2, ++r2){
         if (l1==1){
            for (int j=1; j<=l; ++j) cur+=a[l1+j-1]!=a[l2+j-1];
         }else{
            cur-=a[l1-1]!=a[l2-1];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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