Submission #615656

#	Time	Username	Problem	Language	Result	Execution time	Memory
615656		HamletPetrosyan	Distributing Candies (IOI21_candies)	C++17	11 / 100	100 ms	13252 KiB

candies

#include "candies.h"
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

#define ll long long
#define add push_back
#define pii pair<int, int>
#define len(a) ((int)(a).size())
#define all(a) a.begin(), a.end()

#define fr first
#define sc second

const int N = 3e5 + 5;

vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) {
	vector<int> ret;
	if(len(c) <= 2000 && len(l) <= 2000){
		int now = 0;
		for(int i = 0; i < len(c); i++){
			now = 0;
			for(int j = 0; j < len(l); j++){
				if(l[j] <= i && i <= r[j]) {
					if(v[j] < 0) now = max(0, now + v[j]);
					else now = min(c[i], now + v[j]);
				}
			}
			ret.add(now);
		}
		return ret;
	}
	vector<ll> dif;
	dif.resize(len(c) + 5, 0);
	for(int i = 0; i < len(l); i++){
		dif[l[i]] += (ll)v[i];
		dif[r[i] + 1] -= (ll)v[i];
	}
	ll now = 0;
	for(int i = 0; i < len(c); i++){
		now += dif[i];
		ret.add(min(now, (ll)c[i]));
	}
	return ret;
}

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