oj.uz

Submission #406192

# Submission time Handle Problem Language Result Execution time Memory
406192 2021-05-17T09:18:54 Z jamezzz The short shank; Redemption (BOI21_prison) C++14
55 / 100
 2000 ms 62792 KB 
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#include <ext/rope>
using namespace __gnu_cxx;

typedef tree<long long, null_type, less<long long>,
rb_tree_tag, tree_order_statistics_node_update> pbds;
//less_equal for identical elements

#define DEBUG

#ifdef DEBUG
#define debug(...) printf(__VA_ARGS__);
#else
#define debug(...)
#endif
#define sf scanf
#define pf printf
#define fi first
#define se second
#define pb emplace_back
#define sz(x) (int)x.size()
#define mnto(x,y) x=min(x,(__typeof__(x))y)
#define mxto(x,y) x=max(x,(__typeof__(x))y)
#define INF 1023456789
#define LINF 1023456789123456789
#define all(x) x.begin(), x.end()
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<pll> vll;

struct node{
	int s,e,m,v,lz;
	node *l,*r;
	
	node(int _s,int _e){
		s=_s;e=_e;m=(s+e)/2;v=-1;lz=-1;
		if(s!=e){
			l=new node(s,m);
			r=new node(m+1,e);
		}
	}
	void propo(){
		mxto(v,lz);
		if(s!=e){
			mxto(l->lz,lz);
			mxto(r->lz,lz);
		}
		lz=-1;
	}
	void up(int x,int y,int nv){
		if(s==x&&e==y){
			mxto(lz,nv);return;
		}
		if(y<=m)l->up(x,y,nv);
		else if(x>m)r->up(x,y,nv);
		else l->up(x,m,nv),r->up(m+1,y,nv);
	}
	int qry(int x){
		propo();
		if(s==x&&e==x)return v;
		if(x<=m)return l->qry(x);
		else return r->qry(x);
	}
}*root;

int n,d,t[2000005],arv;
bool use[2000005];
vector<ii> v;
priority_queue<ii,vector<ii>,greater<ii>> pq;

int main(){
	sf("%d%d%d",&n,&d,&arv);
	root=new node(0,n-1);
	for(int i=0;i<n;++i){
		sf("%d",&t[i]);
		if(t[i]<=arv){
			int dist=arv-t[i];
			if((i+1)<=min(i+dist,n-1))root->up(i+1,min(i+dist,n-1),i);
		}
	}
	int ans=0;
	for(int i=0;i<n;++i){
		if(t[i]<=arv){
			++ans;continue;
		}
		if(root->qry(i)==-1)continue;
		v.pb(root->qry(i),i-1);
	}
	int cnt=0;
	sort(all(v));
	for(int i=0;i<d;++i){
		if(cnt==sz(v))break;
		int mx=0,id=0,cur=0;
		for(int j=0;j<n;++j){
			while(!pq.empty()&&pq.top().fi<j)pq.pop();
			while(cur<sz(v)&&v[cur].fi<=j){
				if(!use[cur])pq.push(ii(v[cur].se,v[cur].fi));
				++cur;
			}
			if(sz(pq)>mx)mx=sz(pq),id=j;
		}
		for(int j=0;j<sz(v);++j){
			if(v[j].fi<=id&&id<=v[j].se&&!use[j]){
				use[j]=true;
				++cnt;
			}
		}
		while(!pq.empty())pq.pop();
	}
	pf("%d\n",ans+sz(v)-cnt);
	return 0;
}

Compilation message

prison.cpp: In function 'int main()':
prison.cpp:82:4: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   82 |  sf("%d%d%d",&n,&d,&arv);
      |    ^
prison.cpp:85:5: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   85 |   sf("%d",&t[i]);
      |     ^

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 2 ms 356 KB Output is correct
4 Correct 2 ms 372 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 2 ms 332 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 337 ms 54556 KB Output is correct
3 Correct 260 ms 55064 KB Output is correct
4 Correct 305 ms 56404 KB Output is correct
5 Correct 304 ms 55220 KB Output is correct
6 Correct 268 ms 55380 KB Output is correct
7 Correct 385 ms 62792 KB Output is correct
8 Correct 279 ms 55696 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 2 ms 332 KB Output is correct
3 Correct 2 ms 356 KB Output is correct
4 Correct 2 ms 372 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 2 ms 332 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 2 ms 332 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 2 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 2 ms 332 KB Output is correct
23 Correct 10 ms 732 KB Output is correct
24 Correct 14 ms 768 KB Output is correct
25 Correct 20 ms 792 KB Output is correct
26 Correct 24 ms 696 KB Output is correct
27 Correct 29 ms 772 KB Output is correct
28 Correct 7 ms 716 KB Output is correct
29 Correct 8 ms 704 KB Output is correct
30 Correct 8 ms 716 KB Output is correct
31 Correct 13 ms 752 KB Output is correct
32 Correct 7 ms 716 KB Output is correct
33 Correct 7 ms 716 KB Output is correct
34 Correct 6 ms 716 KB Output is correct
35 Correct 25 ms 716 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 288 KB Output is correct
2 Correct 76 ms 8988 KB Output is correct
3 Correct 74 ms 8964 KB Output is correct
4 Correct 67 ms 9216 KB Output is correct
5 Correct 56 ms 9564 KB Output is correct
6 Correct 59 ms 9512 KB Output is correct
7 Correct 47 ms 8552 KB Output is correct
8 Correct 63 ms 8516 KB Output is correct
9 Correct 57 ms 10268 KB Output is correct
10 Correct 44 ms 8712 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 2 ms 332 KB Output is correct
3 Correct 2 ms 356 KB Output is correct
4 Correct 2 ms 372 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 2 ms 332 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 2 ms 332 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 2 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 2 ms 332 KB Output is correct
23 Correct 10 ms 732 KB Output is correct
24 Correct 14 ms 768 KB Output is correct
25 Correct 20 ms 792 KB Output is correct
26 Correct 24 ms 696 KB Output is correct
27 Correct 29 ms 772 KB Output is correct
28 Correct 7 ms 716 KB Output is correct
29 Correct 8 ms 704 KB Output is correct
30 Correct 8 ms 716 KB Output is correct
31 Correct 13 ms 752 KB Output is correct
32 Correct 7 ms 716 KB Output is correct
33 Correct 7 ms 716 KB Output is correct
34 Correct 6 ms 716 KB Output is correct
35 Correct 25 ms 716 KB Output is correct
36 Correct 1 ms 288 KB Output is correct
37 Correct 76 ms 8988 KB Output is correct
38 Correct 74 ms 8964 KB Output is correct
39 Correct 67 ms 9216 KB Output is correct
40 Correct 56 ms 9564 KB Output is correct
41 Correct 59 ms 9512 KB Output is correct
42 Correct 47 ms 8552 KB Output is correct
43 Correct 63 ms 8516 KB Output is correct
44 Correct 57 ms 10268 KB Output is correct
45 Correct 44 ms 8712 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 1 ms 332 KB Output is correct
48 Correct 1 ms 312 KB Output is correct
49 Correct 1 ms 332 KB Output is correct
50 Correct 2 ms 332 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 2 ms 332 KB Output is correct
53 Correct 2 ms 332 KB Output is correct
54 Correct 1 ms 332 KB Output is correct
55 Correct 3 ms 332 KB Output is correct
56 Correct 2 ms 332 KB Output is correct
57 Correct 9 ms 716 KB Output is correct
58 Correct 14 ms 772 KB Output is correct
59 Correct 21 ms 716 KB Output is correct
60 Correct 23 ms 716 KB Output is correct
61 Correct 33 ms 796 KB Output is correct
62 Correct 7 ms 716 KB Output is correct
63 Correct 8 ms 796 KB Output is correct
64 Correct 8 ms 756 KB Output is correct
65 Correct 13 ms 700 KB Output is correct
66 Correct 8 ms 716 KB Output is correct
67 Correct 7 ms 716 KB Output is correct
68 Correct 6 ms 716 KB Output is correct
69 Correct 26 ms 716 KB Output is correct
70 Correct 1 ms 204 KB Output is correct
71 Correct 65 ms 8904 KB Output is correct
72 Correct 64 ms 8904 KB Output is correct
73 Correct 65 ms 9276 KB Output is correct
74 Correct 61 ms 9516 KB Output is correct
75 Correct 61 ms 9536 KB Output is correct
76 Correct 50 ms 8624 KB Output is correct
77 Correct 48 ms 8524 KB Output is correct
78 Correct 76 ms 10176 KB Output is correct
79 Correct 56 ms 8768 KB Output is correct
80 Execution timed out 2072 ms 8956 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 2 ms 332 KB Output is correct
3 Correct 2 ms 356 KB Output is correct
4 Correct 2 ms 372 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 2 ms 332 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 337 ms 54556 KB Output is correct
14 Correct 260 ms 55064 KB Output is correct
15 Correct 305 ms 56404 KB Output is correct
16 Correct 304 ms 55220 KB Output is correct
17 Correct 268 ms 55380 KB Output is correct
18 Correct 385 ms 62792 KB Output is correct
19 Correct 279 ms 55696 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 2 ms 332 KB Output is correct
25 Correct 2 ms 332 KB Output is correct
26 Correct 2 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 2 ms 332 KB Output is correct
29 Correct 2 ms 332 KB Output is correct
30 Correct 2 ms 332 KB Output is correct
31 Correct 10 ms 732 KB Output is correct
32 Correct 14 ms 768 KB Output is correct
33 Correct 20 ms 792 KB Output is correct
34 Correct 24 ms 696 KB Output is correct
35 Correct 29 ms 772 KB Output is correct
36 Correct 7 ms 716 KB Output is correct
37 Correct 8 ms 704 KB Output is correct
38 Correct 8 ms 716 KB Output is correct
39 Correct 13 ms 752 KB Output is correct
40 Correct 7 ms 716 KB Output is correct
41 Correct 7 ms 716 KB Output is correct
42 Correct 6 ms 716 KB Output is correct
43 Correct 25 ms 716 KB Output is correct
44 Correct 1 ms 288 KB Output is correct
45 Correct 76 ms 8988 KB Output is correct
46 Correct 74 ms 8964 KB Output is correct
47 Correct 67 ms 9216 KB Output is correct
48 Correct 56 ms 9564 KB Output is correct
49 Correct 59 ms 9512 KB Output is correct
50 Correct 47 ms 8552 KB Output is correct
51 Correct 63 ms 8516 KB Output is correct
52 Correct 57 ms 10268 KB Output is correct
53 Correct 44 ms 8712 KB Output is correct
54 Correct 1 ms 204 KB Output is correct
55 Correct 1 ms 332 KB Output is correct
56 Correct 1 ms 312 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 2 ms 332 KB Output is correct
59 Correct 1 ms 332 KB Output is correct
60 Correct 2 ms 332 KB Output is correct
61 Correct 2 ms 332 KB Output is correct
62 Correct 1 ms 332 KB Output is correct
63 Correct 3 ms 332 KB Output is correct
64 Correct 2 ms 332 KB Output is correct
65 Correct 9 ms 716 KB Output is correct
66 Correct 14 ms 772 KB Output is correct
67 Correct 21 ms 716 KB Output is correct
68 Correct 23 ms 716 KB Output is correct
69 Correct 33 ms 796 KB Output is correct
70 Correct 7 ms 716 KB Output is correct
71 Correct 8 ms 796 KB Output is correct
72 Correct 8 ms 756 KB Output is correct
73 Correct 13 ms 700 KB Output is correct
74 Correct 8 ms 716 KB Output is correct
75 Correct 7 ms 716 KB Output is correct
76 Correct 6 ms 716 KB Output is correct
77 Correct 26 ms 716 KB Output is correct
78 Correct 1 ms 204 KB Output is correct
79 Correct 65 ms 8904 KB Output is correct
80 Correct 64 ms 8904 KB Output is correct
81 Correct 65 ms 9276 KB Output is correct
82 Correct 61 ms 9516 KB Output is correct
83 Correct 61 ms 9536 KB Output is correct
84 Correct 50 ms 8624 KB Output is correct
85 Correct 48 ms 8524 KB Output is correct
86 Correct 76 ms 10176 KB Output is correct
87 Correct 56 ms 8768 KB Output is correct
88 Execution timed out 2072 ms 8956 KB Time limit exceeded
89 Halted 0 ms 0 KB -