oj.uz

Submission #923405

# Submission time Handle Problem Language Result Execution time Memory
923405 2024-02-07T07:30:56 Z Edwin0319 Distributing Candies (IOI21_candies) C++17
100 / 100
 290 ms 36628 KB 
#include "candies.h"
#include <algorithm>
#include <vector>

using namespace std;

typedef long long ll;

typedef struct {
	int l;
	int r;
	ll sum;
	ll min_sum;
	ll max_sum;
} Node;

typedef struct {
	int id;
	int pos;
	int val;
} Query;

Node tree[800007];
Query query[400007];

bool operator <(const Query a, const Query b){
	return a.pos < b.pos;
}

void build(int x, int l, int r){
	tree[x].l = l;
	tree[x].r = r;
	if (l == r) return;
	int mid = (l + r) >> 1;
	build(x * 2, l, mid);
	build(x * 2 + 1, mid + 1, r);
}

inline void update(int x){
	int ls = x * 2, rs = x * 2 + 1;
	tree[x].sum = tree[ls].sum + tree[rs].sum;
	tree[x].min_sum = min(tree[ls].min_sum, tree[rs].min_sum + tree[ls].sum);
	tree[x].max_sum = max(tree[ls].max_sum, tree[rs].max_sum + tree[ls].sum);
}

void add(int x, int pos, int val){
	if (tree[x].l == tree[x].r){
		tree[x].sum += val;
		tree[x].min_sum = min(tree[x].sum, 0ll);
		tree[x].max_sum = max(tree[x].sum, 0ll);
		return;
	}
	if (pos <= ((tree[x].l + tree[x].r) >> 1)){
		add(x * 2, pos, val);
	} else {
		add(x * 2 + 1, pos, val);
	}
	update(x);
}

ll do_query(int x, int k, ll cur_sum, ll cur_min_sum, ll cur_max_sum){
	if (tree[x].l == tree[x].r) return (tree[x].sum <= 0 && cur_max_sum > k) || (tree[x].sum > 0 && cur_min_sum >= -k) ? k + cur_sum - cur_max_sum : cur_sum - cur_min_sum;
	int rs = x * 2 + 1;
	ll y = min(tree[rs].min_sum, cur_min_sum + tree[rs].sum), z = max(tree[rs].max_sum, cur_max_sum + tree[rs].sum);
	if (z - y > k) return do_query(rs, k, cur_sum, cur_min_sum, cur_max_sum);
	return do_query(x * 2, k, cur_sum + tree[rs].sum, y, z);
}

vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v){
	int n = c.size(), q = l.size(), m = 0;
	vector<int> ans;
	c.insert(c.begin(), 0);
	l.insert(l.begin(), 0);
	r.insert(r.begin(), 0);
	v.insert(v.begin(), 0);
	build(1, 0, q);
	for (register int i = 1; i <= q; i++){
		m++;
		query[m].id = i;
		query[m].pos = ++l[i];
		query[m].val = v[i];
		if (++r[i] < n){
			m++;
			query[m].id = i;
			query[m].pos = r[i] + 1;
			query[m].val = -v[i];
		}
	}
	sort(query + 1, query + m + 1);
	for (register int i = 1, j = 1; i <= n; i++){
		while (j <= m && query[j].pos == i){
			add(1, query[j].id, query[j].val);
			j++;
		}
		ans.push_back(do_query(1, c[i], 0, 0, 0));
	}
	return ans;
}

Compilation message

candies.cpp: In function 'std::vector<int> distribute_candies(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
candies.cpp:77:20: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   77 |  for (register int i = 1; i <= q; i++){
      |                    ^
candies.cpp:90:20: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   90 |  for (register int i = 1, j = 1; i <= n; i++){
      |                    ^
candies.cpp:90:27: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   90 |  for (register int i = 1, j = 1; i <= n; i++){
      |                           ^

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 2 ms 2440 KB Output is correct
5 Correct 2 ms 2652 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 240 ms 29864 KB Output is correct
2 Correct 237 ms 34056 KB Output is correct
3 Correct 262 ms 34064 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 173 ms 29472 KB Output is correct
3 Correct 44 ms 9264 KB Output is correct
4 Correct 254 ms 35948 KB Output is correct
5 Correct 250 ms 36112 KB Output is correct
6 Correct 278 ms 36628 KB Output is correct
7 Correct 227 ms 35860 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 70 ms 29324 KB Output is correct
4 Correct 42 ms 7132 KB Output is correct
5 Correct 118 ms 33324 KB Output is correct
6 Correct 124 ms 34212 KB Output is correct
7 Correct 128 ms 34792 KB Output is correct
8 Correct 130 ms 33460 KB Output is correct
9 Correct 120 ms 34724 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 2 ms 2440 KB Output is correct
5 Correct 2 ms 2652 KB Output is correct
6 Correct 240 ms 29864 KB Output is correct
7 Correct 237 ms 34056 KB Output is correct
8 Correct 262 ms 34064 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 173 ms 29472 KB Output is correct
11 Correct 44 ms 9264 KB Output is correct
12 Correct 254 ms 35948 KB Output is correct
13 Correct 250 ms 36112 KB Output is correct
14 Correct 278 ms 36628 KB Output is correct
15 Correct 227 ms 35860 KB Output is correct
16 Correct 0 ms 2392 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 70 ms 29324 KB Output is correct
19 Correct 42 ms 7132 KB Output is correct
20 Correct 118 ms 33324 KB Output is correct
21 Correct 124 ms 34212 KB Output is correct
22 Correct 128 ms 34792 KB Output is correct
23 Correct 130 ms 33460 KB Output is correct
24 Correct 120 ms 34724 KB Output is correct
25 Correct 1 ms 2392 KB Output is correct
26 Correct 45 ms 7120 KB Output is correct
27 Correct 161 ms 29228 KB Output is correct
28 Correct 263 ms 34560 KB Output is correct
29 Correct 234 ms 34832 KB Output is correct
30 Correct 290 ms 35216 KB Output is correct
31 Correct 241 ms 35348 KB Output is correct
32 Correct 238 ms 35352 KB Output is correct