oj.uz

답안 #288864

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
288864 2020-09-02T02:57:43 Z luysasg JJOOII 2 (JOI20_ho_t2) C++17
13 / 100
 2000 ms 1420 KB 
#include <bits/stdc++.h>
using namespace std;
int main(){
	vector <int> resp;
	int n, k;
	string s;
	cin >> n >> k;
	cin >> s;
	for(int i=0;i<s.size();i++){
		if(s[i]=='J'){
			int cont=0, aux=-1, sai=0;
			cont++;
			for(int j=i+1;j<s.size();j++){
				//cout << "inf: " << j << " " << s[j] << " " << cont << endl;
				if(cont<k && s[j]=='J'){
					//cout << "aq1" << endl;
					cont++;
				}
				else if(cont>=k && cont<2*k && s[j]=='O'){
					//cout << "aq2" << endl;
					cont++;
				}
				else if(cont>=2*k && cont<3*k && s[j]=='I'){
					//cout << "aq3" << endl;
					cont++;
					if(cont==3*k){
						aux=1;
						break;
					}
				}
				else{
				//	cout << j << endl;
					sai++;
				}
			}
			if(aux==1){
				resp.push_back(sai);
			}
		}
	}
	if(resp.size()==0){
		cout << "-1" << endl;
	}
	else{
		sort(resp.begin(), resp.end());
			cout << resp[0] << endl;
	}
}

Compilation message

ho_t2.cpp: In function 'int main()':
ho_t2.cpp:9:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |  for(int i=0;i<s.size();i++){
      |              ~^~~~~~~~~
ho_t2.cpp:13:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |    for(int j=i+1;j<s.size();j++){
      |                  ~^~~~~~~~~

Subtask #1
1.0 / 1.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
0 / 87.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 288 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 360 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 4 ms 288 KB Output is correct
22 Correct 4 ms 256 KB Output is correct
23 Correct 2 ms 256 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 4 ms 384 KB Output is correct
27 Correct 4 ms 384 KB Output is correct
28 Correct 4 ms 256 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 5 ms 512 KB Output is correct
31 Correct 1 ms 256 KB Output is correct
32 Correct 4 ms 256 KB Output is correct
33 Correct 5 ms 384 KB Output is correct
34 Correct 5 ms 384 KB Output is correct
35 Correct 6 ms 384 KB Output is correct
36 Correct 14 ms 1068 KB Output is correct
37 Correct 15 ms 1420 KB Output is correct
38 Correct 15 ms 1420 KB Output is correct
39 Execution timed out 2064 ms 896 KB Time limit exceeded
40 Halted 0 ms 0 KB -