Submission #1224516

#TimeUsernameProblemLanguageResultExecution timeMemory
1224516nikulidDistributing Candies (IOI21_candies)C++20
3 / 100
5088 ms7380 KiB
#include "candies.h"
#include <vector>

using  namespace std;

vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) {
	int n = c.size();
	int q = l.size();

	// subtask 1 (3 marks)
	vector<int> s(n, 0);
	for(int Q=0; Q<q; Q++){
		if(v[Q]>0){
			for(int i=l[Q]; i<=r[Q]; i++){
				s[i] = min(s[i]+v[Q], c[i]);
			}		
		} else if(v[Q]<0){
			for(int i=l[Q]; i<=r[Q]; i++){
				s[i] = max(s[i]+v[Q], 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...