oj.uz

Submission #201909

# Submission time Handle Problem Language Result Execution time Memory
201909 2020-02-12T18:36:28 Z Osama_Alkhodairy JJOOII 2 (JOI20_ho_t2) C++17
100 / 100
 47 ms 5248 KB 
#include <bits/stdc++.h>
using namespace std;
#define finish(x) return cout << x << endl, 0
#define ll long long

int n, k;
string s;

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> k >> s;
    set <int> p;
    vector <int> J(n);
    for(int i = 0 ; i < n ; i++){
        if(s[i] == 'J') p.insert(i);
        if((int)p.size() > k) p.erase(p.begin());
        if((int)p.size() < k) J[i] = -1;
        else J[i] = *p.begin();
    }
    p.clear();
    vector <int> I(n);
    for(int i = n - 1 ; i >= 0 ; i--){
        if(s[i] == 'I') p.insert(i);
        if((int)p.size() > k) p.erase(--p.end());
        if((int)p.size() < k) I[i] = -1;
        else I[i] = *p.rbegin();
    }
    p.clear();
    int ans = 1e9;
    for(int i = n - 1 ; i >= 0 ; i--){
        if(s[i] == 'O') p.insert(i);
        if((int)p.size() > k) p.erase(--p.end());
        if((int)p.size() < k) continue;
        if(i > 0 && J[i - 1] != -1 && *p.rbegin() + 1 < n && I[*p.rbegin() + 1] != -1){
            ans = min(ans, I[*p.rbegin() + 1] - J[i - 1] + 1);
        }
    }
    if(ans == 1e9) ans = -1;
    else ans -= 3 * k;
    cout << ans << endl;
}

Subtask #1
1.0 / 1.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 4 ms 376 KB Output is correct
10 Correct 5 ms 380 KB Output is correct
11 Correct 5 ms 504 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 5 ms 408 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 5 ms 376 KB Output is correct
28 Correct 5 ms 376 KB Output is correct
29 Correct 5 ms 376 KB Output is correct
30 Correct 5 ms 376 KB Output is correct
31 Correct 5 ms 376 KB Output is correct
32 Correct 5 ms 376 KB Output is correct
33 Correct 5 ms 376 KB Output is correct
34 Correct 5 ms 376 KB Output is correct
35 Correct 5 ms 380 KB Output is correct

Subtask #3
87.0 / 87.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 4 ms 376 KB Output is correct
10 Correct 5 ms 380 KB Output is correct
11 Correct 5 ms 504 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 5 ms 408 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 5 ms 376 KB Output is correct
28 Correct 5 ms 376 KB Output is correct
29 Correct 5 ms 376 KB Output is correct
30 Correct 5 ms 376 KB Output is correct
31 Correct 5 ms 376 KB Output is correct
32 Correct 5 ms 376 KB Output is correct
33 Correct 5 ms 376 KB Output is correct
34 Correct 5 ms 376 KB Output is correct
35 Correct 5 ms 380 KB Output is correct
36 Correct 22 ms 2048 KB Output is correct
37 Correct 24 ms 2180 KB Output is correct
38 Correct 23 ms 2180 KB Output is correct
39 Correct 41 ms 2436 KB Output is correct
40 Correct 43 ms 2948 KB Output is correct
41 Correct 40 ms 2560 KB Output is correct
42 Correct 37 ms 2180 KB Output is correct
43 Correct 28 ms 2168 KB Output is correct
44 Correct 35 ms 2564 KB Output is correct
45 Correct 44 ms 3204 KB Output is correct
46 Correct 45 ms 3204 KB Output is correct
47 Correct 45 ms 3204 KB Output is correct
48 Correct 44 ms 3208 KB Output is correct
49 Correct 30 ms 2308 KB Output is correct
50 Correct 45 ms 3076 KB Output is correct
51 Correct 45 ms 3204 KB Output is correct
52 Correct 47 ms 4612 KB Output is correct
53 Correct 46 ms 4740 KB Output is correct
54 Correct 20 ms 2180 KB Output is correct
55 Correct 43 ms 4232 KB Output is correct
56 Correct 46 ms 5248 KB Output is correct