oj.uz

답안 #936337

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
936337 2024-03-01T16:01:11 Z DobromirAngelov JJOOII 2 (JOI20_ho_t2) C++14
100 / 100
 9 ms 2256 KB 
#include<bits/stdc++.h>
#define endl '\n'

using namespace std;

int n,k;
string s;
vector<int> pos[3];

int bs(int x,int c)
{
    if(pos[c].back()<=x) return -1;
    int l=0,r=pos[c].size()-1;
    while(l<r)
    {
        int mid=(l+r)/2;
        if(pos[c][mid]>x) r=mid;
        else l=mid+1;
    }
    return l;
}

int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);

cin>>n>>k;
cin>>s;

for(int i=0;i<n;i++)
{
    if(s[i]=='J') pos[0].push_back(i);
    if(s[i]=='O') pos[1].push_back(i);
    if(s[i]=='I') pos[2].push_back(i);
}

if(pos[0].size()<k || pos[1].size()<k || pos[2].size()<k)
{
    cout<<-1<<endl;
    return 0;
}

int ans=n+1;
for(int i=k-1;i<pos[0].size();i++)
{
    int cur=pos[0][i]-pos[0][i-k+1]+1-k;
    int ind=bs(pos[0][i],1);
    if(ind==-1 || ind>pos[1].size()-k) break;
    cur+=pos[1][ind]-pos[0][i]-1;
    cur+=pos[1][ind+k-1]-pos[1][ind]+1-k;
    int ind2=bs(pos[1][ind+k-1],2);
    if(ind2==-1 || ind2>pos[2].size()-k) break;
    cur+=pos[2][ind2]-pos[1][ind+k-1]-1;
    cur+=pos[2][ind2+k-1]-pos[2][ind2]+1-k;
    ans=min(ans, cur);
}

if(ans>n) cout<<-1<<endl;
else cout<<ans<<endl;

return 0;
}

Compilation message

ho_t2.cpp: In function 'int main()':
ho_t2.cpp:39:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   39 | if(pos[0].size()<k || pos[1].size()<k || pos[2].size()<k)
      |    ~~~~~~~~~~~~~^~
ho_t2.cpp:39:36: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   39 | if(pos[0].size()<k || pos[1].size()<k || pos[2].size()<k)
      |                       ~~~~~~~~~~~~~^~
ho_t2.cpp:39:55: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   39 | if(pos[0].size()<k || pos[1].size()<k || pos[2].size()<k)
      |                                          ~~~~~~~~~~~~~^~
ho_t2.cpp:46:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 | for(int i=k-1;i<pos[0].size();i++)
      |               ~^~~~~~~~~~~~~~
ho_t2.cpp:50:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |     if(ind==-1 || ind>pos[1].size()-k) break;
      |                   ~~~^~~~~~~~~~~~~~~~
ho_t2.cpp:54:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |     if(ind2==-1 || ind2>pos[2].size()-k) break;
      |                    ~~~~^~~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 344 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 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 344 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 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 452 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 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 344 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 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 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 456 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct

Subtask #3
87.0 / 87.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 344 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 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 452 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 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 344 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 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 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 456 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 8 ms 1748 KB Output is correct
37 Correct 9 ms 1832 KB Output is correct
38 Correct 9 ms 1972 KB Output is correct
39 Correct 8 ms 2124 KB Output is correct
40 Correct 5 ms 2016 KB Output is correct
41 Correct 7 ms 1952 KB Output is correct
42 Correct 9 ms 1816 KB Output is correct
43 Correct 2 ms 1404 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 2124 KB Output is correct
47 Correct 3 ms 2012 KB Output is correct
48 Correct 3 ms 2016 KB Output is correct
49 Correct 3 ms 1448 KB Output is correct
50 Correct 4 ms 2256 KB Output is correct
51 Correct 3 ms 2004 KB Output is correct
52 Correct 3 ms 1632 KB Output is correct
53 Correct 3 ms 1748 KB Output is correct
54 Correct 4 ms 2020 KB Output is correct
55 Correct 3 ms 2008 KB Output is correct
56 Correct 2 ms 2020 KB Output is correct