oj.uz

Submission #367200

# Submission time Handle Problem Language Result Execution time Memory
367200 2021-02-16T14:17:26 Z piddddgy JJOOII 2 (JOI20_ho_t2) C++11
13 / 100
 2000 ms 1016 KB 
#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;
#define cerr if(false) cerr
#define watch(x) cerr << (#x) << " is " << (x) << endl;
#define endl '\n'
#define ld long double
#define int long long
#define pii pair<int, int>
#define fi first
#define se second
#define sz(a) (int)(a).size()
#define all(x) (x).begin(), (x).end()

int n, k;
string s;



signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    cin >> n >> k;
    cin >> s;

    s = "."+s;

    int l = 1, r = n;
    int mi = 1e18;

    while(l <= r) {
        int mid = (l+r)/2;

        bool ok = false;
        cerr << "trying " << mid << endl;
        for(int i = 1; i+mid-1 <= n; i++) {
            cerr << "from " << i << endl;
            queue<char> Q;

            for(char chr: string("JOI")) {
                for(int j = 0; j < k; j++) {
                    Q.push(chr);
                }
            }

            for(int j = 0; j < mid; j++) {
                if(sz(Q) and s[i+j] == Q.front()) {
                    cerr << "on " << i+j << endl;
                    cerr << "popping " << Q.front() << endl;
                    Q.pop();
                }
            }

            if(Q.empty()) ok = true;
        }

        watch(ok)
        if(ok) {
            mi = mid;
            r = mid-1;
        } else {
            l = mid+1;
        }
    }

    // watch(mi)

    if(mi == 1e18) {
        cout << -1 << endl;
    } else {
        cout << mi-3*k << endl;
    }
}

/*

find smallest subarray with k-level JOI as subsequence

bsearch

Did you read the bounds?
Did you make typos?
Are there edge cases (N=1?)
Are array sizes proper?
Integer overflow?
DS reset properly between test cases?
Is using long longs causing TLE?
Are you using floating points?
*/

Subtask #1
1.0 / 1.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 9 ms 364 KB Output is correct
16 Correct 11 ms 364 KB Output is correct
17 Correct 12 ms 364 KB Output is correct
18 Correct 38 ms 364 KB Output is correct
19 Correct 55 ms 376 KB Output is correct
20 Correct 53 ms 384 KB Output is correct
21 Correct 118 ms 492 KB Output is correct
22 Correct 29 ms 364 KB Output is correct
23 Correct 9 ms 364 KB Output is correct
24 Correct 32 ms 364 KB Output is correct
25 Correct 32 ms 364 KB Output is correct
26 Correct 32 ms 364 KB Output is correct
27 Correct 33 ms 492 KB Output is correct
28 Correct 30 ms 492 KB Output is correct
29 Correct 31 ms 364 KB Output is correct
30 Correct 38 ms 364 KB Output is correct
31 Correct 12 ms 364 KB Output is correct
32 Correct 44 ms 364 KB Output is correct
33 Correct 41 ms 492 KB Output is correct
34 Correct 134 ms 492 KB Output is correct
35 Correct 62 ms 492 KB Output is correct

Subtask #3
0 / 87.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 9 ms 364 KB Output is correct
16 Correct 11 ms 364 KB Output is correct
17 Correct 12 ms 364 KB Output is correct
18 Correct 38 ms 364 KB Output is correct
19 Correct 55 ms 376 KB Output is correct
20 Correct 53 ms 384 KB Output is correct
21 Correct 118 ms 492 KB Output is correct
22 Correct 29 ms 364 KB Output is correct
23 Correct 9 ms 364 KB Output is correct
24 Correct 32 ms 364 KB Output is correct
25 Correct 32 ms 364 KB Output is correct
26 Correct 32 ms 364 KB Output is correct
27 Correct 33 ms 492 KB Output is correct
28 Correct 30 ms 492 KB Output is correct
29 Correct 31 ms 364 KB Output is correct
30 Correct 38 ms 364 KB Output is correct
31 Correct 12 ms 364 KB Output is correct
32 Correct 44 ms 364 KB Output is correct
33 Correct 41 ms 492 KB Output is correct
34 Correct 134 ms 492 KB Output is correct
35 Correct 62 ms 492 KB Output is correct
36 Execution timed out 2087 ms 1016 KB Time limit exceeded
37 Halted 0 ms 0 KB -