oj.uz

Submission #1068655

# Submission time Handle Problem Language Result Execution time Memory
1068655 2024-08-21T11:11:08 Z PotatoTheWarriorFRTT Lottery (CEOI18_lot) C++14
0 / 100
 13 ms 348 KB 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
ll MOD = 1000000007;

ll power(ll x, ll y) {
    ll res = 1;
    while(y != 0) {
        if(y%2) {
            res = (res*x)%MOD;
        }
        x = (x*x)%MOD;
        y/=2;
    }
    return res;
}

void solve() {
    int n, l; cin >> n >> l;
    int a[n+1];
    for(int i=0;i<n;i++) {
        int x; cin >> x;
        a[i] = power(2, power(3, x));
    }
    map<ll, ll> m;
    ll hashes[n+1];
    for(int i=0;i<n-l+1;i++) {
        ll hash = a[i];
        for(int j=1;j<l;j++) {
            hash = power(a[j+i], hash);
        }
        hashes[i] = hash;
        m[hash]++;
    }


    int q; cin >> q;
    int k; cin >> k; // q=0;k=1;

    for(int i=0;i<n-l+1;i++) {
        cout << m[hashes[i]]-1 << " ";
    }
    cout << endl;
 
}
int main()   {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int t; cin >> t;
    while(t--) 
        solve();

    char dksfjn;
    cin >> dksfjn;
}

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 13 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 13 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 -