Submission #920144

#	Time	Username	Problem	Language	Result	Execution time	Memory
920144		Sir_Ahmed_Imran	Lottery (CEOI18_lot)	C++17	65 / 100	85 ms	31576 KiB

lot

                              ///~~~LOTA~~~///
#include <bits/stdc++.h>
using namespace std;
#define nl '\n'
#define ff first
#define ss second
#define ll long long 
#define append push_back
#define all(x) (x).begin(),(x).end()
#define pii pair<int,int>
#define N 2001
ll mod=1e9+7;
ll base=621;
int s[N][N];
int x[N][N];
map<int,int> cnt;
map<int,vector<int>> a;
void Solve(int n,int m){
    ll o,p,q,r;
    vector<int> h,v;
    r=1;
    for(int i=1;i<m;i++)
        r=(r*base)%mod;
    for(int i=p=0;i<n;i++){
        cin>>o;
        v.append(o);
        if(i>=m){
            q=(v[i-m]*r)%mod;
            p=(mod+p-q)%mod;
        }
        p=(p*base+o)%mod;
        if(i+2>m){
            h.append(p);
            cnt[p]++;
        }
    }
    cin>>o>>o;
    for(int i=0;i<=n-m;i++)
        cout<<cnt[h[i]]-1<<' ';
}
void solve(){
    int n,m,o,p,q,r;
    cin>>n>>m;
    if(n>=N){
        Solve(n,m);
        return;
    }
    for(int i=1;i<=n;i++){
        cin>>o;
        x[i][0]=n-m;
        a[o].append(i);
    }
    for(auto& i:a){
        o=i.ss.size();
        for(int j=0;j<o;j++){
            for(int k=j+1;k<o;k++){
                for(int l=0;l<m;l++){
                    p=i.ss[j];
                    q=i.ss[k];
                    if(p-l<1 || q-l>n-m+1)
                        continue;
                    s[p-l][q-l]++;
                    s[q-l][p-l]++;
                    x[p-l][s[q-l][p-l]]++;
                    x[q-l][s[q-l][p-l]]++;
                }
            }
        }
    }
    cin>>o;
    for(int i=0;i<o;i++){
        cin>>p;
        for(int j=1;j<n-m+2;j++)
            cout<<x[j][m-p]<<' ';
        cout<<nl;
    }
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    solve();
    return 0;
}

Compilation message (stderr)

lot.cpp: In function 'void solve()':
lot.cpp:42:19: warning: unused variable 'r' [-Wunused-variable]
   42 |     int n,m,o,p,q,r;
      |                   ^

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