oj.uz

답안 #524936

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
524936 2022-02-10T10:57:20 Z Carmel_Ab1 JJOOII 2 (JOI20_ho_t2) C++17
100 / 100
 206 ms 71196 KB 
/*
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
 */
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//using namespace __gnu_pbds;
using namespace std;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int>vi;
typedef vector<vector<int>>vvi;
typedef vector<ll>vl;
typedef vector<vl> vvl;
typedef pair<int,int>pi;
typedef pair<ll,ll> pl;
typedef vector<pl> vpl;
typedef vector<ld> vld;
typedef pair<ld,ld> pld;
typedef vector<pi> vpi;

//typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<typename T> ostream& operator<<(ostream& os, vector<T>& a){os<<"[";for(int i=0; i<ll(a.size()); i++){os << a[i] << ((i!=ll(a.size()-1)?" ":""));}os << "]\n"; return os;}

#define all(x) x.begin(),x.end()
#define YES out("YES")
#define NO out("NO")
#define out(x){cout << x << "\n"; return;}
#define outfl(x){cout << x << endl;return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
#define pb push_back
#define umap unordered_map

template<typename T1, typename T2> istream& operator>>(istream& is, pair<T1, T2>& p){is >> p.first >> p.second;return is;}
template<typename T1, typename T2> ostream& operator<<(ostream& os, pair<T1, T2>& p){os <<"" << p.first << " " << p.second << ""; return os;}
void usaco(string taskname){
    string fin = taskname + ".in";
    string fout = taskname + ".out";
    const char* FIN = fin.c_str();
    const char* FOUT = fout.c_str();
    freopen(FIN, "r", stdin);
    freopen(FOUT, "w", stdout);
}
template<typename T>
void read(vector<T>& v){
    int n=v.size();
    for(int i=0; i<n; i++)
        cin >> v[i];
}
template<typename T>
vector<T>UNQ(vector<T>a){
    vector<T>ans;
    for(T t:a)
        if(ans.empty() || t!=ans.back())
            ans.push_back(t);
    return ans;
}



void solve();
int main(){
    GLHF;
    int t=1;
    //cin >> t;
    while(t--)
        solve();
}
bool ok(string s,int k){
    int c1=0,c2=0,c3=0;
    for(int i=0; i<s.size(); i++)
        if(c1<k && s[i]=='J')
            c1++;
        else if(c1==k && c2<k && s[i]=='O')
            c2++;
        else if(c1==k && c2==k &&c3<k && s[i]=='I')
            c3++;
    if(c3>=k)return 1;
    else return 0;
}

void solve() {
    int n,k;
    cin >> n >> k;
    string s;
    cin >> s;

    int ans=1e9;

    if(!ok(s,k))out(-1)

    int lg=19;
    vvi nxto(n+1,vi(lg,-1));
    vvi nxtj(n+1,vi(lg,-1));
    vvi nxti(n+1,vi(lg,-1));

    int lsti=-1,lstj=-1,lsto=-1;
    for(int i=n-1;0<=i; i--){
        nxto[i][0]=lsto;
        nxti[i][0]=lsti;
        nxtj[i][0]=lstj;
        if(s[i]=='O')
            lsto=i;
        else if(s[i]=='J')
            lstj=i;
        else
            lsti=i;
    }

    for(int j=1; j<lg; j++){
        for(int i=0; i<n; i++) {
            if(nxto[i][j-1]!=-1)
                nxto[i][j] = nxto[nxto[i][j - 1]][j - 1];
            if(nxti[i][j-1]!=-1)
                nxti[i][j] = nxti[nxti[i][j - 1]][j - 1];
            if(nxtj[i][j-1]!=-1)
                nxtj[i][j] = nxtj[nxtj[i][j - 1]][j - 1];
        }
    }



    for(int i=0; i<n; i++){
        if(s[i]!='J')continue;

        int j=i;
        for(int b=0; b<lg; b++)
            if((k-1)&(1<<b) && j!=-1)
                j=nxtj[j][b];
        if(j==-1)continue;
        j=nxto[j][0];
        for(int b=0; b<lg; b++)
            if((k-1)&(1<<b) && j!=-1)
                j=nxto[j][b];
        if(j==-1)continue;

        j=nxti[j][0];
        for(int b=0; b<lg; b++)
            if((k-1)&(1<<b) && j!=-1)
                j=nxti[j][b];
        if(j==-1)continue;
        ans=min(ans,j-i-3*k+1);
    }
    out(ans)
}

Compilation message

ho_t2.cpp: In function 'bool ok(std::string, int)':
ho_t2.cpp:77:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   77 |     for(int i=0; i<s.size(); i++)
      |                  ~^~~~~~~~~
ho_t2.cpp: In function 'void usaco(std::string)':
ho_t2.cpp:47:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 |     freopen(FIN, "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~
ho_t2.cpp:48:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |     freopen(FOUT, "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
87.0 / 87.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 2 ms 1100 KB Output is correct
16 Correct 2 ms 1356 KB Output is correct
17 Correct 2 ms 1356 KB Output is correct
18 Correct 1 ms 844 KB Output is correct
19 Correct 2 ms 1356 KB Output is correct
20 Correct 2 ms 1356 KB Output is correct
21 Correct 2 ms 1356 KB Output is correct
22 Correct 2 ms 1228 KB Output is correct
23 Correct 1 ms 844 KB Output is correct
24 Correct 2 ms 1356 KB Output is correct
25 Correct 2 ms 1356 KB Output is correct
26 Correct 2 ms 1356 KB Output is correct
27 Correct 2 ms 1356 KB Output is correct
28 Correct 0 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 2 ms 1356 KB Output is correct
34 Correct 2 ms 1356 KB Output is correct
35 Correct 2 ms 1356 KB Output is correct
36 Correct 157 ms 65864 KB Output is correct
37 Correct 164 ms 71148 KB Output is correct
38 Correct 170 ms 71148 KB Output is correct
39 Correct 181 ms 70372 KB Output is correct
40 Correct 177 ms 71048 KB Output is correct
41 Correct 188 ms 71052 KB Output is correct
42 Correct 203 ms 71180 KB Output is correct
43 Correct 115 ms 44220 KB Output is correct
44 Correct 136 ms 55088 KB Output is correct
45 Correct 194 ms 71196 KB Output is correct
46 Correct 185 ms 71044 KB Output is correct
47 Correct 206 ms 71112 KB Output is correct
48 Correct 192 ms 71052 KB Output is correct
49 Correct 1 ms 792 KB Output is correct
50 Correct 1 ms 984 KB Output is correct
51 Correct 1 ms 964 KB Output is correct
52 Correct 1 ms 984 KB Output is correct
53 Correct 1 ms 984 KB Output is correct
54 Correct 127 ms 71040 KB Output is correct
55 Correct 128 ms 71140 KB Output is correct
56 Correct 135 ms 71156 KB Output is correct