oj.uz

답안 #828081

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
828081 2023-08-17T03:54:24 Z tfgs JJOOII 2 (JOI20_ho_t2) C++17
0 / 100
 0 ms 212 KB 
#include <bits/stdc++.h>
using namespace std;
using pll = pair<long long, long long>;
#define ll long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
#define vi vector<ll>
#define vb vector<bool>
#define f0(i,a) for(ll i=0;i<(a);i++)
#define f1(i,a) for(ll i=1;i<(a);i++)
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
#define f first
#define s second
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
// http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2016/p0200r0.html
template<class Fun> class y_combinator_result {
    Fun fun_;
public:
    template<class T> explicit y_combinator_result(T &&fun): fun_(std::forward<T>(fun)) {}
    template<class ...Args> decltype(auto) operator()(Args &&...args) { return fun_(std::ref(*this), std::forward<Args>(args)...); }
};
template<class Fun> decltype(auto) y_combinator(Fun &&fun) { return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun)); }
#ifdef I_AM_NOOB
#define gg(...) [](const auto&...x){ char c='='; cerr<<#__VA_ARGS__; ((cerr<<exchange(c,',')<<x),...); cerr<<endl; }(__VA_ARGS__);
#else
#define gg(...) 777771449
#endif

constexpr ll INFF = 1e18;
constexpr ll P = 1e9+7;
// constexpr ll P = 998244353;

int main() {
    cin.tie(0) -> ios::sync_with_stdio(0);
    
    ll n, k; while (cin >> n >> k) {
        string s; cin >> s;
        deque<ll> J, O, I;
        f0(i, n) {
            if (s[i] == 'J') J.pb(i);
            if (s[i] == 'O') O.pb(i);
            if (s[i] == 'I') I.pb(i);
        }
        // if (J.size() < k || O.size() < k || I.size() < k) {
            // cout << -1 << endl;
            // continue;
        // }
        ll ans = INFF;
        for (ll i = k-1; i < J.size(); i++) {
            while (!O.empty() && O.front() < J[i]) O.pop_front();
            if (O.size() < k) continue;
            while (!I.empty() && I.front() < O[k-1]) I.pop_front();
            ans = min(ans, I[k-1] - J[i-k+1] + 1 - 3*k);

            // if (J[l+k-1] > O[i-k+1]) continue;
            // // gg(i);
            // while (l+1+k-1 < J.size() && J[l+1+k-1] < O[i-k+1]) ++l;
            // if (q.size() > 0) {
                // gg(q.front());
                // gg(q.size());
            // }
            // while (q.size() > 0 && I[q.front()] < O[i]) {
                // gg(q.front(), i);
                // q.pop();
            // }

            // while (r < I.size() && q.size() < k) {
                // if (I[r] > O[i]) {
                    // q.push(r);
                    // gg(r);
                    // // gg(r, i, q.size());
                // }
                // r++;
                // if (q.size() == k) r--;
            // }

            // if (q.size() == k) {
                // assert(J[l+k-1] < O[i-k+1]);
                // gg(I[r] - J[l] + 1 - 3*k);
                // gg(J[l] ,I[r]);
                // ans = min(ans, I[r] - J[l] + 1 - 3*k);
            // }
        }

        cout << (ans == INFF ? -1 : ans) << endl;
    } 
    
    return 0;
}

Compilation message

ho_t2.cpp: In function 'int main()':
ho_t2.cpp:53:28: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::deque<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |         for (ll i = k-1; i < J.size(); i++) {
      |                          ~~^~~~~~~~~~
ho_t2.cpp:55:26: warning: comparison of integer expressions of different signedness: 'std::deque<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   55 |             if (O.size() < k) continue;
      |                 ~~~~~~~~~^~~

Subtask #1
0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Incorrect 0 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Incorrect 0 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 87.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Incorrect 0 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -