제출 #314356

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
314356		aZvezda	JJOOII 2 (JOI20_ho_t2)	C++14	100 / 100	11 ms	5940 KiB

ho_t2

#include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize ("O3")
//#pragma GCC target ("sse4")
#define endl "\n"
typedef long long ll;
template<class T, class T2> inline ostream &operator <<(ostream &out, const pair<T, T2> &x) { out << x.first << " " << x.second; return out;}
template<class T, class T2> inline istream &operator >>(istream &in, pair<T, T2> &x) { in >> x.first >> x.second; return in;}
template<class T, class T2> inline bool chkmax(T &x, const T2 &y) { return x < y ? x = y, 1 : 0; }
template<class T, class T2> inline bool chkmin(T &x, const T2 &y) { return x > y ? x = y, 1 : 0; }
const ll mod = 1e9 + 7;
#define out(x) "{" << (#x) << ": " << x << "} "

const ll MAX_N = 2e5 + 10;
ll n, k;
string in;
ll dp[4][MAX_N];

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
	cin >> n >> k >> in;
	string JOI = "#JOI";
	for(ll j = 1; j <= 3; j ++) {
		dp[j][0] = mod;
		deque<ll> dq;
		for(ll i = 1; i <= n; i ++) {
			char curr = in[i - 1];
			if(curr == JOI[j]) {
				dq.push_back(i);
			}		
			while(dq.size() > k) {
				dq.pop_front();
			}
			dp[j][i] = dp[j][i - 1] + 1;
			if(dq.size() == k) {
				chkmin(dp[j][i], i - dq.front() + 1 - k + dp[j - 1][dq.front() - 1]);
			}
		}
	}
	ll ret = mod;
	for(ll i = 0; i <= n; i ++) {
		chkmin(ret, dp[3][i]);
	}
	if(ret < MAX_N) {
		cout << ret << endl;
	} else {
		cout << -1 << endl;
	}
    return 0;
}

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

ho_t2.cpp: In function 'int main()':
ho_t2.cpp:31:20: warning: comparison of integer expressions of different signedness: 'std::deque<long long int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   31 |    while(dq.size() > k) {
      |          ~~~~~~~~~~^~~
ho_t2.cpp:35:17: warning: comparison of integer expressions of different signedness: 'std::deque<long long int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   35 |    if(dq.size() == k) {
      |       ~~~~~~~~~~^~~~

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