Submission #545855

#	Time	Username	Problem	Language	Result	Execution time	Memory
545855		fuad27	Distributing Candies (IOI21_candies)	C++17	8 / 100	117 ms	12972 KiB

candies

#include "candies.h"
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 200'010;
long long fen[MAXN];
void upd(int at, long long val) {
	at++;
	while(at < MAXN) {
		fen[at]+=val;


		at+=at&(-at);
	}
}
long long query(int r) {
	long long sum = 0;
	r++;
	while(r > 0) {
		sum+=fen[r];
		r-=r&(-r);
	}
	return sum;
}
vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) {
    int n = c.size();
    vector<int> s(n);
	for(int i = 0;i<MAXN;i++)fen[i] =0;
	for(int i = 0;i<n;i++) {
		upd(l[i], v[i]);
		upd(r[i]+1, -v[i]);
	}
	for(int i = 0;i<n;i++) {
		s[i] = min((long long)c[i], query(i));
	}
    return s;
}

• Subtask 1: 0 / 3
• Subtask 2: 8 / 8
• Subtask 3: 0 / 27
• Subtask 4: 0 / 29
• Subtask 5: 0 / 33