Submission #1115058

#TimeUsernameProblemLanguageResultExecution timeMemory
1115058staszic_ojuzJJOOII 2 (JOI20_ho_t2)C++17
0 / 100
1 ms336 KiB
#include <bits/stdc++.h> using namespace std; int n, k; string wzor, word; int min_dlug(int ind, int ind_pomoc){ int dlugosc = 0, 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, k + 1); } 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, 1); }

Compilation message (stderr)

ho_t2.cpp: In function 'int min_dlug(int, int)':
ho_t2.cpp:8:22: warning: unused variable 'min_dlugosc' [-Wunused-variable]
    8 |     int dlugosc = 0, min_dlugosc = 200001, druga_dlugosc = 200001;
      |                      ^~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...