# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1115034 | AdamGS | JJOOII 2 (JOI20_ho_t2) | C++17 | 1 ms | 336 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int n, k;
string wzor, word;
int min_dlug(int ind){
int dlugosc = 0, ind_pomoc = 1, min_dlugosc = 200001, druga_dlugosc = 200001;
bool nie_wywolane = true;
while(ind < n){
ind++;
if(nie_wywolane && ind_pomoc > k && word[ind] == 'J'){
nie_wywolane = false;
druga_dlugosc = min_dlug(ind);
}
if(word[ind] == wzor[ind_pomoc]){
ind_pomoc++;
if(ind_pomoc == k * 3){
return min(dlugosc, druga_dlugosc);
}
}else{
dlugosc++;
}
}
if(nie_wywolane){
druga_dlugosc = -1;
}
return min(-1, druga_dlugosc);
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k;
cin >> word;
for(int i = 0; i < k; i++){
wzor += "J";
}
for(int i = 0; i < k; i++){
wzor += "O";
}
for(int i = 0; i < k; i++){
wzor += "I";
}
int index_1 = 0;
while(word[index_1] != 'J'){
index_1++;
}
cout << min_dlug(index_1);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |