oj.uz

Submission #1023718

# Submission time Handle Problem Language Result Execution time Memory
1023718 2024-07-15T05:21:21 Z vjudge1 JJOOII 2 (JOI20_ho_t2) C++17
0 / 100
 1 ms 456 KB 
#include <bits/stdc++.h>
using namespace std;// Hello world arsaoshe aneru nesi isods
const int mod = 1e9+7; const char nl = '\n'; typedef long long ll; const int N = 1e5 + 5 ;
#define ff first 
#define ss second

void void_code () { 
	ll n; cin>>  n; ll k;cin >> k;
	string s; cin >> s ;
	ll l = - 1 ;
	ll  r = n;
	for ( int i =0 ; i < n; i++ ) {
		if ( s [ i ] == 'J' ) {
			l = i ;
			break;
		}
	}
	for ( int i = n - 1 ; i >= 0 ; i++ ) {
		if ( s [ i ] == 'I' ) {
			r = i ;
			break;
		}
	}
	ll res = 0 ;
	ll cnt = 0 ; 
	ll ans = 1 ;
	ll ch = 0 ;
	vector < char > v ;
	v . push_back ( 'J' ) ;
	v . push_back ( 'O' ) ;
	v . push_back ( 'I' ) ;
	for ( int i = l ; i <= r ; i ++ ) {
		for ( int j = i ; j <= r ; j ++ ) {
			if ( ans != k ) {
				if ( s [ j ] == v [ ch ]  ) {
					ans ++ ;
				}
				else {
					cnt ++ ;
				}
			}
			if ( ans == k ) {
				i = j ;
				res += cnt ;
				cnt = 0 ;
				ans = 1;
				ch ++ ;
				j = r ;
			}
		}
	}
	cout << res ;
}


signed main() {
    ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
    int t = 1;  //test 
    //~ cin >> t;
    while (t--)  void_code ();
    return 0;
}

Subtask #1
0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 0 ms 456 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 0 ms 456 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 87.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 0 ms 456 KB Output isn't correct
3 Halted 0 ms 0 KB -