oj.uz

Submission #930089

# Submission time Handle Problem Language Result Execution time Memory
930089 2024-02-18T13:03:17 Z Mohammadamin__Sh Lottery (CEOI18_lot) C++17
80 / 100
 1096 ms 12184 KB 
//In His Name
#include <bits/stdc++.h>
//#pragma GCC optimization("O2")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("avx2")
using namespace std;
#define ll long long
#define int ll
typedef pair<int, int> pii;
#define F first
#define S second
#define pb push_back
#define bug(x) cout << "Ah shit , here we go again : " << x <<endl
#define all(x) x.begin() , x.end()
const int maxn = 1e4 + 10, MOD = 1e9 + 7;
const ll INF = 1e18;

int n , l , a[maxn] , q , dp[maxn][101];
vector<int> query , allq;

int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    cin >> n >> l;
    for(int i = 1 ; i <= n ; i++) cin >> a[i];
    cin >> q;
    for(int i = 1 ; i <= q ; i++){
        int x;
        cin >> x;
        query.pb(x) , allq.pb(x);
    }
    sort(all(query));
    query.resize(unique(all(query)) - query.begin());
    for(int i = 1 ; i <= n-l ; i++) {
        int w = 0;
        for(int k = 1 ; k <= l ; k++) if(a[i+k] == a[k]) w++;
        int idx = lower_bound(all(query) , l - w) - query.begin() + 1 ;
        dp[i+1][idx]++ , dp[1][idx]++;
        for(int k = 2 ; k+i <= n-l+1 ; k++){
            if(a[k+l-1] == a[i+k+l-1]) w++;
            if(a[k-1] == a[i+k-1]) w--;
            idx = lower_bound(all(query) , (l - w)) - query.begin() + 1 ;
            dp[k][idx]++ , dp[i+k][idx]++;
        }
    }
    for(int i = 1 ; i <= n-l+1 ; i++) for(int j = 1 ; j <= q ; j++) dp[i][j] += dp[i][j-1];
    for(int j = 0 ; j < q ; j++){
        int x = allq[j];
        int idx = lower_bound(all(query) , x) - query.begin() + 1 ;
        for(int i = 1 ; i <= n-l+1 ; i++) cout << dp[i][idx] << " ";
        cout << '\n';
    }
}

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 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 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 2648 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct
12 Correct 1 ms 2652 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 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 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 2648 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct
12 Correct 1 ms 2652 KB Output is correct
13 Correct 14 ms 2648 KB Output is correct
14 Correct 8 ms 2704 KB Output is correct
15 Correct 7 ms 2648 KB Output is correct
16 Correct 15 ms 2708 KB Output is correct
17 Correct 13 ms 2652 KB Output is correct
18 Correct 13 ms 2652 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 458 ms 8412 KB Output is correct
2 Correct 608 ms 8412 KB Output is correct
3 Correct 275 ms 8416 KB Output is correct
4 Correct 207 ms 8276 KB Output is correct
5 Correct 82 ms 4700 KB Output is correct
6 Correct 187 ms 7772 KB Output is correct
7 Correct 67 ms 4792 KB Output is correct
8 Correct 103 ms 6744 KB Output is correct
9 Correct 209 ms 8176 KB Output is correct
10 Correct 210 ms 8284 KB Output is correct
11 Correct 12 ms 2652 KB Output is correct
12 Correct 125 ms 6744 KB Output is correct
13 Correct 98 ms 6852 KB Output is correct
14 Correct 99 ms 6744 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 458 ms 8412 KB Output is correct
2 Correct 608 ms 8412 KB Output is correct
3 Correct 275 ms 8416 KB Output is correct
4 Correct 207 ms 8276 KB Output is correct
5 Correct 82 ms 4700 KB Output is correct
6 Correct 187 ms 7772 KB Output is correct
7 Correct 67 ms 4792 KB Output is correct
8 Correct 103 ms 6744 KB Output is correct
9 Correct 209 ms 8176 KB Output is correct
10 Correct 210 ms 8284 KB Output is correct
11 Correct 12 ms 2652 KB Output is correct
12 Correct 125 ms 6744 KB Output is correct
13 Correct 98 ms 6852 KB Output is correct
14 Correct 99 ms 6744 KB Output is correct
15 Correct 288 ms 8152 KB Output is correct
16 Correct 168 ms 7644 KB Output is correct
17 Correct 222 ms 8284 KB Output is correct
18 Correct 207 ms 8332 KB Output is correct
19 Correct 204 ms 8344 KB Output is correct
20 Correct 197 ms 8284 KB Output is correct
21 Correct 222 ms 8336 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 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 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 2648 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct
12 Correct 1 ms 2652 KB Output is correct
13 Correct 14 ms 2648 KB Output is correct
14 Correct 8 ms 2704 KB Output is correct
15 Correct 7 ms 2648 KB Output is correct
16 Correct 15 ms 2708 KB Output is correct
17 Correct 13 ms 2652 KB Output is correct
18 Correct 13 ms 2652 KB Output is correct
19 Correct 458 ms 8412 KB Output is correct
20 Correct 608 ms 8412 KB Output is correct
21 Correct 275 ms 8416 KB Output is correct
22 Correct 207 ms 8276 KB Output is correct
23 Correct 82 ms 4700 KB Output is correct
24 Correct 187 ms 7772 KB Output is correct
25 Correct 67 ms 4792 KB Output is correct
26 Correct 103 ms 6744 KB Output is correct
27 Correct 209 ms 8176 KB Output is correct
28 Correct 210 ms 8284 KB Output is correct
29 Correct 12 ms 2652 KB Output is correct
30 Correct 125 ms 6744 KB Output is correct
31 Correct 98 ms 6852 KB Output is correct
32 Correct 99 ms 6744 KB Output is correct
33 Correct 288 ms 8152 KB Output is correct
34 Correct 168 ms 7644 KB Output is correct
35 Correct 222 ms 8284 KB Output is correct
36 Correct 207 ms 8332 KB Output is correct
37 Correct 204 ms 8344 KB Output is correct
38 Correct 197 ms 8284 KB Output is correct
39 Correct 222 ms 8336 KB Output is correct
40 Correct 838 ms 9108 KB Output is correct
41 Correct 12 ms 2648 KB Output is correct
42 Correct 354 ms 8956 KB Output is correct
43 Correct 307 ms 8324 KB Output is correct
44 Correct 333 ms 8336 KB Output is correct
45 Correct 1096 ms 12184 KB Output is correct
46 Incorrect 18 ms 3160 KB Output isn't correct
47 Halted 0 ms 0 KB -