제출 #773078

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
773078		RecursiveCo	JJOOII 2 (JOI20_ho_t2)	C++14	100 / 100	12 ms	3380 KiB

ho_t2

// CF template, version 3.0

#include <bits/stdc++.h>

using namespace std;

#define improvePerformance ios_base::sync_with_stdio(false); cin.tie(0)
#define getTest int t; cin >> t
#define eachTest for (int _var=0;_var<t;_var++)
#define get(name) int (name); cin >> (name)
#define out(o) cout << (o)
#define getList(cnt, name) vector<int> (name); for (int _=0;_<(cnt);_++) { get(a); (name).push_back(a); }
#define sortl(name) sort((name).begin(), (name).end())
#define rev(name) reverse((name).begin(), (name).end())
#define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
#define decision(b) if (b){out("YES");}else{out("NO");}

#define int long long int

signed main() {
    improvePerformance;
    get(n);
    get(k);
    vector<char> str;
    vector<int> J;
    vector<int> O;
    vector<int> I;
    forto(n, i) {
        char c;
        cin >> c;
        str.push_back(c);
        if (c == 'J') J.push_back(i);
        else if (c == 'O') O.push_back(i);
        else I.push_back(i);
    }
    int ans = 1e18;
    forto(J.size() - k + 1, i) {
        int start = J[i];
        int lastJ = J[i + k - 1];
        int oind = lower_bound(O.begin(), O.end(), lastJ) - O.begin() + k - 1;
        if (oind >= O.size()) continue;
        int lastO = O[oind];

        int iind = lower_bound(I.begin(), I.end(), lastO) - I.begin() + k - 1;
        if (iind >= I.size()) continue;
        int lastI = I[iind];
        int sz = lastI - start + 1;
        ans = min(ans, sz - 3 * k);
    }
    out(ans == 1e18? -1: ans);
}

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

ho_t2.cpp: In function 'int main()':
ho_t2.cpp:10:23: warning: unnecessary parentheses in declaration of 'n' [-Wparentheses]
   10 | #define get(name) int (name); cin >> (name)
      |                       ^
ho_t2.cpp:22:5: note: in expansion of macro 'get'
   22 |     get(n);
      |     ^~~
ho_t2.cpp:10:23: warning: unnecessary parentheses in declaration of 'k' [-Wparentheses]
   10 | #define get(name) int (name); cin >> (name)
      |                       ^
ho_t2.cpp:23:5: note: in expansion of macro 'get'
   23 |     get(k);
      |     ^~~
ho_t2.cpp:15:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
ho_t2.cpp:28:5: note: in expansion of macro 'forto'
   28 |     forto(n, i) {
      |     ^~~~~
ho_t2.cpp:15:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
ho_t2.cpp:37:5: note: in expansion of macro 'forto'
   37 |     forto(J.size() - k + 1, i) {
      |     ^~~~~
ho_t2.cpp:15:52: warning: comparison of integer expressions of different signedness: 'long long int' and 'long long unsigned int' [-Wsign-compare]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                              ~~~~~~^~~~~~~~
ho_t2.cpp:37:5: note: in expansion of macro 'forto'
   37 |     forto(J.size() - k + 1, i) {
      |     ^~~~~
ho_t2.cpp:41:18: 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]
   41 |         if (oind >= O.size()) continue;
      |             ~~~~~^~~~~~~~~~~
ho_t2.cpp:45:18: 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]
   45 |         if (iind >= I.size()) continue;
      |             ~~~~~^~~~~~~~~~~

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