oj.uz

Submission #930088

# Submission time Handle Problem Language Result Execution time Memory
930088 2024-02-18T13:02:30 Z Mohammadamin__Sh Lottery (CEOI18_lot) C++17
80 / 100
 1010 ms 8252 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;

int 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';
    }
}

Compilation message

lot.cpp:3: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    3 | #pragma GCC optimization("O2")
      |

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 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 344 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 1 ms 348 KB Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 479 ms 4448 KB Output is correct
2 Correct 633 ms 4444 KB Output is correct
3 Correct 286 ms 4692 KB Output is correct
4 Correct 217 ms 4444 KB Output is correct
5 Correct 63 ms 2652 KB Output is correct
6 Correct 196 ms 4252 KB Output is correct
7 Correct 60 ms 2800 KB Output is correct
8 Correct 110 ms 3364 KB Output is correct
9 Correct 217 ms 4408 KB Output is correct
10 Correct 248 ms 4448 KB Output is correct
11 Correct 12 ms 2652 KB Output is correct
12 Correct 147 ms 3328 KB Output is correct
13 Correct 106 ms 2908 KB Output is correct
14 Correct 102 ms 2912 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 479 ms 4448 KB Output is correct
2 Correct 633 ms 4444 KB Output is correct
3 Correct 286 ms 4692 KB Output is correct
4 Correct 217 ms 4444 KB Output is correct
5 Correct 63 ms 2652 KB Output is correct
6 Correct 196 ms 4252 KB Output is correct
7 Correct 60 ms 2800 KB Output is correct
8 Correct 110 ms 3364 KB Output is correct
9 Correct 217 ms 4408 KB Output is correct
10 Correct 248 ms 4448 KB Output is correct
11 Correct 12 ms 2652 KB Output is correct
12 Correct 147 ms 3328 KB Output is correct
13 Correct 106 ms 2908 KB Output is correct
14 Correct 102 ms 2912 KB Output is correct
15 Correct 285 ms 4336 KB Output is correct
16 Correct 181 ms 4132 KB Output is correct
17 Correct 247 ms 4688 KB Output is correct
18 Correct 218 ms 4740 KB Output is correct
19 Correct 219 ms 4484 KB Output is correct
20 Correct 223 ms 4496 KB Output is correct
21 Correct 206 ms 4440 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 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 344 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 14 ms 2652 KB Output is correct
14 Correct 8 ms 2652 KB Output is correct
15 Correct 7 ms 2652 KB Output is correct
16 Correct 13 ms 2652 KB Output is correct
17 Correct 11 ms 2648 KB Output is correct
18 Correct 12 ms 2652 KB Output is correct
19 Correct 479 ms 4448 KB Output is correct
20 Correct 633 ms 4444 KB Output is correct
21 Correct 286 ms 4692 KB Output is correct
22 Correct 217 ms 4444 KB Output is correct
23 Correct 63 ms 2652 KB Output is correct
24 Correct 196 ms 4252 KB Output is correct
25 Correct 60 ms 2800 KB Output is correct
26 Correct 110 ms 3364 KB Output is correct
27 Correct 217 ms 4408 KB Output is correct
28 Correct 248 ms 4448 KB Output is correct
29 Correct 12 ms 2652 KB Output is correct
30 Correct 147 ms 3328 KB Output is correct
31 Correct 106 ms 2908 KB Output is correct
32 Correct 102 ms 2912 KB Output is correct
33 Correct 285 ms 4336 KB Output is correct
34 Correct 181 ms 4132 KB Output is correct
35 Correct 247 ms 4688 KB Output is correct
36 Correct 218 ms 4740 KB Output is correct
37 Correct 219 ms 4484 KB Output is correct
38 Correct 223 ms 4496 KB Output is correct
39 Correct 206 ms 4440 KB Output is correct
40 Correct 835 ms 5188 KB Output is correct
41 Correct 9 ms 2652 KB Output is correct
42 Correct 346 ms 5192 KB Output is correct
43 Correct 325 ms 4612 KB Output is correct
44 Correct 321 ms 4692 KB Output is correct
45 Correct 1010 ms 8252 KB Output is correct
46 Incorrect 15 ms 3164 KB Output isn't correct
47 Halted 0 ms 0 KB -