oj.uz

Submission #402849

# Submission time Handle Problem Language Result Execution time Memory
402849 2021-05-12T12:39:06 Z rrrr10000 The short shank; Redemption (BOI21_prison) C++14
100 / 100
 1165 ms 266992 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);
    vp ma(m);
    function<void(ll)> dfs=[&](ll i){
        ma[i]=P(1,i);
        for(ll x:g[i]){
            dfs(x);
            chmax(ma[i],P(ma[x].fi+1,ma[x].se));
        }
    };dfs(m-1);
    PQ(P) pq;
    pq.push(ma[m-1]);
    vb done(m,false);
    rep(i,d){
        if(!pq.size())break;
        auto t=pq.top();pq.pop();
        ans+=t.fi;
        for(ll x:g[t.se])pq.emplace(ma[x]);
        while(par[t.se]!=-1&&!done[par[t.se]]){
            done[t.se]=true;
            for(ll x:g[par[t.se]])if(x!=t.se)pq.emplace(ma[x]);
            t.se=par[t.se];
        }
        done[t.se]=true;
    }
    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 2 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 2 ms 204 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 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 262 ms 32680 KB Output is correct
3 Correct 242 ms 28456 KB Output is correct
4 Correct 231 ms 35380 KB Output is correct
5 Correct 166 ms 31280 KB Output is correct
6 Correct 271 ms 27448 KB Output is correct
7 Correct 279 ms 82372 KB Output is correct
8 Correct 229 ms 31696 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 2 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 2 ms 204 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 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 2 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 2 ms 204 KB Output is correct
16 Correct 1 ms 204 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 3 ms 460 KB Output is correct
24 Correct 3 ms 460 KB Output is correct
25 Correct 3 ms 460 KB Output is correct
26 Correct 4 ms 460 KB Output is correct
27 Correct 4 ms 460 KB Output is correct
28 Correct 3 ms 460 KB Output is correct
29 Correct 3 ms 588 KB Output is correct
30 Correct 2 ms 460 KB Output is correct
31 Correct 2 ms 460 KB Output is correct
32 Correct 2 ms 460 KB Output is correct
33 Correct 2 ms 460 KB Output is correct
34 Correct 3 ms 460 KB Output is correct
35 Correct 2 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 49 ms 5732 KB Output is correct
3 Correct 41 ms 5344 KB Output is correct
4 Correct 52 ms 8284 KB Output is correct
5 Correct 47 ms 9308 KB Output is correct
6 Correct 43 ms 9692 KB Output is correct
7 Correct 31 ms 4584 KB Output is correct
8 Correct 36 ms 4076 KB Output is correct
9 Correct 41 ms 12540 KB Output is correct
10 Correct 31 ms 5316 KB Output is correct

Subtask #5
25.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 2 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 2 ms 204 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 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 2 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 2 ms 204 KB Output is correct
16 Correct 1 ms 204 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 3 ms 460 KB Output is correct
24 Correct 3 ms 460 KB Output is correct
25 Correct 3 ms 460 KB Output is correct
26 Correct 4 ms 460 KB Output is correct
27 Correct 4 ms 460 KB Output is correct
28 Correct 3 ms 460 KB Output is correct
29 Correct 3 ms 588 KB Output is correct
30 Correct 2 ms 460 KB Output is correct
31 Correct 2 ms 460 KB Output is correct
32 Correct 2 ms 460 KB Output is correct
33 Correct 2 ms 460 KB Output is correct
34 Correct 3 ms 460 KB Output is correct
35 Correct 2 ms 588 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 49 ms 5732 KB Output is correct
38 Correct 41 ms 5344 KB Output is correct
39 Correct 52 ms 8284 KB Output is correct
40 Correct 47 ms 9308 KB Output is correct
41 Correct 43 ms 9692 KB Output is correct
42 Correct 31 ms 4584 KB Output is correct
43 Correct 36 ms 4076 KB Output is correct
44 Correct 41 ms 12540 KB Output is correct
45 Correct 31 ms 5316 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 2 ms 204 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 2 ms 204 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 2 ms 204 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 3 ms 588 KB Output is correct
58 Correct 3 ms 460 KB Output is correct
59 Correct 3 ms 460 KB Output is correct
60 Correct 3 ms 452 KB Output is correct
61 Correct 3 ms 460 KB Output is correct
62 Correct 3 ms 460 KB Output is correct
63 Correct 3 ms 460 KB Output is correct
64 Correct 2 ms 460 KB Output is correct
65 Correct 2 ms 448 KB Output is correct
66 Correct 2 ms 460 KB Output is correct
67 Correct 3 ms 460 KB Output is correct
68 Correct 2 ms 460 KB Output is correct
69 Correct 2 ms 588 KB Output is correct
70 Correct 1 ms 204 KB Output is correct
71 Correct 40 ms 5856 KB Output is correct
72 Correct 39 ms 5300 KB Output is correct
73 Correct 33 ms 8280 KB Output is correct
74 Correct 46 ms 9332 KB Output is correct
75 Correct 54 ms 9576 KB Output is correct
76 Correct 31 ms 4600 KB Output is correct
77 Correct 31 ms 4088 KB Output is correct
78 Correct 41 ms 12532 KB Output is correct
79 Correct 37 ms 5132 KB Output is correct
80 Correct 49 ms 5344 KB Output is correct
81 Correct 43 ms 6488 KB Output is correct
82 Correct 40 ms 6068 KB Output is correct
83 Correct 39 ms 7128 KB Output is correct
84 Correct 25 ms 5168 KB Output is correct
85 Correct 43 ms 10720 KB Output is correct
86 Correct 34 ms 6340 KB Output is correct
87 Correct 35 ms 4416 KB Output is correct
88 Correct 46 ms 10948 KB Output is correct
89 Correct 40 ms 12632 KB Output is correct
90 Correct 38 ms 10288 KB Output is correct

Subtask #6
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 2 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 2 ms 204 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 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 1 ms 204 KB Output is correct
13 Correct 262 ms 32680 KB Output is correct
14 Correct 242 ms 28456 KB Output is correct
15 Correct 231 ms 35380 KB Output is correct
16 Correct 166 ms 31280 KB Output is correct
17 Correct 271 ms 27448 KB Output is correct
18 Correct 279 ms 82372 KB Output is correct
19 Correct 229 ms 31696 KB Output is correct
20 Correct 2 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 2 ms 204 KB Output is correct
24 Correct 1 ms 204 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 3 ms 460 KB Output is correct
32 Correct 3 ms 460 KB Output is correct
33 Correct 3 ms 460 KB Output is correct
34 Correct 4 ms 460 KB Output is correct
35 Correct 4 ms 460 KB Output is correct
36 Correct 3 ms 460 KB Output is correct
37 Correct 3 ms 588 KB Output is correct
38 Correct 2 ms 460 KB Output is correct
39 Correct 2 ms 460 KB Output is correct
40 Correct 2 ms 460 KB Output is correct
41 Correct 2 ms 460 KB Output is correct
42 Correct 3 ms 460 KB Output is correct
43 Correct 2 ms 588 KB Output is correct
44 Correct 1 ms 204 KB Output is correct
45 Correct 49 ms 5732 KB Output is correct
46 Correct 41 ms 5344 KB Output is correct
47 Correct 52 ms 8284 KB Output is correct
48 Correct 47 ms 9308 KB Output is correct
49 Correct 43 ms 9692 KB Output is correct
50 Correct 31 ms 4584 KB Output is correct
51 Correct 36 ms 4076 KB Output is correct
52 Correct 41 ms 12540 KB Output is correct
53 Correct 31 ms 5316 KB Output is correct
54 Correct 1 ms 204 KB Output is correct
55 Correct 2 ms 204 KB Output is correct
56 Correct 1 ms 204 KB Output is correct
57 Correct 2 ms 204 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 2 ms 204 KB Output is correct
62 Correct 1 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 3 ms 588 KB Output is correct
66 Correct 3 ms 460 KB Output is correct
67 Correct 3 ms 460 KB Output is correct
68 Correct 3 ms 452 KB Output is correct
69 Correct 3 ms 460 KB Output is correct
70 Correct 3 ms 460 KB Output is correct
71 Correct 3 ms 460 KB Output is correct
72 Correct 2 ms 460 KB Output is correct
73 Correct 2 ms 448 KB Output is correct
74 Correct 2 ms 460 KB Output is correct
75 Correct 3 ms 460 KB Output is correct
76 Correct 2 ms 460 KB Output is correct
77 Correct 2 ms 588 KB Output is correct
78 Correct 1 ms 204 KB Output is correct
79 Correct 40 ms 5856 KB Output is correct
80 Correct 39 ms 5300 KB Output is correct
81 Correct 33 ms 8280 KB Output is correct
82 Correct 46 ms 9332 KB Output is correct
83 Correct 54 ms 9576 KB Output is correct
84 Correct 31 ms 4600 KB Output is correct
85 Correct 31 ms 4088 KB Output is correct
86 Correct 41 ms 12532 KB Output is correct
87 Correct 37 ms 5132 KB Output is correct
88 Correct 49 ms 5344 KB Output is correct
89 Correct 43 ms 6488 KB Output is correct
90 Correct 40 ms 6068 KB Output is correct
91 Correct 39 ms 7128 KB Output is correct
92 Correct 25 ms 5168 KB Output is correct
93 Correct 43 ms 10720 KB Output is correct
94 Correct 34 ms 6340 KB Output is correct
95 Correct 35 ms 4416 KB Output is correct
96 Correct 46 ms 10948 KB Output is correct
97 Correct 40 ms 12632 KB Output is correct
98 Correct 38 ms 10288 KB Output is correct
99 Correct 1 ms 204 KB Output is correct
100 Correct 1 ms 204 KB Output is correct
101 Correct 1 ms 332 KB Output is correct
102 Correct 1 ms 332 KB Output is correct
103 Correct 1 ms 332 KB Output is correct
104 Correct 1 ms 332 KB Output is correct
105 Correct 1 ms 288 KB Output is correct
106 Correct 1 ms 204 KB Output is correct
107 Correct 2 ms 296 KB Output is correct
108 Correct 1 ms 204 KB Output is correct
109 Correct 1 ms 204 KB Output is correct
110 Correct 1 ms 204 KB Output is correct
111 Correct 265 ms 37584 KB Output is correct
112 Correct 259 ms 33080 KB Output is correct
113 Correct 214 ms 38692 KB Output is correct
114 Correct 190 ms 33112 KB Output is correct
115 Correct 245 ms 31312 KB Output is correct
116 Correct 266 ms 86236 KB Output is correct
117 Correct 245 ms 35604 KB Output is correct
118 Correct 3 ms 588 KB Output is correct
119 Correct 3 ms 588 KB Output is correct
120 Correct 3 ms 588 KB Output is correct
121 Correct 3 ms 588 KB Output is correct
122 Correct 4 ms 588 KB Output is correct
123 Correct 3 ms 588 KB Output is correct
124 Correct 3 ms 588 KB Output is correct
125 Correct 3 ms 460 KB Output is correct
126 Correct 4 ms 460 KB Output is correct
127 Correct 3 ms 460 KB Output is correct
128 Correct 3 ms 556 KB Output is correct
129 Correct 3 ms 588 KB Output is correct
130 Correct 3 ms 640 KB Output is correct
131 Correct 1 ms 204 KB Output is correct
132 Correct 40 ms 6488 KB Output is correct
133 Correct 40 ms 6092 KB Output is correct
134 Correct 33 ms 8764 KB Output is correct
135 Correct 42 ms 10076 KB Output is correct
136 Correct 58 ms 10300 KB Output is correct
137 Correct 34 ms 5092 KB Output is correct
138 Correct 37 ms 4644 KB Output is correct
139 Correct 38 ms 13024 KB Output is correct
140 Correct 39 ms 5708 KB Output is correct
141 Correct 42 ms 6084 KB Output is correct
142 Correct 43 ms 6480 KB Output is correct
143 Correct 43 ms 6096 KB Output is correct
144 Correct 35 ms 7156 KB Output is correct
145 Correct 25 ms 5216 KB Output is correct
146 Correct 46 ms 10788 KB Output is correct
147 Correct 36 ms 6436 KB Output is correct
148 Correct 40 ms 4436 KB Output is correct
149 Correct 38 ms 10960 KB Output is correct
150 Correct 41 ms 12632 KB Output is correct
151 Correct 38 ms 10272 KB Output is correct
152 Correct 1092 ms 145376 KB Output is correct
153 Correct 1067 ms 136608 KB Output is correct
154 Correct 1050 ms 127204 KB Output is correct
155 Correct 961 ms 182328 KB Output is correct
156 Correct 740 ms 133792 KB Output is correct
157 Correct 918 ms 98508 KB Output is correct
158 Correct 974 ms 141388 KB Output is correct
159 Correct 1107 ms 266992 KB Output is correct
160 Correct 1165 ms 254456 KB Output is correct
161 Correct 940 ms 117356 KB Output is correct
162 Correct 924 ms 112984 KB Output is correct