Submission #435785

#	Time	Username	Problem	Language	Result	Execution time	Memory
435785		paisie	Distributing Candies (IOI21_candies)	C++17	3 / 100	5085 ms	7348 KiB

candies

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define forr(X) for(int i = 0; i<X; i++)
#pragma GCC optimize("Ofast")



vector<int> distribute_candies(vector <int> c, vector<int> l, vector <int>r, vector<int> v){
	int n = c.size();
	int q = l.size();
	
	vector <int> k(n, 0);
	
	forr(q){
		for(int j = l[i]; j<=r[i]; j++){
			if(v[i]>0)k[j] = min(c[j], k[j]+v[i]);
			else k[j] = max(0, k[j]+v[i]);
		}
	}
		
	return k;
 }

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