# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1059976 |
2024-08-15T09:46:39 Z |
user736482 |
Lottery (CEOI18_lot) |
C++17 |
|
6 ms |
7260 KB |
#include<bits/stdc++.h>
using namespace std;
int n,q,a,k,l;
vector<int>v,poz[1007],match[1007];//duze jedno do usuniecia
int pod[4007];
queue<pair<int,int>>dous;
int main(){
cin>>n>>l;
for(int i=0;i<n;i++){
cin>>a;
v.push_back(a);
for(int j=0;j<i;j++){
if(v[i]==v[j]){
poz[i].push_back(j);
poz[j].push_back(i);
//cout<<i<<j<<" ";
}
}
}
for(int i=0;i<l-1;i++){
for(int j=0;j<poz[i].size();j++){
pod[-i+poz[i][j]]++;
//cout<<i+poz[i][j]<<" ";
dous.push({i,poz[i][j]});
}
}
for(int i=l-1;i<n-l+1;i++){
while(!dous.empty() && i-l>=dous.front().first){
pod[-dous.front().first+dous.front().second]--;
dous.pop();
}
for(int j=0;j<poz[i].size();j++){
pod[-i+poz[i][j]]++;
//cout<<i+poz[i][j]<<" ";
dous.push({i,poz[i][j]});
}
// for(int j=l-1;j<i;j++) cout<<0<<" ";
// for(int j=i;j<n;j++)
// cout<<pod[-i+j]<<" ";
for(int j=i+1;j<n;j++){
match[i-l+1].push_back(pod[-i+j]);
match[j-1].push_back(pod[-i+j]);
}
// cout<<"\n";
}
cin>>q;
for(int i=0;i<q;i++){
cin>>k;
k=l-k;
for(int j=0;j<n-l+1;j++){
int licz=0;
for(int p=0;p<match[j].size();p++){
if(match[j][p]>=k)
licz++;}
cout<<licz<<" ";
}
cout<<"\n";
}
}
Compilation message
lot.cpp: In function 'int main()':
lot.cpp:21:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
21 | for(int j=0;j<poz[i].size();j++){
| ~^~~~~~~~~~~~~~
lot.cpp:32:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
32 | for(int j=0;j<poz[i].size();j++){
| ~^~~~~~~~~~~~~~
lot.cpp:52:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
52 | for(int p=0;p<match[j].size();p++){
| ~^~~~~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Runtime error |
1 ms |
604 KB |
Execution killed with signal 11 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Runtime error |
1 ms |
604 KB |
Execution killed with signal 11 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
6 ms |
7260 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
6 ms |
7260 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Runtime error |
1 ms |
604 KB |
Execution killed with signal 11 |
3 |
Halted |
0 ms |
0 KB |
- |