oj.uz

Submission #540929

# Submission time Handle Problem Language Result Execution time Memory
540929 2022-03-22T02:34:54 Z LittleCube JJOOII 2 (JOI20_ho_t2) C++14
0 / 100
 0 ms 212 KB 
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define F first
#define S second
using namespace std;

int N, K, J[200005], O[200005], I[200005];
int ans = 1e6;
char S[200005];

signed main()
{
    cin >> N >> K;
    for (int i = 1; i <= N; i++)
        cin >> S[i];
    deque<int> dq;
    J[N + 1] = O[N + 1] = I[N + 1] = N + 1;
    for (int i = N; i >= 1; i--)
    {
        if (S[i] == 'I')
            dq.emplace_front(i);
        if (dq.size() > K)
            dq.pop_back();
        if (dq.size() == K)
            I[i] = dq.back();
        else
            I[i] = N + 1;
        I[i] = min(I[i], I[i + 1]);
    }
    dq.clear();
    for (int i = N; i >= 1; i--)
    {
        if (S[i] == 'O')
            dq.emplace_front(i);
        if (dq.size() > K)
            dq.pop_back();
        if (dq.size() == K)
            O[i] = I[dq.back()];
        else
            O[i] = N + 1;
        O[i] = min(O[i], O[i + 1]);
    }
    dq.clear();
    for (int i = N; i >= 1; i--)
    {
        if (S[i] == 'J')
            dq.emplace_front(i);
        if (dq.size() > K)
            dq.pop_back();
        if (dq.size() == K)
            J[i] = I[dq.back()];
        else
            J[i] = N + 1;
        if (J[i] <= N)
            ans = min(ans, J[i] - i + 1 - K * 3);
    }
    for (int i = 1; i <= N; i++)
        cout << J[i] << " " << O[i] << " " << I[i] << '\n';
        cout << (ans > N ? -1 : ans) << '\n';
}

Compilation message

ho_t2.cpp: In function 'int main()':
ho_t2.cpp:24:23: warning: comparison of integer expressions of different signedness: 'std::deque<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   24 |         if (dq.size() > K)
      |             ~~~~~~~~~~^~~
ho_t2.cpp:26:23: warning: comparison of integer expressions of different signedness: 'std::deque<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   26 |         if (dq.size() == K)
      |             ~~~~~~~~~~^~~~
ho_t2.cpp:37:23: warning: comparison of integer expressions of different signedness: 'std::deque<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   37 |         if (dq.size() > K)
      |             ~~~~~~~~~~^~~
ho_t2.cpp:39:23: warning: comparison of integer expressions of different signedness: 'std::deque<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   39 |         if (dq.size() == K)
      |             ~~~~~~~~~~^~~~
ho_t2.cpp:50:23: warning: comparison of integer expressions of different signedness: 'std::deque<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   50 |         if (dq.size() > K)
      |             ~~~~~~~~~~^~~
ho_t2.cpp:52:23: warning: comparison of integer expressions of different signedness: 'std::deque<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   52 |         if (dq.size() == K)
      |             ~~~~~~~~~~^~~~
ho_t2.cpp:59:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   59 |     for (int i = 1; i <= N; i++)
      |     ^~~
ho_t2.cpp:61:9: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   61 |         cout << (ans > N ? -1 : ans) << '\n';
      |         ^~~~

Subtask #1
0 / 1.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 87.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -