oj.uz

답안 #486249

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
486249 2021-11-11T03:24:25 Z PoPularPlusPlus JJOOII 2 (JOI20_ho_t2) C++17
100 / 100
 10 ms 2004 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long 
#define pb(e) push_back(e)
#define sv(a) sort(a.begin(),a.end())
#define sa(a,n) sort(a,a+n)
#define mp(a,b) make_pair(a,b)
#define vf first
#define vs second
#define ar array
#define all(x) x.begin(),x.end()
const int inf = 0x3f3f3f3f;
const int mod = 1000000007; 
const double PI=3.14159265358979323846264338327950288419716939937510582097494459230;
bool remender(ll a , ll b){return a%b;}

void solve(){
	int n , k;
	cin >> n >> k;
	string s;
	cin >> s;
	int cnt = 0;
	char c = 'J';
	vector<int> v[3];
	for(int i = 0; i < n; i++){
		if(s[i] == 'J')v[0].pb(i);
		else if(s[i] == 'O')v[1].pb(i);
		else v[2].pb(i);
		if(c == s[i] && c != 'a'){
			cnt++;
			if(cnt == k){
				cnt = 0;
				if(c == 'I'){
					c = 'a';
				}
				if(c == 'O')c = 'I';
				if(c == 'J')c = 'O';
			}
		}
	}
	if(c == 'a'){
		int ans = 1e9;
		for(int i = 0; i+(k-1) < (int)v[0].size(); i++){
			int last = v[0][i + (k-1)];
			int p = upper_bound(all(v[1]) , last) - v[1].begin();
			if(p + (k - 1) < (int)v[1].size()){
				p = upper_bound(all(v[2]) , v[1][p + (k-1)]) - v[2].begin();
				if(p + (k-1) < (int)v[2].size()){
					last = v[2][p + (k-1)];
					ans = min(ans , (last - v[0][i] + 1) - 3 * k);
				}
			}
		}
		cout << ans << '\n';
	}
	else {
		cout << -1 << '\n';
	}
}

int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
	//int t;cin >> t;while(t--)
	solve();
	return 0;
}

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 312 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 308 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 312 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 308 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 0 ms 332 KB Output is correct
28 Correct 0 ms 332 KB Output is correct
29 Correct 0 ms 332 KB Output is correct
30 Correct 0 ms 332 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct

Subtask #3
87.0 / 87.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 312 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 308 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 0 ms 332 KB Output is correct
28 Correct 0 ms 332 KB Output is correct
29 Correct 0 ms 332 KB Output is correct
30 Correct 0 ms 332 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 8 ms 1608 KB Output is correct
37 Correct 9 ms 1816 KB Output is correct
38 Correct 9 ms 1956 KB Output is correct
39 Correct 8 ms 1968 KB Output is correct
40 Correct 7 ms 2000 KB Output is correct
41 Correct 8 ms 1940 KB Output is correct
42 Correct 10 ms 1816 KB Output is correct
43 Correct 4 ms 1260 KB Output is correct
44 Correct 5 ms 1488 KB Output is correct
45 Correct 6 ms 2000 KB Output is correct
46 Correct 6 ms 1992 KB Output is correct
47 Correct 7 ms 2000 KB Output is correct
48 Correct 6 ms 2000 KB Output is correct
49 Correct 2 ms 1328 KB Output is correct
50 Correct 3 ms 1988 KB Output is correct
51 Correct 3 ms 2000 KB Output is correct
52 Correct 4 ms 1640 KB Output is correct
53 Correct 4 ms 1732 KB Output is correct
54 Correct 4 ms 2004 KB Output is correct
55 Correct 3 ms 2004 KB Output is correct
56 Correct 2 ms 2004 KB Output is correct