oj.uz

Submission #979334

# Submission time Handle Problem Language Result Execution time Memory
979334 2024-05-10T16:20:10 Z Isam Distributing Candies (IOI21_candies) C++17
8 / 100
 226 ms 22612 KB 
#include "candies.h"

#include<bits/stdc++.h>
using namespace std;

constexpr int sz = 2e5 + 5;

int n, Q;

vector<int> a;

long long st[sz<<2], lazy[sz<<2];

inline void relax(int l, int r, int in){
	if(l ^ r){
		lazy[in<<1] += lazy[in], lazy[in<<1|1] += lazy[in];
	}
	st[in] += (r - l + 1) * lazy[in];
	lazy[in] = 0;
	return;
}

inline void update(int l, int r, int in, int L, int R, int val){
	if(lazy[in]) relax(l, r, in);
	if(l > R || r < L || r < l) return;
	if(l >= L && r <= R){
		lazy[in] = val;
		relax(l, r, in);
		return;
	}else{
		int mid = l + ((r - l) >> 1);
		update(l, mid, in << 1, L, R, val);
		update(mid + 1, r, in << 1 | 1, L, R, val);
		st[in] = st[in << 1] + st[in << 1 | 1];	
	}
	return;
}

long long get_ans(int l, int r, int in, int L, int R){
	if(lazy[in]) relax(l, r, in);
	if(l > R || r < L || r < l) return 0ll;
	if(l >= L && r <= R) return st[in];
	int mid = l + ((r - l) >> 1);
	return get_ans(l, mid, in << 1, L, R) + get_ans(mid + 1, r, in << 1 | 1, L, R);
} 


vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v){
	
	n = (int)c.size(), Q = (int)r.size();
	
	a.assign(n, 0);
	
	for(register int q = 0; q < Q; ++q){
		
		update(1, n, 1, l[q] + 1, r[q] + 1, v[q]);
		
	}
	
	
	for(register int i = 1; i <= n; ++i){
		a[i-1] = min((long long)c[i-1], get_ans(1, n, 1, i, i));
	}
	
	
	
	
	
	return a;
	
	
	
	
}

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:54:19: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   54 |  for(register int q = 0; q < Q; ++q){
      |                   ^
candies.cpp:61:19: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   61 |  for(register int i = 1; i <= n; ++i){
      |                   ^

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Incorrect 0 ms 2392 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 216 ms 18644 KB Output is correct
2 Correct 226 ms 22612 KB Output is correct
3 Correct 204 ms 22356 KB Output is correct

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2396 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2396 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Incorrect 0 ms 2392 KB Output isn't correct
3 Halted 0 ms 0 KB -