Submission #1224525

#TimeUsernameProblemLanguageResultExecution timeMemory
1224525nikulidDistributing Candies (IOI21_candies)C++20
8 / 100
59 ms9032 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);
	vector<long long> ns(n+1, 0);
	for(int Q=0; Q<q; Q++){
		ns[l[Q]] += v[Q];
		ns[r[Q]+1] -= v[Q];
	}
	long long cur=0;
	for(int i=0; i<n; i++){
		cur += ns[i];
		s[i] = min(cur, (long long)c[i]);
	}


	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...