oj.uz

답안 #532137

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
532137 2022-03-02T06:59:57 Z scottchou JJOOII 2 (JOI20_ho_t2) C++17
100 / 100
 8 ms 2176 KB 
#include<iostream>
#include<vector>
using namespace std;
vector<int> ipoint, opoint, jpoint;
int const N = 2e5 + 5;
int ov[N];
int inf = 1e9;
string s;
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n, k;
    cin >> n >> k;
    cin >> s;
    for(int i = 0; i < n; i++){
        if(s[i] == 'I'){
            ipoint.push_back(i);
        }else if(s[i] == 'O'){
            opoint.push_back(i);
        }else{
            jpoint.push_back(i);
        }
    }
    int now = ipoint.size() - 1, minn = inf;
    for(int i = opoint.size() - 1; i >= 0; i--){
        if(i < k - 1){
            ov[i] = inf;
            continue;
        }
        int p = opoint[i];
        while(now >= 0 && ipoint[now] > p){
            if(now + k - 1 <= ipoint.size() - 1){
                minn = min(minn, ipoint[now + k - 1] + 1 - k);
            }
            now--;
        }
        if(minn == inf){
            ov[i] = inf;
        }else{
            ov[i] = minn - opoint[i] - 1;
        }
    }
    int ans = inf;
    for(int i = 0; i < (int)jpoint.size() - k + 1; i++){
        int op = lower_bound(opoint.begin(), opoint.end(), jpoint[i + k - 1]) - opoint.begin();
        if(op + k - 1 >= opoint.size())
            continue;
        ans = min(ans, jpoint[i + k - 1] - jpoint[i] + 1 - k + opoint[op] - jpoint[i + k - 1] - 1 + ov[op + k - 1] + opoint[op + k - 1] - opoint[op] + 1 - k);
    }
    if(ans == inf){
        cout << -1 << '\n';
    }else{
        cout << ans << '\n';
    }
}

Compilation message

ho_t2.cpp: In function 'int main()':
ho_t2.cpp:32:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |             if(now + k - 1 <= ipoint.size() - 1){
      |                ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
ho_t2.cpp:46:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |         if(op + k - 1 >= opoint.size())
      |            ~~~~~~~~~~~^~~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
87.0 / 87.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 0 ms 320 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 324 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 324 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 324 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 320 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 324 KB Output is correct
29 Correct 1 ms 324 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 320 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 8 ms 1860 KB Output is correct
37 Correct 8 ms 2176 KB Output is correct
38 Correct 8 ms 1956 KB Output is correct
39 Correct 7 ms 1980 KB Output is correct
40 Correct 7 ms 2000 KB Output is correct
41 Correct 8 ms 1964 KB Output is correct
42 Correct 7 ms 2164 KB Output is correct
43 Correct 4 ms 1384 KB Output is correct
44 Correct 5 ms 1616 KB Output is correct
45 Correct 7 ms 2000 KB Output is correct
46 Correct 7 ms 1972 KB Output is correct
47 Correct 7 ms 2000 KB Output is correct
48 Correct 7 ms 1996 KB Output is correct
49 Correct 6 ms 1456 KB Output is correct
50 Correct 7 ms 1992 KB Output is correct
51 Correct 6 ms 1996 KB Output is correct
52 Correct 4 ms 1744 KB Output is correct
53 Correct 5 ms 2048 KB Output is correct
54 Correct 4 ms 2008 KB Output is correct
55 Correct 3 ms 1980 KB Output is correct
56 Correct 2 ms 2008 KB Output is correct