oj.uz

Submission #835220

# Submission time Handle Problem Language Result Execution time Memory
835220 2023-08-23T10:33:10 Z GrindMachine Lottery (CEOI18_lot) C++17
45 / 100
 30 ms 65536 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];

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

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

    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));

    rep(i,n){
        if(i+l-1 >= n) break;
        for(int j = i+1; j < n; ++j){
            if(j+l-1 >= n) break;
            int k = dp[i][j]-dp[i+l][j+l];
            int pos = nxt[k];
            if(pos < inf1){
                pref[i][pos]++;
                pref[j][pos]++;
            }
        }
    }

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

    rep(id,q){
        int k = queries[id];
        int ck = lower_bound(all(b),k)-b.begin();
        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 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 724 KB Output is correct
10 Correct 2 ms 724 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 848 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 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 724 KB Output is correct
10 Correct 2 ms 724 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 848 KB Output is correct
13 Correct 19 ms 16220 KB Output is correct
14 Correct 18 ms 16464 KB Output is correct
15 Correct 12 ms 16212 KB Output is correct
16 Correct 15 ms 16340 KB Output is correct
17 Correct 15 ms 16336 KB Output is correct
18 Correct 14 ms 16340 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 30 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 30 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 724 KB Output is correct
10 Correct 2 ms 724 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 848 KB Output is correct
13 Correct 19 ms 16220 KB Output is correct
14 Correct 18 ms 16464 KB Output is correct
15 Correct 12 ms 16212 KB Output is correct
16 Correct 15 ms 16340 KB Output is correct
17 Correct 15 ms 16336 KB Output is correct
18 Correct 14 ms 16340 KB Output is correct
19 Runtime error 30 ms 65536 KB Execution killed with signal 9
20 Halted 0 ms 0 KB -