oj.uz

Submission #1059922

# Submission time Handle Problem Language Result Execution time Memory
1059922 2024-08-15T09:16:35 Z SzymonKrzywda Lottery (CEOI18_lot) C++17
0 / 100
 0 ms 348 KB 
#include <bits/stdc++.h>

using namespace std;



int main()
{
    int n,l;
  	int q,k;
    
    cin >> q;
    cin >> k;
    cin >> n >> l;
    int tab[n];
    int odp[(n-l+1)];
    for (int i=0; i<n; i++){
        cin >> tab[i];
    }
    map<pair<int,int>,vector<int>> mapa;
    for (int i=0; i<(n-l+1); i++){
        
        for (int j=0; j<l; j++){
            if (mapa.find({j,tab[i+j]}) != mapa.end()){
                mapa[{j,tab[i+j]}].push_back(i);
            }
            else{
                mapa[{j,tab[i+j]}] = {i};
            }
        }

        
        
    }
    
    for (int i=0; i<(n-l+1); i++){
        int wyniki_2[n];
        for (int s=0; s<n; s++) wyniki_2[s] = 0;
        for (int j=i; j<(i+l); j++){
            
            for (int s : mapa[{j-i,tab[j]}]){
                if (i==s) continue;
                //cout << i << " " << " " << tab[j] << " " << s << endl;
                wyniki_2[s]++;
            }
            
        }
        
        vector<int> wyniki(0);
        for (int s=0; s<(n-l+1); s++){
            if (i==s) continue;
            //cout << s << ": " << wyniki_2[s] << " ";
            wyniki.push_back(wyniki_2[s]);
        }
        //cout << endl;
        sort(wyniki.begin(),wyniki.end());
        //for (auto x : wyniki) cout << x << " ";cout << endl;
        int ile=(n-l);
        int wsk=0;
      	while (wsk < (n-l) && l-wyniki[wsk]<k) {ile--; wsk++;}
       	cout << ile << " ";
            
        
    }
    
    
    
    
    
 

    return 0;
}

Compilation message

lot.cpp: In function 'int main()':
lot.cpp:16:9: warning: unused variable 'odp' [-Wunused-variable]
   16 |     int odp[(n-l+1)];
      |         ^~~

Subtask #1
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -