oj.uz

답안 #957292

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
957292 2024-04-03T12:17:32 Z aaron_dcoder JJOOII 2 (JOI20_ho_t2) C++17
100 / 100
 12 ms 3388 KB 
#define NDEBUG


#ifdef NDEBUG
#define dbg(TXTMSG) if constexpr (false) cerr << "lol"
#define dbgv(VARN) ((void)0)
#define dbgfor(COND) if constexpr (false) for (COND)

#else
#define _GLIBCXX_DEBUG 1
#define _GLIBCXX_DEBUG_PEDANTIC 1
#pragma GCC optimize("trapv")
#define dbg(TXTMSG) cerr << "\n" << TXTMSG
#define dbgv(VARN) cerr << "\n" << #VARN << " = "<< VARN << ", line " << __LINE__ << "\n"
#define dbgfor(COND) for (COND)

#endif

#include <bits/stdc++.h>
using namespace std;
using ll = long long; 
using pll = pair<ll,ll>;
#define e0 first
#define e1 second
constexpr ll INFTY = 2e18;

int main()
{
	ll N,K;
	cin >> N >> K;

	string S;
	cin >> S;

	vector<ll> Js;
	vector<ll> Os;
	vector<ll> Is;

	for (ll i = 0; i < N; ++i)
	{
		if (S[i]=='J')
		{
			Js.push_back(i);
		}
		else if (S[i]=='O')
		{
			Os.push_back(i);
		}
		else
		{
			assert(S[i]=='I');
			Is.push_back(i);
		}
	}

	ll outp=INFTY;

	for (ll i = 0; i+K <= ll(Js.size()); ++i)
	{
		ll jidx = i+K-1;

		ll oidx = lower_bound(Os.cbegin(),Os.cend(), Js[jidx])-Os.cbegin()+K-1;
		if (ll(Os.size())<=oidx) break;
		ll iidx = lower_bound(Is.cbegin(), Is.cend(), Os[oidx])-Is.cbegin()+K-1;
		if (ll(Is.size())<=iidx) break;

		outp = min(outp,Is[iidx]-Js[i]+1);
	}

	cout << ((outp==INFTY)?-1:(outp-3*K)) << "\n";
}

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 432 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 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 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 1 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 432 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 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 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 1 ms 348 KB Output is correct
18 Correct 1 ms 600 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 1 ms 344 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 348 KB Output is correct
26 Correct 0 ms 600 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 436 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 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 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 432 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 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 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 1 ms 348 KB Output is correct
18 Correct 1 ms 600 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 1 ms 344 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 348 KB Output is correct
26 Correct 0 ms 600 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 436 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 10 ms 2512 KB Output is correct
37 Correct 12 ms 2880 KB Output is correct
38 Correct 11 ms 2876 KB Output is correct
39 Correct 10 ms 2792 KB Output is correct
40 Correct 7 ms 2900 KB Output is correct
41 Correct 9 ms 3036 KB Output is correct
42 Correct 11 ms 3104 KB Output is correct
43 Correct 5 ms 1860 KB Output is correct
44 Correct 5 ms 2136 KB Output is correct
45 Correct 6 ms 2972 KB Output is correct
46 Correct 6 ms 2968 KB Output is correct
47 Correct 6 ms 3032 KB Output is correct
48 Correct 6 ms 2972 KB Output is correct
49 Correct 4 ms 1992 KB Output is correct
50 Correct 8 ms 3000 KB Output is correct
51 Correct 6 ms 3028 KB Output is correct
52 Correct 5 ms 2508 KB Output is correct
53 Correct 6 ms 2944 KB Output is correct
54 Correct 7 ms 3300 KB Output is correct
55 Correct 6 ms 3300 KB Output is correct
56 Correct 5 ms 3388 KB Output is correct