oj.uz

Submission #966918

# Submission time Handle Problem Language Result Execution time Memory
966918 2024-04-20T15:38:47 Z Charizard2021 Lottery (CEOI18_lot) C++17
45 / 100
 32 ms 1116 KB 
#include<bits/stdc++.h>
using namespace std;
const int p = 1e9 + 7;
const int MOD = 1e9 + 21;
const int MODInverse = 928571448;
int main(){
    int n, l;
    cin >> n >> l;
    long long powers[1 + n];
    powers[0] = 1;
    long long invPowers[1 + n];
    invPowers[0] = 1;
    for(int i = 1; i <= n; i++){
        powers[i] = powers[i - 1] * p % MOD;
        invPowers[i] = invPowers[i - 1] * MODInverse % MOD;
    }
    vector<int> a(1 + n);
    vector<long long> hashing(1 + n, 0);
    for(int i = 1; i <= n; i++){
        cin >> a[i];
        hashing[i] = (hashing[i - 1] + powers[i] * a[i]) % MOD;
    }
    int q;
    cin >> q;
    if(n <= 300){
        while(q--){
            int val;
            cin >> val;
            vector<int> ans(1 + n, 0);
            for(int i = 1; i + l - 1 <= n; i++){
                for(int j = i + 1; j + l - 1 <= n; j++){
                    int thing = 0;
                    for(int k = 0; k < l; k++){
                        if(a[i + k] != a[j + k]){
                            thing++;
                        }
                    }
                    if(thing <= val){
                        ans[i]++;
                        ans[j]++;
                    }
                }
            }
            for(int i = 1; i + l - 1 <= n; i++){
                cout << ans[i] << " ";
            }
            cout << "\n";
        }
    }
    else if(q == 1){
        int k;
        cin >> k;
        if(k == 0){
            map<long long, int> freq;
            for(int i = 1; i + l - 1 <= n; i++){
                long long num = hashing[i + l - 1] - hashing[i - 1];
                num %= MOD;
                if(num < 0){
                    num += MOD;
                }
                num = (num * invPowers[i]) % MOD;
                freq[num]++;
            }
            for(int i = 1; i + l - 1 <= n; i++){
                long long num = hashing[i + l - 1] - hashing[i - 1];
                num %= MOD;
                if(num < 0){
                    num += MOD;
                }
                num = (num * invPowers[i]) % MOD;
                cout << freq[num] - 1 << " ";
            }
            cout << "\n";
        }
    }
}

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 3 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 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 32 ms 344 KB Output is correct
9 Correct 25 ms 424 KB Output is correct
10 Correct 15 ms 344 KB Output is correct
11 Correct 10 ms 344 KB Output is correct
12 Correct 20 ms 348 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 3 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 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 32 ms 344 KB Output is correct
9 Correct 25 ms 424 KB Output is correct
10 Correct 15 ms 344 KB Output is correct
11 Correct 10 ms 344 KB Output is correct
12 Correct 20 ms 348 KB Output is correct
13 Incorrect 1 ms 348 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 604 KB Output is correct
2 Correct 3 ms 604 KB Output is correct
3 Correct 4 ms 604 KB Output is correct
4 Correct 5 ms 972 KB Output is correct
5 Correct 5 ms 1116 KB Output is correct
6 Correct 7 ms 1116 KB Output is correct
7 Correct 4 ms 800 KB Output is correct
8 Correct 4 ms 604 KB Output is correct
9 Correct 4 ms 860 KB Output is correct
10 Correct 5 ms 860 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 5 ms 1116 KB Output is correct
13 Correct 7 ms 1116 KB Output is correct
14 Correct 5 ms 1116 KB Output is correct

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 604 KB Output is correct
2 Correct 3 ms 604 KB Output is correct
3 Correct 4 ms 604 KB Output is correct
4 Correct 5 ms 972 KB Output is correct
5 Correct 5 ms 1116 KB Output is correct
6 Correct 7 ms 1116 KB Output is correct
7 Correct 4 ms 800 KB Output is correct
8 Correct 4 ms 604 KB Output is correct
9 Correct 4 ms 860 KB Output is correct
10 Correct 5 ms 860 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 5 ms 1116 KB Output is correct
13 Correct 7 ms 1116 KB Output is correct
14 Correct 5 ms 1116 KB Output is correct
15 Incorrect 2 ms 604 KB Output isn't correct
16 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 3 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 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 32 ms 344 KB Output is correct
9 Correct 25 ms 424 KB Output is correct
10 Correct 15 ms 344 KB Output is correct
11 Correct 10 ms 344 KB Output is correct
12 Correct 20 ms 348 KB Output is correct
13 Incorrect 1 ms 348 KB Output isn't correct
14 Halted 0 ms 0 KB -