oj.uz

Submission #956135

# Submission time Handle Problem Language Result Execution time Memory
956135 2024-04-01T07:07:02 Z samvar_0907 JJOOII 2 (JOI20_ho_t2) C++17
13 / 100
 2000 ms 1312 KB 
#include<bits/stdc++.h>
using namespace std;

int main(){

    // Input : n - length,  k - level, s - string
    int n, k;
    cin >> n >> k;
    std::string s;
    cin >> s;

    // Target string
    std::string opt = "";
    for(int i = 0; i < k; i++){
        opt += 'J';
    }
    for(int i = 0; i < k; i++){
        opt += 'O';
    }
    for(int i = 0; i < k; i++){
        opt += 'I';
    }
    
    int ans = INT_MAX; // since we want the minimum operations, this is max 
                       // so that any min(ans, mismatch) will decrease it
                       // if it doesnt (at end) we know that the output cant be reached 

    for (int i = 0; i <= n; i++){
        if (s[i] == 'J'){    // j is the character with which opt has to begin 
            int pointer = 0;
            int mismatch = 0;
            for (int j = i; j <= n; j++){
                if (s[j] == opt[pointer]){  // match
                    pointer++;
                }
                else{
                    mismatch++; // mismatch
                }
                if (pointer == 3*k){          // end of the string
                    ans = min(ans, mismatch);
                    break;
                } 
            }
        }
    }    
    if (ans == INT_MAX){   // no min could take place as pointer didnt reach 3k 
        cout << -1;
    }
    else{
        cout << ans;
    }
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 0 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 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 440 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 0 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 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 440 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 2 ms 444 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 1 ms 436 KB Output is correct
24 Correct 3 ms 348 KB Output is correct
25 Correct 3 ms 348 KB Output is correct
26 Correct 2 ms 348 KB Output is correct
27 Correct 2 ms 348 KB Output is correct
28 Correct 2 ms 348 KB Output is correct
29 Correct 2 ms 348 KB Output is correct
30 Correct 2 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 2 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 3 ms 600 KB Output is correct
35 Correct 3 ms 348 KB Output is correct

Subtask #3
0 / 87.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 0 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 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 440 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 2 ms 444 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 1 ms 436 KB Output is correct
24 Correct 3 ms 348 KB Output is correct
25 Correct 3 ms 348 KB Output is correct
26 Correct 2 ms 348 KB Output is correct
27 Correct 2 ms 348 KB Output is correct
28 Correct 2 ms 348 KB Output is correct
29 Correct 2 ms 348 KB Output is correct
30 Correct 2 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 2 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 3 ms 600 KB Output is correct
35 Correct 3 ms 348 KB Output is correct
36 Correct 5 ms 1108 KB Output is correct
37 Correct 7 ms 860 KB Output is correct
38 Correct 5 ms 860 KB Output is correct
39 Execution timed out 2009 ms 1312 KB Time limit exceeded
40 Halted 0 ms 0 KB -