oj.uz

답안 #1033317

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1033317 2024-07-24T16:27:09 Z vjudge1 JJOOII 2 (JOI20_ho_t2) C++17
100 / 100
 9 ms 2156 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end() 
#define MOD 1000000007
 
typedef long long ll;
typedef pair <int, int> ii;
typedef pair <ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef long double ld;
 
ll INF=LLONG_MAX;
 
int const mxn=2e5+5;
vi dp[3];
 
int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    int n,k; string s;
    cin >> n >> k >> s;
    for(int i=0; i<n; i++){
        if(s[i]=='J')dp[0].pb(i);
        else if(s[i]=='O')dp[1].pb(i);
        else dp[2].pb(i);
    }
    int ans=1e9;
    for(int i=0; i<(int)dp[0].size()-k+1; i++){
        int posini = dp[0][i];
        int posj = dp[0][i+k-1];
        int poso = upper_bound(all(dp[1]),posj)-dp[1].begin();
        if(poso==(int)dp[1].size())break;
        poso += k-1; 
        if(poso>=(int)dp[1].size())break;
        poso = dp[1][poso];
        int posi = upper_bound(all(dp[2]),poso)-dp[2].begin();
        if(posi==(int)dp[2].size())break;
        posi += k-1;
        if(posi>=(int)dp[2].size())break;
        posi = dp[2][posi];
        ans = min(ans, posi-posini+1-k*3);
    }
    
    if(ans==1e9)ans=-1;
    cout << ans << endl;
}

Subtask #1
1.0 / 1.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
87.0 / 87.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 452 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 6 ms 1752 KB Output is correct
37 Correct 7 ms 1912 KB Output is correct
38 Correct 9 ms 1972 KB Output is correct
39 Correct 6 ms 1996 KB Output is correct
40 Correct 4 ms 2140 KB Output is correct
41 Correct 5 ms 1956 KB Output is correct
42 Correct 6 ms 1832 KB Output is correct
43 Correct 2 ms 1464 KB Output is correct
44 Correct 2 ms 1504 KB Output is correct
45 Correct 3 ms 2016 KB Output is correct
46 Correct 3 ms 2008 KB Output is correct
47 Correct 4 ms 2156 KB Output is correct
48 Correct 4 ms 2156 KB Output is correct
49 Correct 2 ms 1472 KB Output is correct
50 Correct 3 ms 2140 KB Output is correct
51 Correct 3 ms 2004 KB Output is correct
52 Correct 2 ms 1632 KB Output is correct
53 Correct 3 ms 1748 KB Output is correct
54 Correct 4 ms 2004 KB Output is correct
55 Correct 3 ms 2108 KB Output is correct
56 Correct 2 ms 2012 KB Output is correct