oj.uz

Submission #1060120

# Submission time Handle Problem Language Result Execution time Memory
1060120 2024-08-15T10:44:38 Z user736482 Lottery (CEOI18_lot) C++17
45 / 100
 63 ms 16728 KB 
#include<bits/stdc++.h>
using namespace std;
int n,q,a,k,l;
vector<int>v,poz,match[2007];//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 i=0;i<l-1;i++){
        poz.clear();
        for(int j=i+1;j<n;j++){
            if(v[i]==v[j]) poz.push_back(j);
        }
        //return 0;
        for(int j=0;j<poz.size();j++){
            pod[-i+poz[j]]++;
            dous.push({i,poz[j]});
        }
        //return 0;
    }
    //return 0;
    for(int i=l-1;i<n;i++){
            poz.clear();
        for(int j=i+1;j<n;j++){
            if(v[i]==v[j]) poz.push_back(j);
        }
        while(!dous.empty() && i-l>=dous.front().first){
            pod[-dous.front().first+dous.front().second]--;
            dous.pop();
        }
        for(int j=0;j<poz.size();j++){
            pod[-i+poz[j]]++;
            //cout<<i+poz[i][j]<<" ";
            dous.push({i,poz[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-l+1].push_back(pod[-i+j]);
        //    cout<<j-l<<"  ";
        }
        //cout<<"\n";
    }
    //return 0;
    /*for(int i=0;i<n-l+1;i++){
        for(int j=0;j<match[i].size();j++)
            cout<<match[i][j]<<" ";
        cout<<"\n";
    }*/
    //return 0;
    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:19:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |         for(int j=0;j<poz.size();j++){
      |                     ~^~~~~~~~~~~
lot.cpp:35:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |         for(int j=0;j<poz.size();j++){
      |                     ~^~~~~~~~~~~
lot.cpp:63:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |             for(int p=0;p<match[j].size();p++){
      |                         ~^~~~~~~~~~~~~~~~

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 2 ms 860 KB Output is correct
11 Correct 2 ms 860 KB Output is correct
12 Correct 4 ms 860 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 2 ms 860 KB Output is correct
11 Correct 2 ms 860 KB Output is correct
12 Correct 4 ms 860 KB Output is correct
13 Correct 35 ms 16728 KB Output is correct
14 Correct 38 ms 11352 KB Output is correct
15 Correct 30 ms 11352 KB Output is correct
16 Correct 63 ms 15108 KB Output is correct
17 Correct 55 ms 13916 KB Output is correct
18 Correct 53 ms 13912 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 860 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 860 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 2 ms 860 KB Output is correct
11 Correct 2 ms 860 KB Output is correct
12 Correct 4 ms 860 KB Output is correct
13 Correct 35 ms 16728 KB Output is correct
14 Correct 38 ms 11352 KB Output is correct
15 Correct 30 ms 11352 KB Output is correct
16 Correct 63 ms 15108 KB Output is correct
17 Correct 55 ms 13916 KB Output is correct
18 Correct 53 ms 13912 KB Output is correct
19 Runtime error 2 ms 860 KB Execution killed with signal 11
20 Halted 0 ms 0 KB -