oj.uz

Submission #835235

# Submission time Handle Problem Language Result Execution time Memory
835235 2023-08-23T10:50:58 Z GrindMachine Lottery (CEOI18_lot) C++17
100 / 100
 412 ms 8652 KB 
// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

void solve(int test_case)
{
    int n,l; cin >> n >> l;
    vector<int> a(n);
    rep(i,n) cin >> a[i];

    int q; cin >> q;
    vector<int> queries(q);
    rep(i,q) cin >> queries[i];
        
    auto b = queries;
    sort(all(b));
    b.resize(unique(all(b))-b.begin());
    int siz = sz(b);

    vector<int> nxt(l+1,inf1);
    rep(i,siz) nxt[b[i]] = i;
    rev(i,l-1,0) amin(nxt[i],nxt[i+1]);

    vector<vector<int>> pref(n,vector<int>(siz));
    vector<int> dp(n+1);

    rep1(d,n){
        // d = j-i
        fill(all(dp),0);

        rev(i,n-d-1,0){
            int j = i+d;
            dp[i] = (a[i]!=a[j]) + dp[i+1];
        }

        rep(i,n-d){
            int j = i+d;
            if(j+l-1 >= n) break;

            int k = dp[i]-dp[i+l];
            int ck = nxt[k];

            if(ck < inf1){
                pref[i][ck]++;
                pref[j][ck]++;   
            }            
        }
    }

    rep(i,n){
        rep1(j,siz-1){
            pref[i][j] += pref[i][j-1];
        }
    }

    rep(id,q){
        int k = queries[id];
        int ck = nxt[k];
        rep(i,n){
            if(i+l-1 >= n) break;
            int ans = pref[i][ck];
            cout << ans << " ";
        }
        cout << endl;
    }
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 12 ms 468 KB Output is correct
14 Correct 10 ms 596 KB Output is correct
15 Correct 8 ms 468 KB Output is correct
16 Correct 10 ms 592 KB Output is correct
17 Correct 9 ms 592 KB Output is correct
18 Correct 9 ms 720 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 289 ms 940 KB Output is correct
2 Correct 209 ms 980 KB Output is correct
3 Correct 202 ms 972 KB Output is correct
4 Correct 193 ms 1104 KB Output is correct
5 Correct 144 ms 1068 KB Output is correct
6 Correct 187 ms 1048 KB Output is correct
7 Correct 168 ms 1064 KB Output is correct
8 Correct 201 ms 980 KB Output is correct
9 Correct 196 ms 1036 KB Output is correct
10 Correct 193 ms 1032 KB Output is correct
11 Correct 16 ms 468 KB Output is correct
12 Correct 144 ms 980 KB Output is correct
13 Correct 151 ms 1052 KB Output is correct
14 Correct 151 ms 1100 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 289 ms 940 KB Output is correct
2 Correct 209 ms 980 KB Output is correct
3 Correct 202 ms 972 KB Output is correct
4 Correct 193 ms 1104 KB Output is correct
5 Correct 144 ms 1068 KB Output is correct
6 Correct 187 ms 1048 KB Output is correct
7 Correct 168 ms 1064 KB Output is correct
8 Correct 201 ms 980 KB Output is correct
9 Correct 196 ms 1036 KB Output is correct
10 Correct 193 ms 1032 KB Output is correct
11 Correct 16 ms 468 KB Output is correct
12 Correct 144 ms 980 KB Output is correct
13 Correct 151 ms 1052 KB Output is correct
14 Correct 151 ms 1100 KB Output is correct
15 Correct 239 ms 972 KB Output is correct
16 Correct 191 ms 1052 KB Output is correct
17 Correct 207 ms 980 KB Output is correct
18 Correct 201 ms 1044 KB Output is correct
19 Correct 194 ms 1044 KB Output is correct
20 Correct 192 ms 1040 KB Output is correct
21 Correct 193 ms 1048 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 12 ms 468 KB Output is correct
14 Correct 10 ms 596 KB Output is correct
15 Correct 8 ms 468 KB Output is correct
16 Correct 10 ms 592 KB Output is correct
17 Correct 9 ms 592 KB Output is correct
18 Correct 9 ms 720 KB Output is correct
19 Correct 289 ms 940 KB Output is correct
20 Correct 209 ms 980 KB Output is correct
21 Correct 202 ms 972 KB Output is correct
22 Correct 193 ms 1104 KB Output is correct
23 Correct 144 ms 1068 KB Output is correct
24 Correct 187 ms 1048 KB Output is correct
25 Correct 168 ms 1064 KB Output is correct
26 Correct 201 ms 980 KB Output is correct
27 Correct 196 ms 1036 KB Output is correct
28 Correct 193 ms 1032 KB Output is correct
29 Correct 16 ms 468 KB Output is correct
30 Correct 144 ms 980 KB Output is correct
31 Correct 151 ms 1052 KB Output is correct
32 Correct 151 ms 1100 KB Output is correct
33 Correct 239 ms 972 KB Output is correct
34 Correct 191 ms 1052 KB Output is correct
35 Correct 207 ms 980 KB Output is correct
36 Correct 201 ms 1044 KB Output is correct
37 Correct 194 ms 1044 KB Output is correct
38 Correct 192 ms 1040 KB Output is correct
39 Correct 193 ms 1048 KB Output is correct
40 Correct 320 ms 2352 KB Output is correct
41 Correct 132 ms 1700 KB Output is correct
42 Correct 231 ms 2360 KB Output is correct
43 Correct 198 ms 2052 KB Output is correct
44 Correct 205 ms 2172 KB Output is correct
45 Correct 412 ms 8552 KB Output is correct
46 Correct 136 ms 5084 KB Output is correct
47 Correct 384 ms 8652 KB Output is correct
48 Correct 236 ms 6424 KB Output is correct
49 Correct 239 ms 7128 KB Output is correct