# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
943502 | Aiperiii | Lottery (CEOI18_lot) | C++14 | 1609 ms | 12560 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define int long long
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
using namespace std;
signed main(){
ios_base::sync_with_stdio();
cin.tie(0);cout.tie(0);
int n,l,q;
cin>>n>>l;
vector <int> a(n+1);
for(int i=1;i<=n;i++)cin>>a[i];
cin>>q;
vector <int> k(q),v;
for(int i=0;i<q;i++){
cin>>k[i];
v.pb(k[i]);
}
sort(all(v));
vector <vector <int> > ans(n+1,vector <int> (q));
for(int i=1;i<=n;i++){
if(i+l-1<=n){
int res=0;
int ind=1;
for(int j=i;j<i+l;j++){
res+=(a[ind]!=a[j]);
ind++;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |