oj.uz

답안 #364237

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
364237 2021-02-08T13:18:09 Z Lam_lai_cuoc_doi JJOOII 2 (JOI20_ho_t2) C++17
100 / 100
 10 ms 3764 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;

const bool typetest = 0;
const int N = 2e5 + 5;
const int Inf = 1e9 + 7;
int n, k;
string s;
int J[N], I[N];
vector<pair<int, int>> O;
vector<int> a;

void Read()
{
    cin >> n >> k;
    cin >> s;
    s = " " + s;
}

void Solve()
{
    fill_n(J, N, Inf);
    fill_n(I, N, Inf);
    for (int i = 1; i <= n; ++i)
    {
        J[i] = min(J[i], J[i - 1] + 1);
        if (s[i] == 'J')
        {
            a.push_back(i);
            if (a.size() >= k)
                J[i] = min(J[i], i - a[a.size() - k] + 1 - k);
        }
    }
    a.clear();
    for (int i = n; i; --i)
    {
        I[i] = min(I[i], I[i + 1] + 1);
        if (s[i] == 'I')
        {
            a.push_back(i);
            if (a.size() >= k)
                I[i] = min(I[i], a[a.size() - k] - i + 1 - k);
        }
    }
    a.clear();
    for (int i = 1; i <= n; ++i)
        if (s[i] == 'O')
        {
            a.push_back(i);
            if (a.size() >= k)
                O.push_back({a[a.size() - k], i});
        }
    int ans(Inf);
    for (auto i : O)
        ans = min(ans, J[i.first - 1] + i.second - i.first + 1 - k + I[i.second + 1]);
    cout << (ans == Inf ? -1 : ans);
}

int32_t main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t(1);
    if (typetest)
        cin >> t;
    for (int _ = 1; _ <= t; ++_)
    {
        Read();
        Solve();
    }
}

Compilation message

ho_t2.cpp: In function 'void Solve()':
ho_t2.cpp:33:26: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   33 |             if (a.size() >= k)
      |                 ~~~~~~~~~^~~~
ho_t2.cpp:44:26: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   44 |             if (a.size() >= k)
      |                 ~~~~~~~~~^~~~
ho_t2.cpp:53:26: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   53 |             if (a.size() >= k)
      |                 ~~~~~~~~~^~~~

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1900 KB Output is correct
2 Correct 2 ms 1900 KB Output is correct
3 Correct 1 ms 1900 KB Output is correct
4 Correct 1 ms 1900 KB Output is correct
5 Correct 1 ms 1900 KB Output is correct
6 Correct 2 ms 1900 KB Output is correct
7 Correct 1 ms 1900 KB Output is correct
8 Correct 1 ms 1900 KB Output is correct
9 Correct 1 ms 1900 KB Output is correct
10 Correct 1 ms 1900 KB Output is correct
11 Correct 1 ms 1900 KB Output is correct
12 Correct 1 ms 1900 KB Output is correct
13 Correct 2 ms 1900 KB Output is correct
14 Correct 1 ms 1900 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1900 KB Output is correct
2 Correct 2 ms 1900 KB Output is correct
3 Correct 1 ms 1900 KB Output is correct
4 Correct 1 ms 1900 KB Output is correct
5 Correct 1 ms 1900 KB Output is correct
6 Correct 2 ms 1900 KB Output is correct
7 Correct 1 ms 1900 KB Output is correct
8 Correct 1 ms 1900 KB Output is correct
9 Correct 1 ms 1900 KB Output is correct
10 Correct 1 ms 1900 KB Output is correct
11 Correct 1 ms 1900 KB Output is correct
12 Correct 1 ms 1900 KB Output is correct
13 Correct 2 ms 1900 KB Output is correct
14 Correct 1 ms 1900 KB Output is correct
15 Correct 2 ms 1900 KB Output is correct
16 Correct 2 ms 1900 KB Output is correct
17 Correct 2 ms 1900 KB Output is correct
18 Correct 2 ms 1900 KB Output is correct
19 Correct 2 ms 1900 KB Output is correct
20 Correct 2 ms 1900 KB Output is correct
21 Correct 2 ms 1900 KB Output is correct
22 Correct 2 ms 1900 KB Output is correct
23 Correct 2 ms 1900 KB Output is correct
24 Correct 2 ms 1900 KB Output is correct
25 Correct 2 ms 2028 KB Output is correct
26 Correct 2 ms 1900 KB Output is correct
27 Correct 2 ms 1900 KB Output is correct
28 Correct 2 ms 1900 KB Output is correct
29 Correct 1 ms 1900 KB Output is correct
30 Correct 2 ms 1900 KB Output is correct
31 Correct 2 ms 1900 KB Output is correct
32 Correct 2 ms 1900 KB Output is correct
33 Correct 2 ms 1900 KB Output is correct
34 Correct 2 ms 1900 KB Output is correct
35 Correct 2 ms 1900 KB Output is correct

Subtask #3
87.0 / 87.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1900 KB Output is correct
2 Correct 2 ms 1900 KB Output is correct
3 Correct 1 ms 1900 KB Output is correct
4 Correct 1 ms 1900 KB Output is correct
5 Correct 1 ms 1900 KB Output is correct
6 Correct 2 ms 1900 KB Output is correct
7 Correct 1 ms 1900 KB Output is correct
8 Correct 1 ms 1900 KB Output is correct
9 Correct 1 ms 1900 KB Output is correct
10 Correct 1 ms 1900 KB Output is correct
11 Correct 1 ms 1900 KB Output is correct
12 Correct 1 ms 1900 KB Output is correct
13 Correct 2 ms 1900 KB Output is correct
14 Correct 1 ms 1900 KB Output is correct
15 Correct 2 ms 1900 KB Output is correct
16 Correct 2 ms 1900 KB Output is correct
17 Correct 2 ms 1900 KB Output is correct
18 Correct 2 ms 1900 KB Output is correct
19 Correct 2 ms 1900 KB Output is correct
20 Correct 2 ms 1900 KB Output is correct
21 Correct 2 ms 1900 KB Output is correct
22 Correct 2 ms 1900 KB Output is correct
23 Correct 2 ms 1900 KB Output is correct
24 Correct 2 ms 1900 KB Output is correct
25 Correct 2 ms 2028 KB Output is correct
26 Correct 2 ms 1900 KB Output is correct
27 Correct 2 ms 1900 KB Output is correct
28 Correct 2 ms 1900 KB Output is correct
29 Correct 1 ms 1900 KB Output is correct
30 Correct 2 ms 1900 KB Output is correct
31 Correct 2 ms 1900 KB Output is correct
32 Correct 2 ms 1900 KB Output is correct
33 Correct 2 ms 1900 KB Output is correct
34 Correct 2 ms 1900 KB Output is correct
35 Correct 2 ms 1900 KB Output is correct
36 Correct 8 ms 3264 KB Output is correct
37 Correct 8 ms 3764 KB Output is correct
38 Correct 8 ms 3764 KB Output is correct
39 Correct 10 ms 3376 KB Output is correct
40 Correct 8 ms 3376 KB Output is correct
41 Correct 10 ms 3376 KB Output is correct
42 Correct 8 ms 3764 KB Output is correct
43 Correct 5 ms 2924 KB Output is correct
44 Correct 7 ms 3168 KB Output is correct
45 Correct 9 ms 3288 KB Output is correct
46 Correct 10 ms 3376 KB Output is correct
47 Correct 8 ms 3396 KB Output is correct
48 Correct 8 ms 3396 KB Output is correct
49 Correct 6 ms 2804 KB Output is correct
50 Correct 8 ms 3376 KB Output is correct
51 Correct 8 ms 3376 KB Output is correct
52 Correct 7 ms 2748 KB Output is correct
53 Correct 7 ms 3124 KB Output is correct
54 Correct 7 ms 3764 KB Output is correct
55 Correct 6 ms 3124 KB Output is correct
56 Correct 5 ms 3124 KB Output is correct