oj.uz

답안 #930055

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
930055 2024-02-18T11:33:10 Z Craftless JJOOII 2 (JOI20_ho_t2) C++17
100 / 100
 1846 ms 3420 KB 
#include <bits/stdc++.h>

#define int long long int
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define pi pair<int, int>
#define INF 1e13

using namespace std;

int N, K, ans = INF;
string S;

vector<int> js, os, is;

int32_t main() {

	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);

	cin >> N >> K >> S;

	for (int i = 0; i < N; i++) {
		if (S[i] == 'J') js.pb(i);
		if (S[i] == 'O') os.pb(i);
		if (S[i] == 'I') is.pb(i);
	}

	if (K > js.size()) {
		cout << -1 << "\n";
		return 0;
	}

	for (int i = 0; i <= js.size() - K; i++) {
		int total = 0;
		int curI = js[i];
		for (int j = 0; j < K - 1; j++) {
			total += js[i + j + 1] - js[i + j] - 1;
			curI = js[i + j + 1];
		}
		int off = upper_bound(os.begin(), os.end(), curI) - os.begin();
		if (off >= os.size() or os.size() - off < K) continue;
		// cout << curI << "." << os[off] << " ";
		total += os[off] - curI - 1;
		// cout << (os.size() - off + 1) << endl;
		curI = os[off];
		for (int j = 0; j < K - 1; j++) {
			total += os[off + j + 1] - os[off + j] - 1;
			curI = os[off + j + 1];
		}
		int off2 = upper_bound(is.begin(), is.end(), curI) - is.begin();
		if (off2 >= is.size() or is.size() - off2 < K) continue;
		// cout << curI << "." << is[off2] << " ";
		total += is[off2] - curI - 1;
		// cout << "A" << total << endl;
		curI = is[off2];
		for (int j = 0; j < K - 1; j++) {
			total += is[off2 + j + 1] - is[off2 + j] - 1;
			curI = is[off2 + j + 1];
		}
		ans = min(ans, total);
	}


	cout << (ans == INF ? -1 : ans) << "\n";

	return 0;	
}

Compilation message

ho_t2.cpp: In function 'int32_t main()':
ho_t2.cpp:30:8: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |  if (K > js.size()) {
      |      ~~^~~~~~~~~~~
ho_t2.cpp:35:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'long long unsigned int' [-Wsign-compare]
   35 |  for (int i = 0; i <= js.size() - K; i++) {
      |                  ~~^~~~~~~~~~~~~~~~
ho_t2.cpp:43:11: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |   if (off >= os.size() or os.size() - off < K) continue;
      |       ~~~~^~~~~~~~~~~~
ho_t2.cpp:43:43: warning: comparison of integer expressions of different signedness: 'long long unsigned int' and 'long long int' [-Wsign-compare]
   43 |   if (off >= os.size() or os.size() - off < K) continue;
      |                           ~~~~~~~~~~~~~~~~^~~
ho_t2.cpp:53:12: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |   if (off2 >= is.size() or is.size() - off2 < K) continue;
      |       ~~~~~^~~~~~~~~~~~
ho_t2.cpp:53:45: warning: comparison of integer expressions of different signedness: 'long long unsigned int' and 'long long int' [-Wsign-compare]
   53 |   if (off2 >= is.size() or is.size() - off2 < K) continue;
      |                            ~~~~~~~~~~~~~~~~~^~~

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 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 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 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 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 452 KB Output is correct
19 Correct 1 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 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 460 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct

Subtask #3
87.0 / 87.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 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 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 452 KB Output is correct
19 Correct 1 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 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 460 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 9 ms 2504 KB Output is correct
37 Correct 9 ms 3024 KB Output is correct
38 Correct 9 ms 2868 KB Output is correct
39 Correct 478 ms 2980 KB Output is correct
40 Correct 1022 ms 3028 KB Output is correct
41 Correct 787 ms 3028 KB Output is correct
42 Correct 110 ms 3024 KB Output is correct
43 Correct 358 ms 1964 KB Output is correct
44 Correct 545 ms 2236 KB Output is correct
45 Correct 916 ms 2968 KB Output is correct
46 Correct 939 ms 2964 KB Output is correct
47 Correct 913 ms 3012 KB Output is correct
48 Correct 914 ms 2996 KB Output is correct
49 Correct 412 ms 2004 KB Output is correct
50 Correct 913 ms 2996 KB Output is correct
51 Correct 929 ms 3028 KB Output is correct
52 Correct 320 ms 2792 KB Output is correct
53 Correct 407 ms 2892 KB Output is correct
54 Correct 5 ms 3420 KB Output is correct
55 Correct 1846 ms 3292 KB Output is correct
56 Correct 3 ms 3296 KB Output is correct