제출 #876635

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
876635		efedmrlr	JJOOII 2 (JOI20_ho_t2)	C++17	100 / 100	14 ms	4108 KiB

ho_t2

#include <bits/stdc++.h>

using namespace std;

#define n_l '\n'
#define dbg(...) cout << "[" << #__VA_ARGS__ << "]: "; cout << to_string(__VA_ARGS__) << endl
template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)),  __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); } 
#define dbgm(...) cout << "[" << #__VA_ARGS__ << "]: "; dbgm(__VA_ARGS__); cout << endl


#define lli long long int
#define MP make_pair
#define pb push_back
#define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)

void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
}


const double EPS = 0.00001;
const int INF = 1e9+500;
const int N = 3e5+5;
const int ALPH = 26;
const int LGN = 25;
const int MOD = 1e9+7;
int n,k,q;
string s;
vector<int> a;
vector<int> dp[3];
inline void solve() {
    cin>>n>>k;
    cin>>s;
    a.resize(n + 2);
    for(int i = 0; i<n; i++) {
        if(s[i] == 'J') a[i + 1] = 0;
        if(s[i] == 'O') a[i + 1] = 1;
        if(s[i] == 'I') a[i + 1] = 2;
    }
    for(int i = 0; i<3; i++) dp[i].assign(n+3, -1);
    for(int c = 0; c<1; c++) {
        int x = 0;
        int ind = 1;
        int cnt = 0;
        for(; ind<=n; ind++) {
            if(a[ind] == c) cnt++;
            if(cnt == k) break;
        }
        while(x + 1 <= n && a[x + 1] != c) {
            x++;
        }
        dp[c][ind] = x;
        ind++;
        for(; ind<=n; ind++) {
            dp[c][ind] = dp[c][ind - 1];
            if(a[ind] == c) {
                x++;
                while(x + 1 <= n && a[x + 1] != c) {
                x++;
                }
                dp[c][ind] = x;
            } 
        }
    }
    for(int c = 1; c<3; c++) {
        int x = 0;
        int ind = 1;
        int cnt = 0;
        for(; ind <= n; ind++) {
            if(a[ind] == c) cnt++;
            if(cnt == k) break;
        }
        while(x + 1 <= n && a[x + 1] != c) {
            x++;
        }
        dp[c][ind] = dp[c - 1][x];
        ind++;
        for(; ind <= n; ind++) {
            dp[c][ind] = dp[c][ind - 1];
            if(a[ind] == c) {
                x++;
                while(x + 1 <= n && a[x + 1] != c) {
                    x++;
                }
                dp[c][ind] = dp[c - 1][x];
            }
        }
    }
    int ans = -1;
    for(int i = 1; i<=n; i++) {
        if(dp[2][i] == -1) continue;
        ans = max(ans , dp[2][i] + (n - i));
    }
    if(ans == -1) cout<<ans<<"\n";
    else cout<<n - 3*k - ans<<"\n";

    
   

}
 
signed main() {
    //fastio();
    int test = 1;
    //cin>>test;
    while(test--) {
        solve();
    }
    
}

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

ho_t2.cpp: In function 'std::string to_string(std::string, int, int)':
ho_t2.cpp:7:208: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 | template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)),  __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); }
      |                                                                                                                                                                                                             ~~~^~~~~~~~~~

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