oj.uz

Submission #744517

# Submission time Handle Problem Language Result Execution time Memory
744517 2023-05-18T16:12:02 Z myrcella A Difficult(y) Choice (BOI21_books) C++17
100 / 100
 281 ms 1076 KB 
//by szh
#include<bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pb push_back
#define debug(x) cerr<<#x<<"="<<x<<endl
#define pq priority_queue
#define inf 0x3f
#define rep(i,a,b) for (int i=a;i<(b);i++)
#define MP make_pair
#define SZ(x) (int(x.size()))
#define mod 1000000007
typedef long long ll;
#define ALL(x) x.begin(),x.end()
void inc(int &a,int b) {a=(a+b)%mod;}
void dec(int &a,int b) {a=(a-b+mod)%mod;}
int lowbit(int x) {return x&(-x);}
ll p0w(ll base,ll p) {ll ret=1;while(p>0){if (p%2ll==1ll) ret=ret*base%mod;base=base*base%mod;p/=2ll;}return ret;}

#include "books.h"

const int maxn = 1e5+10;
ll dif[maxn];
ll AA;
int KK;

ll check(int pos) {
	ll ret = 0;
	rep(i,pos-KK+1,pos+1) {
		if (dif[i]==-1) dif[i] = skim(i);
		ret += dif[i];
		ret = min(ret,2*AA+319);
		if ((pos-i)*dif[i] > 2*AA or ret + (pos-i)*dif[i] > 2*AA) return 2*AA+319;
	}
	return ret;
}

void solve(int N, int K, long long A, int S) {
	AA = A; KK = K;
	memset(dif,-1,sizeof(dif));
    // TODO implement this function
    if (S==N) {
		rep(i,1,N+1) dif[i] = skim(i);
		ll sum = 0;
		rep(i,1,K+1) {
			sum += dif[i];
			if (sum>2*A) impossible();
		}
		vector <int> ret;
		if (sum>=A) {
			rep(i,1,K+1) ret.pb(i);
			answer(ret);
		}
		rep(i,K+1,N+1) {
			sum += dif[i];
			sum -= dif[i-K];
			if (sum>2*A) {
				if (dif[i]>2*A) impossible();
				ll sum1 = 0;
				rep(j,1,K) ret.pb(j),sum1 += dif[j];
				ret.pb(i);sum1+=dif[i];
				if (sum1<=2*A) answer(ret);
				impossible();
			}
			if (sum>=A) {
				rep(j,i-K+1,i+1) ret.pb(j);
				answer(ret);
			}
		}
		impossible();
	}
	ll sum = 0;vector <int> ret;
	rep(i,1,K) dif[i] = skim(i), sum += dif[i];
	if (sum>2*A) impossible();
	int l = K, r = N;
	while (l<r) {
		int mid=l+r+1>>1;
		dif[mid] = skim(mid);
		if (sum+dif[mid]>2*A) r = mid-1;
		else l = mid;
	}
	if (dif[l]==-1) dif[l] = skim(l);
	if (sum+dif[l]>2*A) impossible();
	if (sum+dif[l]>=A) {
		rep(i,1,K) ret.pb(i);
		ret.pb(l);
		answer(ret);
	}
	sum += dif[l];
	int tmpl = 1, tmpr = l-1;
	while (tmpl<K) {
		if (dif[tmpr]==-1) dif[tmpr] = skim(tmpr);
		sum = sum - dif[tmpl] + dif[tmpr];
		tmpl++,tmpr--;
		assert(sum<=2*A);
		if (sum>=A) {
			rep(i,tmpl,K) ret.pb(i);
			rep(i,tmpr+1,l+1) ret.pb(i);
			answer(ret);
		}
	}
	impossible();
}

Compilation message

books.cpp: In function 'void solve(int, int, long long int, int)':
books.cpp:81:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   81 |   int mid=l+r+1>>1;
      |           ~~~^~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1064 KB Output is correct
2 Correct 16 ms 976 KB Output is correct
3 Correct 8 ms 976 KB Output is correct
4 Correct 7 ms 976 KB Output is correct
5 Correct 11 ms 976 KB Output is correct
6 Correct 9 ms 976 KB Output is correct
7 Correct 6 ms 976 KB Output is correct
8 Correct 5 ms 976 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 976 KB Output is correct
2 Correct 11 ms 976 KB Output is correct
3 Correct 9 ms 976 KB Output is correct
4 Correct 12 ms 976 KB Output is correct
5 Correct 9 ms 976 KB Output is correct
6 Correct 11 ms 976 KB Output is correct
7 Correct 6 ms 976 KB Output is correct
8 Correct 9 ms 976 KB Output is correct
9 Correct 199 ms 976 KB Output is correct
10 Correct 178 ms 976 KB Output is correct
11 Correct 142 ms 976 KB Output is correct
12 Correct 193 ms 976 KB Output is correct
13 Correct 218 ms 976 KB Output is correct
14 Correct 208 ms 976 KB Output is correct
15 Correct 231 ms 976 KB Output is correct
16 Correct 281 ms 976 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 976 KB Output is correct
2 Correct 1 ms 976 KB Output is correct
3 Correct 1 ms 976 KB Output is correct
4 Correct 1 ms 976 KB Output is correct
5 Correct 1 ms 976 KB Output is correct
6 Correct 1 ms 976 KB Output is correct
7 Correct 1 ms 976 KB Output is correct
8 Correct 1 ms 976 KB Output is correct
9 Correct 1 ms 976 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 976 KB Output is correct
2 Correct 1 ms 976 KB Output is correct
3 Correct 1 ms 976 KB Output is correct
4 Correct 1 ms 976 KB Output is correct
5 Correct 1 ms 976 KB Output is correct
6 Correct 1 ms 976 KB Output is correct
7 Correct 1 ms 976 KB Output is correct
8 Correct 1 ms 976 KB Output is correct
9 Correct 1 ms 976 KB Output is correct
10 Correct 1 ms 976 KB Output is correct
11 Correct 2 ms 976 KB Output is correct
12 Correct 1 ms 976 KB Output is correct
13 Correct 1 ms 976 KB Output is correct
14 Correct 1 ms 976 KB Output is correct
15 Correct 1 ms 976 KB Output is correct
16 Correct 1 ms 976 KB Output is correct
17 Correct 1 ms 976 KB Output is correct
18 Correct 1 ms 976 KB Output is correct
19 Correct 1 ms 976 KB Output is correct
20 Correct 1 ms 976 KB Output is correct
21 Correct 1 ms 976 KB Output is correct
22 Correct 1 ms 976 KB Output is correct
23 Correct 1 ms 976 KB Output is correct
24 Correct 1 ms 976 KB Output is correct
25 Correct 1 ms 976 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 976 KB Output is correct
2 Correct 1 ms 976 KB Output is correct
3 Correct 1 ms 976 KB Output is correct
4 Correct 1 ms 976 KB Output is correct
5 Correct 1 ms 976 KB Output is correct
6 Correct 1 ms 976 KB Output is correct
7 Correct 1 ms 976 KB Output is correct
8 Correct 1 ms 976 KB Output is correct
9 Correct 1 ms 976 KB Output is correct
10 Correct 1 ms 976 KB Output is correct
11 Correct 2 ms 976 KB Output is correct
12 Correct 1 ms 976 KB Output is correct
13 Correct 1 ms 976 KB Output is correct
14 Correct 1 ms 976 KB Output is correct
15 Correct 1 ms 976 KB Output is correct
16 Correct 1 ms 976 KB Output is correct
17 Correct 1 ms 976 KB Output is correct
18 Correct 1 ms 976 KB Output is correct
19 Correct 1 ms 976 KB Output is correct
20 Correct 1 ms 976 KB Output is correct
21 Correct 1 ms 976 KB Output is correct
22 Correct 1 ms 976 KB Output is correct
23 Correct 1 ms 976 KB Output is correct
24 Correct 1 ms 976 KB Output is correct
25 Correct 1 ms 976 KB Output is correct
26 Correct 1 ms 976 KB Output is correct
27 Correct 1 ms 976 KB Output is correct
28 Correct 1 ms 976 KB Output is correct
29 Correct 1 ms 976 KB Output is correct
30 Correct 1 ms 976 KB Output is correct
31 Correct 1 ms 1024 KB Output is correct
32 Correct 1 ms 976 KB Output is correct
33 Correct 1 ms 976 KB Output is correct
34 Correct 1 ms 976 KB Output is correct
35 Correct 1 ms 976 KB Output is correct
36 Correct 1 ms 976 KB Output is correct
37 Correct 1 ms 976 KB Output is correct
38 Correct 1 ms 976 KB Output is correct
39 Correct 1 ms 976 KB Output is correct
40 Correct 1 ms 976 KB Output is correct
41 Correct 1 ms 1072 KB Output is correct
42 Correct 1 ms 976 KB Output is correct
43 Correct 1 ms 976 KB Output is correct
44 Correct 1 ms 976 KB Output is correct
45 Correct 1 ms 976 KB Output is correct
46 Correct 1 ms 976 KB Output is correct
47 Correct 1 ms 976 KB Output is correct
48 Correct 1 ms 976 KB Output is correct
49 Correct 1 ms 976 KB Output is correct
50 Correct 1 ms 976 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 976 KB Output is correct
2 Correct 1 ms 976 KB Output is correct
3 Correct 1 ms 976 KB Output is correct
4 Correct 1 ms 976 KB Output is correct
5 Correct 1 ms 976 KB Output is correct
6 Correct 1 ms 976 KB Output is correct
7 Correct 1 ms 976 KB Output is correct
8 Correct 1 ms 976 KB Output is correct
9 Correct 1 ms 976 KB Output is correct
10 Correct 1 ms 976 KB Output is correct
11 Correct 2 ms 976 KB Output is correct
12 Correct 1 ms 976 KB Output is correct
13 Correct 1 ms 976 KB Output is correct
14 Correct 1 ms 976 KB Output is correct
15 Correct 1 ms 976 KB Output is correct
16 Correct 1 ms 976 KB Output is correct
17 Correct 1 ms 976 KB Output is correct
18 Correct 1 ms 976 KB Output is correct
19 Correct 1 ms 976 KB Output is correct
20 Correct 1 ms 976 KB Output is correct
21 Correct 1 ms 976 KB Output is correct
22 Correct 1 ms 976 KB Output is correct
23 Correct 1 ms 976 KB Output is correct
24 Correct 1 ms 976 KB Output is correct
25 Correct 1 ms 976 KB Output is correct
26 Correct 1 ms 976 KB Output is correct
27 Correct 1 ms 976 KB Output is correct
28 Correct 1 ms 976 KB Output is correct
29 Correct 1 ms 976 KB Output is correct
30 Correct 1 ms 976 KB Output is correct
31 Correct 1 ms 976 KB Output is correct
32 Correct 1 ms 976 KB Output is correct
33 Correct 1 ms 976 KB Output is correct
34 Correct 1 ms 976 KB Output is correct
35 Correct 1 ms 976 KB Output is correct
36 Correct 1 ms 976 KB Output is correct
37 Correct 1 ms 976 KB Output is correct
38 Correct 1 ms 976 KB Output is correct
39 Correct 1 ms 976 KB Output is correct
40 Correct 1 ms 976 KB Output is correct
41 Correct 1 ms 976 KB Output is correct
42 Correct 1 ms 976 KB Output is correct
43 Correct 1 ms 1072 KB Output is correct
44 Correct 1 ms 1076 KB Output is correct
45 Correct 2 ms 976 KB Output is correct
46 Correct 1 ms 976 KB Output is correct
47 Correct 1 ms 976 KB Output is correct
48 Correct 1 ms 976 KB Output is correct
49 Correct 1 ms 1072 KB Output is correct
50 Correct 1 ms 976 KB Output is correct

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 976 KB Output is correct
2 Correct 1 ms 976 KB Output is correct
3 Correct 1 ms 976 KB Output is correct
4 Correct 1 ms 976 KB Output is correct
5 Correct 1 ms 976 KB Output is correct
6 Correct 1 ms 976 KB Output is correct
7 Correct 1 ms 976 KB Output is correct
8 Correct 1 ms 976 KB Output is correct
9 Correct 1 ms 976 KB Output is correct
10 Correct 1 ms 976 KB Output is correct
11 Correct 2 ms 976 KB Output is correct
12 Correct 1 ms 976 KB Output is correct
13 Correct 1 ms 976 KB Output is correct
14 Correct 1 ms 976 KB Output is correct
15 Correct 1 ms 976 KB Output is correct
16 Correct 1 ms 976 KB Output is correct
17 Correct 1 ms 976 KB Output is correct
18 Correct 1 ms 976 KB Output is correct
19 Correct 1 ms 976 KB Output is correct
20 Correct 1 ms 976 KB Output is correct
21 Correct 1 ms 976 KB Output is correct
22 Correct 1 ms 976 KB Output is correct
23 Correct 1 ms 976 KB Output is correct
24 Correct 1 ms 976 KB Output is correct
25 Correct 1 ms 976 KB Output is correct
26 Correct 1 ms 976 KB Output is correct
27 Correct 1 ms 976 KB Output is correct
28 Correct 1 ms 976 KB Output is correct
29 Correct 1 ms 976 KB Output is correct
30 Correct 1 ms 976 KB Output is correct
31 Correct 1 ms 1024 KB Output is correct
32 Correct 1 ms 976 KB Output is correct
33 Correct 1 ms 976 KB Output is correct
34 Correct 1 ms 976 KB Output is correct
35 Correct 1 ms 976 KB Output is correct
36 Correct 1 ms 976 KB Output is correct
37 Correct 1 ms 976 KB Output is correct
38 Correct 1 ms 976 KB Output is correct
39 Correct 1 ms 976 KB Output is correct
40 Correct 1 ms 976 KB Output is correct
41 Correct 1 ms 1072 KB Output is correct
42 Correct 1 ms 976 KB Output is correct
43 Correct 1 ms 976 KB Output is correct
44 Correct 1 ms 976 KB Output is correct
45 Correct 1 ms 976 KB Output is correct
46 Correct 1 ms 976 KB Output is correct
47 Correct 1 ms 976 KB Output is correct
48 Correct 1 ms 976 KB Output is correct
49 Correct 1 ms 976 KB Output is correct
50 Correct 1 ms 976 KB Output is correct
51 Correct 1 ms 976 KB Output is correct
52 Correct 1 ms 976 KB Output is correct
53 Correct 1 ms 976 KB Output is correct
54 Correct 1 ms 976 KB Output is correct
55 Correct 1 ms 976 KB Output is correct
56 Correct 1 ms 976 KB Output is correct
57 Correct 1 ms 976 KB Output is correct
58 Correct 1 ms 976 KB Output is correct
59 Correct 1 ms 976 KB Output is correct
60 Correct 1 ms 976 KB Output is correct
61 Correct 1 ms 976 KB Output is correct
62 Correct 1 ms 976 KB Output is correct
63 Correct 1 ms 976 KB Output is correct
64 Correct 1 ms 976 KB Output is correct
65 Correct 1 ms 976 KB Output is correct
66 Correct 1 ms 976 KB Output is correct
67 Correct 1 ms 976 KB Output is correct
68 Correct 1 ms 1072 KB Output is correct
69 Correct 1 ms 1076 KB Output is correct
70 Correct 2 ms 976 KB Output is correct
71 Correct 1 ms 976 KB Output is correct
72 Correct 1 ms 976 KB Output is correct
73 Correct 1 ms 976 KB Output is correct
74 Correct 1 ms 1072 KB Output is correct
75 Correct 1 ms 976 KB Output is correct
76 Correct 3 ms 976 KB Output is correct
77 Correct 10 ms 976 KB Output is correct
78 Correct 12 ms 976 KB Output is correct
79 Correct 8 ms 976 KB Output is correct
80 Correct 12 ms 976 KB Output is correct
81 Correct 5 ms 976 KB Output is correct
82 Correct 9 ms 976 KB Output is correct
83 Correct 8 ms 976 KB Output is correct
84 Correct 238 ms 1072 KB Output is correct
85 Correct 234 ms 976 KB Output is correct
86 Correct 188 ms 976 KB Output is correct
87 Correct 204 ms 976 KB Output is correct
88 Correct 234 ms 976 KB Output is correct
89 Correct 202 ms 976 KB Output is correct
90 Correct 212 ms 976 KB Output is correct
91 Correct 201 ms 976 KB Output is correct
92 Correct 1 ms 976 KB Output is correct
93 Correct 1 ms 1072 KB Output is correct
94 Correct 1 ms 976 KB Output is correct
95 Correct 1 ms 1068 KB Output is correct
96 Correct 1 ms 1072 KB Output is correct
97 Correct 1 ms 976 KB Output is correct
98 Correct 1 ms 1072 KB Output is correct
99 Correct 2 ms 1068 KB Output is correct
100 Correct 1 ms 1076 KB Output is correct
101 Correct 1 ms 976 KB Output is correct
102 Correct 1 ms 976 KB Output is correct
103 Correct 1 ms 1068 KB Output is correct
104 Correct 1 ms 1076 KB Output is correct
105 Correct 1 ms 976 KB Output is correct
106 Correct 1 ms 976 KB Output is correct
107 Correct 1 ms 976 KB Output is correct
108 Correct 1 ms 976 KB Output is correct
109 Correct 1 ms 1072 KB Output is correct
110 Correct 1 ms 976 KB Output is correct
111 Correct 1 ms 976 KB Output is correct
112 Correct 1 ms 976 KB Output is correct
113 Correct 1 ms 976 KB Output is correct
114 Correct 1 ms 1076 KB Output is correct
115 Correct 1 ms 976 KB Output is correct
116 Correct 1 ms 976 KB Output is correct
117 Correct 1 ms 976 KB Output is correct
118 Correct 1 ms 1072 KB Output is correct
119 Correct 1 ms 976 KB Output is correct
120 Correct 1 ms 976 KB Output is correct
121 Correct 1 ms 976 KB Output is correct
122 Correct 1 ms 1076 KB Output is correct
123 Correct 1 ms 976 KB Output is correct
124 Correct 1 ms 976 KB Output is correct
125 Correct 1 ms 976 KB Output is correct
126 Correct 1 ms 976 KB Output is correct
127 Correct 1 ms 976 KB Output is correct
128 Correct 1 ms 1076 KB Output is correct
129 Correct 1 ms 976 KB Output is correct
130 Correct 1 ms 976 KB Output is correct
131 Correct 1 ms 1068 KB Output is correct
132 Correct 1 ms 976 KB Output is correct
133 Correct 1 ms 976 KB Output is correct
134 Correct 1 ms 1076 KB Output is correct
135 Correct 1 ms 976 KB Output is correct