oj.uz

Submission #682757

# Submission time Handle Problem Language Result Execution time Memory
682757 2023-01-17T01:00:11 Z Paul_Liao_1457 JJOOII 2 (JOI20_ho_t2) C++17
100 / 100
 10 ms 2020 KB 
//記得跳題
#include<iostream>
#include<array>
#include<vector>
#include<string>
#include<algorithm>
#include<set>
#include<queue>
#include<stack>
#include<math.h>
#include<map>
#include<unordered_map>
#include<cstring>
#include<iomanip>
#include<bitset>
#include<tuple>
 
#define ll long long
#define LL __int128_t
#define DB double
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define REP(i,a,b) for(int i=a;i>=b;i--)
#define pb push_back
#define mp make_pair
#define INF (ll)(1e9)
#define MOD (ll)(1e9+7)
#define F first
#define S second
#define endl "\n"
#define AC ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
 
using namespace std;

template<class T> using PQ=priority_queue<T,vector<T>,less<T> >;

void file(){
    freopen("/Users/liaoyunyang/Desktop/meta_in.txt","r",stdin);
    freopen("/Users/liaoyunyang/Desktop/meta_out.txt","w",stdout);
}

int a[200005],b[200005],init[200005],pre[200005],suf[200005];
map<int,int> ans;

signed main(){
    AC;
    vector<int> J,O,I;
    int n,k; cin>>n>>k;
    string s; cin>>s;
    FOR(i,0,n){
        if(s[i]=='J') J.pb(i);
        else if(s[i]=='O') O.pb(i);
        else I.pb(i);
    }
    if(J.size()<k||O.size()<k||I.size()<k){
        cout<<-1<<endl; return 0;
    }
    int ans=-1;
    for(int i=0;i<J.size()-k+1;i++){
        int l=J[i],li=J[i+k-1];
        int tmp=(int)(lower_bound(O.begin(),O.end(),li)-O.begin());
        if(tmp+k>O.size()){
            cout<<ans<<endl; return 0;
        }
        int oi=O[tmp+k-1];
        int tmp2=(int)(lower_bound(I.begin(),I.end(),oi)-I.begin());
        if(tmp2+k>I.size()){
            cout<<ans<<endl; return 0;
        }
        int r=I[tmp2+k-1];
        if(ans==-1){
            ans=r-l+1-3*k;
        }
        else{
            ans=min(ans,r-l+1-3*k);
        }
    }
    cout<<ans<<endl;
}


/*

 */

Compilation message

ho_t2.cpp: In function 'int main()':
ho_t2.cpp:54:16: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   54 |     if(J.size()<k||O.size()<k||I.size()<k){
      |        ~~~~~~~~^~
ho_t2.cpp:54:28: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   54 |     if(J.size()<k||O.size()<k||I.size()<k){
      |                    ~~~~~~~~^~
ho_t2.cpp:54:40: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   54 |     if(J.size()<k||O.size()<k||I.size()<k){
      |                                ~~~~~~~~^~
ho_t2.cpp:58:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |     for(int i=0;i<J.size()-k+1;i++){
      |                 ~^~~~~~~~~~~~~
ho_t2.cpp:61:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |         if(tmp+k>O.size()){
      |            ~~~~~^~~~~~~~~
ho_t2.cpp:66:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |         if(tmp2+k>I.size()){
      |            ~~~~~~^~~~~~~~~
ho_t2.cpp: In function 'void file()':
ho_t2.cpp:37:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |     freopen("/Users/liaoyunyang/Desktop/meta_in.txt","r",stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ho_t2.cpp:38:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |     freopen("/Users/liaoyunyang/Desktop/meta_out.txt","w",stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 328 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 0 ms 328 KB Output is correct
32 Correct 0 ms 336 KB Output is correct
33 Correct 0 ms 328 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 0 ms 328 KB Output is correct

Subtask #3
87.0 / 87.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 328 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 0 ms 328 KB Output is correct
32 Correct 0 ms 336 KB Output is correct
33 Correct 0 ms 328 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 0 ms 328 KB Output is correct
36 Correct 9 ms 1616 KB Output is correct
37 Correct 10 ms 1816 KB Output is correct
38 Correct 10 ms 1964 KB Output is correct
39 Correct 9 ms 1988 KB Output is correct
40 Correct 5 ms 2008 KB Output is correct
41 Correct 7 ms 1948 KB Output is correct
42 Correct 9 ms 1824 KB Output is correct
43 Correct 2 ms 1268 KB Output is correct
44 Correct 3 ms 1496 KB Output is correct
45 Correct 3 ms 2008 KB Output is correct
46 Correct 4 ms 2000 KB Output is correct
47 Correct 4 ms 2008 KB Output is correct
48 Correct 4 ms 2012 KB Output is correct
49 Correct 2 ms 1336 KB Output is correct
50 Correct 4 ms 1996 KB Output is correct
51 Correct 4 ms 2008 KB Output is correct
52 Correct 3 ms 1496 KB Output is correct
53 Correct 4 ms 1744 KB Output is correct
54 Correct 4 ms 2020 KB Output is correct
55 Correct 3 ms 1996 KB Output is correct
56 Correct 2 ms 2012 KB Output is correct