oj.uz

Submission #404386

# Submission time Handle Problem Language Result Execution time Memory
404386 2021-05-14T10:09:53 Z AmineWeslati A Difficult(y) Choice (BOI21_books) C++14
45 / 100
 5 ms 3524 KB 
//Never stop trying
#include "bits/stdc++.h"
#include "books.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef long long ll;
typedef string str;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)

const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int MX = 2e5 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up

template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
//constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
ll random(ll a, ll b){
    return a + rng() % (b - a + 1);
}
#ifndef LOCAL  
#define cerr if(false) cerr
#endif
#define dbg(x) cerr << #x << " : " << x << endl; 
#define dbgs(x,y) cerr << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << #v << " : " << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;
#define here() cerr << "here" << endl;

void IO() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin); 
    freopen("output.txt", "w", stdout);
#endif
}
/////////////////////////ONLY CLEAN CODES ALLOWED/////////////////////////


vector<ll>memo(MX,-1);
ll get(int i){
	if(memo[i]!=-1) return memo[i]; 
	return memo[i]=skim(i);
}

void solve(int N, int K, ll A, int S) {
	ll x=0;
	FOR(i,1,K+1) x+=get(i);
	if(x>2*A){
		impossible();
		return; 
	}

	vi ans(K); iota(all(ans),1);
	if(x>=A){
		answer(ans);
		return;
	}

	int idx=-1,l=1,r=N;
	while(l<=r){
		int m=(l+r)/2;
		if(get(m)<=A){
			idx=m; 
			l=m+1;
		}
		else r=m-1;
	}
	assert(idx!=-1);
	if(idx+1<=N && x-get(K)+get(idx+1)<=2*A){
		ans[K-1]=idx+1;
		answer(ans);
		return; 
	}

	int i=1;
	while(idx && x<A){
		ans[i-1]=idx;
		x-=get(i); i++;
		x+=get(idx); idx--;
	}
	assert(x<=2*A);
	if(x>=A) answer(ans);
	else impossible();

	return; 
}

//Change your approach

Subtask #1
0 / 5.0

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

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1864 KB Output is correct
2 Correct 2 ms 1864 KB Output is correct
3 Correct 1 ms 1864 KB Output is correct
4 Correct 2 ms 1864 KB Output is correct
5 Correct 2 ms 1864 KB Output is correct
6 Correct 2 ms 1864 KB Output is correct
7 Correct 2 ms 1864 KB Output is correct
8 Incorrect 2 ms 1864 KB Incorrect
9 Halted 0 ms 0 KB -

Subtask #3
10.0 / 10.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
0 / 15.0

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

Subtask #6
20.0 / 20.0

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

Subtask #7
0 / 20.0

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