oj.uz

답안 #959797

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
959797 2024-04-09T06:33:46 Z happy_node JJOOII 2 (JOI20_ho_t2) C++17
100 / 100
 8 ms 2268 KB 
#include <bits/stdc++.h>
using namespace std;

const int MX=2e5+5;
int N,K;
string s;

vector<int> pos[3];

int main() {
	cin.tie(0); ios_base::sync_with_stdio(0);

	cin>>N>>K;
	cin>>s;

	for(int i=0;i<N;i++) {
		if(s[i]=='J') pos[0].push_back(i);
		if(s[i]=='O') pos[1].push_back(i);
		if(s[i]=='I') pos[2].push_back(i);
	}

	int ans=2e9;
	for(int i=0;i+K-1<pos[1].size();i++) {
		int p=pos[1][i+K-1];
		auto it=upper_bound(pos[2].begin(),pos[2].end(),p)-pos[2].begin();
		if(it+K-1>=pos[2].size()) continue;
		auto it2=lower_bound(pos[0].begin(),pos[0].end(),pos[1][i])-pos[0].begin();
		if(it2==0) continue;
		it2--;
		if(it2-K+1<0) continue;
		ans=min(ans,pos[2][it+K-1]-pos[0][it2-K+1]+1-3*K);
	}

	if(ans==2e9) {
		cout<<-1<<'\n';
		return 0;
	}
	cout<<ans<<'\n';
}

Compilation message

ho_t2.cpp: In function 'int main()':
ho_t2.cpp:23:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |  for(int i=0;i+K-1<pos[1].size();i++) {
      |              ~~~~~^~~~~~~~~~~~~~
ho_t2.cpp:26:12: warning: comparison of integer expressions of different signedness: 'long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |   if(it+K-1>=pos[2].size()) continue;
      |      ~~~~~~^~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
87.0 / 87.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 604 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 456 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 456 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 456 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 8 ms 1752 KB Output is correct
37 Correct 8 ms 1832 KB Output is correct
38 Correct 8 ms 1968 KB Output is correct
39 Correct 8 ms 2012 KB Output is correct
40 Correct 6 ms 2016 KB Output is correct
41 Correct 8 ms 2152 KB Output is correct
42 Correct 8 ms 1832 KB Output is correct
43 Correct 4 ms 1444 KB Output is correct
44 Correct 4 ms 1504 KB Output is correct
45 Correct 6 ms 2016 KB Output is correct
46 Correct 6 ms 1996 KB Output is correct
47 Correct 6 ms 2016 KB Output is correct
48 Correct 8 ms 2016 KB Output is correct
49 Correct 4 ms 1472 KB Output is correct
50 Correct 6 ms 1932 KB Output is correct
51 Correct 6 ms 2012 KB Output is correct
52 Correct 3 ms 1640 KB Output is correct
53 Correct 4 ms 1748 KB Output is correct
54 Correct 4 ms 2020 KB Output is correct
55 Correct 3 ms 2268 KB Output is correct
56 Correct 3 ms 2020 KB Output is correct