제출 #535741

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
535741		abc864197532	JJOOII 2 (JOI20_ho_t2)	C++17	100 / 100	33 ms	2052 KiB

ho_t2

#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define mp make_pair
#define eb emplace_back
#define pb push_back
#define pii pair<int,int>
#define X first
#define Y second
#define all(x) x.begin(), x.end()
void abc() {cout << endl;}
template <typename T, typename ...U> void abc(T i, U ...j) {
	cout << i << ' ', abc(j...);
}
template <typename T> void printv(T l, T r) {
	for (; l != r; ++l)
		cout << *l << " \n"[l + 1 == r];
}
#ifdef Doludu
#define test(x...) abc("[" + string(#x) + "]", x)
#define owo freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#else
#define test(x...) void(0)
#define owo ios::sync_with_stdio(false), cin.tie(0)
#endif

int main () {
	owo;
	int n, k;
	string s;
	cin >> n >> k >> s;
	vector <int> pos[3];
	for (int i = 0; i < n; ++i) {
		if (s[i] == 'J')
			pos[0].pb(i);
		else if (s[i] == 'O')
			pos[1].pb(i);
		else
			pos[2].pb(i);
	}
	int ans = 1 << 30;
	for (int i = 0; i < n; ++i) {
		int now = i;
		for (int j : {0, 1, 2}) {
			auto it = lower_bound(all(pos[j]), now) - pos[j].begin() + k - 1;
			if (it < pos[j].size())
				now = pos[j][it];
			else {
				now = n;
				break;
			}
		}
		if (now < n)
			ans = min(ans, now - i + 1);
	}
	cout << (ans == 1 << 30 ? -1 : ans - k * 3) << '\n';
}

컴파일 시 표준 에러 (stderr) 메시지

ho_t2.cpp: In function 'int main()':
ho_t2.cpp:46:11: warning: comparison of integer expressions of different signedness: 'long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |    if (it < pos[j].size())
      |        ~~~^~~~~~~~~~~~~~~

• Subtask 1: 1 / 1
• Subtask 2: 12 / 12
• Subtask 3: 87 / 87