Submission #467485

#TimeUsernameProblemLanguageResultExecution timeMemory
467485oliversommerDistributing Candies (IOI21_candies)C++17
3 / 100
5091 ms12704 KiB
#include "candies.h"

#include <algorithm>
#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();
	vector<int> s(n);

	for (int j = 0; j < l.size(); ++j) {
		for (int k = l[j]; k <= r[j]; ++k) {
			if (v[j] > 0) {
				s[k] = min(c[k], s[k] + v[j]);
			}
            else {
            	s[k] = max(0, s[k] + v[j]);    
            }
		}
	}

	return s;
}

Compilation message (stderr)

candies.cpp: In function 'std::vector<int> distribute_candies(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
candies.cpp:12:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |  for (int j = 0; j < l.size(); ++j) {
      |                  ~~^~~~~~~~~~
#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...