Submission #1048865

#TimeUsernameProblemLanguageResultExecution timeMemory
1048865MinbaevJJOOII 2 (JOI20_ho_t2)C++17
13 / 100
2092 ms1116 KiB
#include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #pragma GCC target("avx,avx2,fma") #pragma GCC optimize("Ofast,unroll-loops") using namespace std; using namespace __gnu_pbds; #define pb push_back #define all(x) x.begin(),x.end() #define rall(x) x.rbegin(),x.rend() #define f first #define s second #define int long long #define ll long long #define pii pair<int,int> #define ar array template<class T>bool umax(T &a,T b){if(a<b){a=b;return true;}return false;} template<class T>bool umin(T &a,T b){if(b<a){a=b;return true;}return false;} template<class T> using st = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>; const int inf = 1e17 + 7; const int mod = 1e9 + 7; const int N = 3e5 + 5; const int md = 998244353; int binpow(int a, int b){ if(b == 0)return 1; if(b % 2 == 0){ int c = binpow(a,b/2); return (c*c)%mod; } return (binpow(a,b-1)*a)%mod; } int divi(int a, int b){ return (a*(binpow(b,mod-2)))%mod; } int n,m,k; void solve(){ cin >> n >> m; string str, a; cin >> str; for(int i = 0;i<m;i++)a += 'J'; for(int i = 0;i<m;i++)a += 'O'; for(int i = 0;i<m;i++)a += 'I'; int ans = inf; for(int i = 0;i<n;i++){ int ind = 0; for(int j = i;j<n;j++){ if(str[j] == a[ind]){ ind += 1; if(ind == m*3){ //~ cout << i << " " << j << "\n"; umin(ans, (j-i+1)-m*3); break; } } } } if(ans == inf)ans = -1; cout << ans << "\n"; } /* 5 4 35 100 70 70 45 15 80 40 20 95 20 50 0 10 10 0 60 60 0 0 100 0 */ signed main() { // freopen("seq.in", "r", stdin); // freopen("seq.out", "w", stdout); ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL); int tt=1;//cin>>tt; while(tt--)solve(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...