oj.uz

Submission #402810

# Submission time Handle Problem Language Result Execution time Memory
402810 2021-05-12T11:28:45 Z rrrr10000 The short shank; Redemption (BOI21_prison) C++14
55 / 100
 2000 ms 78352 KB 
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n)  for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define pb emplace_back
#define lb(v,k) (lower_bound(all(v),(k))-v.begin())
#define ub(v,k) (upper_bound(all(v),(k))-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define all(a) a.begin(),a.end()
#define rsort(a) {sort(all(a));reverse(all(a));}
#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void outset(T s){auto itr=s.begin();while(itr!=s.end()){if(itr!=s.begin())cout<<' ';cout<<*itr;itr++;}cout<<'\n';}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}
class BIT{
    vi bit;ll N;
public:
    ll sum(ll i){
        chmin(i,N);
        ll res=0;
        for(ll j=i-1;j>=0;j=(j&(j+1))-1)res+=bit[j];
        return res;
    }
    BIT(ll n):N(n){bit.resize(N);}
    void add(ll i,ll x){
        for(int j=i;j<N;j|=j+1)bit[j]+=x;
    }
    ll get(ll a,ll b){
        return sum(b)-sum(a);
    }
};
class UF{
    vi data;stack<P> st;
public:
    UF(ll n){
        data=vi(n,1);
    }
    bool merge(ll x,ll y,bool undo=false){
        x=root(x);y=root(y);
        if(data[x]>data[y])swap(x,y);
        if(undo){st.emplace(y,data[y]);st.emplace(x,data[x]);}
        if(x==y)return false;
        data[y]+=data[x];data[x]=-y;
        return true;
    }
    ll root(ll i){if(data[i]>0)return i;return root(-data[i]);}
    ll getsize(ll i){return data[root(i)];}
    bool same(ll a,ll b){return root(a)==root(b);}
    void undo(){rep(i,2){data[st.top().fi]=st.top().se;st.pop();}}
};
int main(){
    ll n,d,k;cin>>n>>d>>k;
    vi v(n);rep(i,n)cin>>v[i];
    vp t1,t2;
    ll ans=0,cur=0;
    vi par(n+1,-1);
    rep(i,n){
        if(v[i]>k){
            while(t1.size()&&t1.back().fi+i-t1.back().se>k)t1.pop_back();
            if(t1.size()==0)ans++;
            else{
                while(t2.size()&&t2.back().fi>=t1.back().se){
                    par[t2.back().se]=cur;t2.pop_back();
                }
                t2.pb(t1.back().se,cur);
                cur++;
            }
        }
        else t1.pb(v[i],i);
    }
    while(par.size()!=cur+1)par.pop_back();
    for(auto x:t2)par[x.se]=cur;
    // outv(par);
    ll m=par.size();
    vvi g(m);
    rep(i,m-1)g[par[i]].pb(i);
    vi num(m,1),rui;
    function<void(ll)> dfs=[&](ll i){
        for(ll x:g[i]){
            rui[x]+=rui[i];
            dfs(x);
        }
    };
    rep(i,d){
        rui=num;
        dfs(m-1);
        P p=P(0,0);
        rep(j,m)chmax(p,P(rui[j],j));
        ans+=p.fi;
        while(p.se!=-1){
            num[p.se]=0;p.se=par[p.se];
        }
    }
    out(n-ans+1);
}

Compilation message

prison.cpp: In function 'int main()':
prison.cpp:106:21: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
  106 |     while(par.size()!=cur+1)par.pop_back();
      |           ~~~~~~~~~~^~~~~~~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 292 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 296 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 288 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 254 ms 33480 KB Output is correct
3 Correct 239 ms 29512 KB Output is correct
4 Correct 235 ms 34340 KB Output is correct
5 Correct 163 ms 31572 KB Output is correct
6 Correct 212 ms 28472 KB Output is correct
7 Correct 252 ms 78352 KB Output is correct
8 Correct 232 ms 31936 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 292 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 296 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 288 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 292 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 296 KB Output is correct
16 Correct 2 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 7 ms 588 KB Output is correct
24 Correct 9 ms 460 KB Output is correct
25 Correct 15 ms 588 KB Output is correct
26 Correct 15 ms 460 KB Output is correct
27 Correct 22 ms 588 KB Output is correct
28 Correct 5 ms 460 KB Output is correct
29 Correct 6 ms 588 KB Output is correct
30 Correct 5 ms 460 KB Output is correct
31 Correct 9 ms 460 KB Output is correct
32 Correct 4 ms 460 KB Output is correct
33 Correct 4 ms 460 KB Output is correct
34 Correct 4 ms 556 KB Output is correct
35 Correct 21 ms 588 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 51 ms 5812 KB Output is correct
3 Correct 48 ms 5328 KB Output is correct
4 Correct 51 ms 7772 KB Output is correct
5 Correct 55 ms 9276 KB Output is correct
6 Correct 57 ms 9428 KB Output is correct
7 Correct 37 ms 4552 KB Output is correct
8 Correct 37 ms 4068 KB Output is correct
9 Correct 55 ms 11864 KB Output is correct
10 Correct 33 ms 4284 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 292 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 296 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 288 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 292 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 296 KB Output is correct
16 Correct 2 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 7 ms 588 KB Output is correct
24 Correct 9 ms 460 KB Output is correct
25 Correct 15 ms 588 KB Output is correct
26 Correct 15 ms 460 KB Output is correct
27 Correct 22 ms 588 KB Output is correct
28 Correct 5 ms 460 KB Output is correct
29 Correct 6 ms 588 KB Output is correct
30 Correct 5 ms 460 KB Output is correct
31 Correct 9 ms 460 KB Output is correct
32 Correct 4 ms 460 KB Output is correct
33 Correct 4 ms 460 KB Output is correct
34 Correct 4 ms 556 KB Output is correct
35 Correct 21 ms 588 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 51 ms 5812 KB Output is correct
38 Correct 48 ms 5328 KB Output is correct
39 Correct 51 ms 7772 KB Output is correct
40 Correct 55 ms 9276 KB Output is correct
41 Correct 57 ms 9428 KB Output is correct
42 Correct 37 ms 4552 KB Output is correct
43 Correct 37 ms 4068 KB Output is correct
44 Correct 55 ms 11864 KB Output is correct
45 Correct 33 ms 4284 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 1 ms 332 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 1 ms 204 KB Output is correct
53 Correct 1 ms 204 KB Output is correct
54 Correct 2 ms 204 KB Output is correct
55 Correct 1 ms 204 KB Output is correct
56 Correct 1 ms 204 KB Output is correct
57 Correct 7 ms 588 KB Output is correct
58 Correct 9 ms 556 KB Output is correct
59 Correct 15 ms 588 KB Output is correct
60 Correct 15 ms 556 KB Output is correct
61 Correct 22 ms 592 KB Output is correct
62 Correct 5 ms 460 KB Output is correct
63 Correct 6 ms 588 KB Output is correct
64 Correct 5 ms 460 KB Output is correct
65 Correct 9 ms 476 KB Output is correct
66 Correct 4 ms 460 KB Output is correct
67 Correct 4 ms 460 KB Output is correct
68 Correct 4 ms 460 KB Output is correct
69 Correct 20 ms 604 KB Output is correct
70 Correct 1 ms 204 KB Output is correct
71 Correct 52 ms 5852 KB Output is correct
72 Correct 48 ms 5300 KB Output is correct
73 Correct 47 ms 7772 KB Output is correct
74 Correct 56 ms 9308 KB Output is correct
75 Correct 58 ms 9428 KB Output is correct
76 Correct 37 ms 4440 KB Output is correct
77 Correct 37 ms 4080 KB Output is correct
78 Correct 58 ms 11864 KB Output is correct
79 Correct 34 ms 4312 KB Output is correct
80 Execution timed out 2069 ms 5332 KB Time limit exceeded
81 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 292 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 296 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 288 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 254 ms 33480 KB Output is correct
14 Correct 239 ms 29512 KB Output is correct
15 Correct 235 ms 34340 KB Output is correct
16 Correct 163 ms 31572 KB Output is correct
17 Correct 212 ms 28472 KB Output is correct
18 Correct 252 ms 78352 KB Output is correct
19 Correct 232 ms 31936 KB Output is correct
20 Correct 1 ms 292 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 296 KB Output is correct
24 Correct 2 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 7 ms 588 KB Output is correct
32 Correct 9 ms 460 KB Output is correct
33 Correct 15 ms 588 KB Output is correct
34 Correct 15 ms 460 KB Output is correct
35 Correct 22 ms 588 KB Output is correct
36 Correct 5 ms 460 KB Output is correct
37 Correct 6 ms 588 KB Output is correct
38 Correct 5 ms 460 KB Output is correct
39 Correct 9 ms 460 KB Output is correct
40 Correct 4 ms 460 KB Output is correct
41 Correct 4 ms 460 KB Output is correct
42 Correct 4 ms 556 KB Output is correct
43 Correct 21 ms 588 KB Output is correct
44 Correct 1 ms 204 KB Output is correct
45 Correct 51 ms 5812 KB Output is correct
46 Correct 48 ms 5328 KB Output is correct
47 Correct 51 ms 7772 KB Output is correct
48 Correct 55 ms 9276 KB Output is correct
49 Correct 57 ms 9428 KB Output is correct
50 Correct 37 ms 4552 KB Output is correct
51 Correct 37 ms 4068 KB Output is correct
52 Correct 55 ms 11864 KB Output is correct
53 Correct 33 ms 4284 KB Output is correct
54 Correct 1 ms 204 KB Output is correct
55 Correct 1 ms 204 KB Output is correct
56 Correct 1 ms 204 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 1 ms 332 KB Output is correct
59 Correct 1 ms 332 KB Output is correct
60 Correct 1 ms 204 KB Output is correct
61 Correct 1 ms 204 KB Output is correct
62 Correct 2 ms 204 KB Output is correct
63 Correct 1 ms 204 KB Output is correct
64 Correct 1 ms 204 KB Output is correct
65 Correct 7 ms 588 KB Output is correct
66 Correct 9 ms 556 KB Output is correct
67 Correct 15 ms 588 KB Output is correct
68 Correct 15 ms 556 KB Output is correct
69 Correct 22 ms 592 KB Output is correct
70 Correct 5 ms 460 KB Output is correct
71 Correct 6 ms 588 KB Output is correct
72 Correct 5 ms 460 KB Output is correct
73 Correct 9 ms 476 KB Output is correct
74 Correct 4 ms 460 KB Output is correct
75 Correct 4 ms 460 KB Output is correct
76 Correct 4 ms 460 KB Output is correct
77 Correct 20 ms 604 KB Output is correct
78 Correct 1 ms 204 KB Output is correct
79 Correct 52 ms 5852 KB Output is correct
80 Correct 48 ms 5300 KB Output is correct
81 Correct 47 ms 7772 KB Output is correct
82 Correct 56 ms 9308 KB Output is correct
83 Correct 58 ms 9428 KB Output is correct
84 Correct 37 ms 4440 KB Output is correct
85 Correct 37 ms 4080 KB Output is correct
86 Correct 58 ms 11864 KB Output is correct
87 Correct 34 ms 4312 KB Output is correct
88 Execution timed out 2069 ms 5332 KB Time limit exceeded
89 Halted 0 ms 0 KB -