Submission #545861

#TimeUsernameProblemLanguageResultExecution timeMemory
545861fuad27Distributing Candies (IOI21_candies)C++17
0 / 100
5036 ms7272 KiB
#include "candies.h"
#include<bits/stdc++.h>
using namespace std;
vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) {
    int n = c.size();
    vector<int> s(n, 0);
	for(int i = 0;i<n;i++) {
		for(int j = l[i];j<=r[i];j++) {
			if(v[i] > 0) {
				s[j] = min(s[j] + v[i], c[j]);
			}
			else {
				s[j] = max(s[j] + v[i], 0);
			}
		}
	}
    return s;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...