Submission #1245067

#TimeUsernameProblemLanguageResultExecution timeMemory
1245067nicolo_010Distributing Candies (IOI21_candies)C++20
3 / 100
5093 ms7340 KiB
#include <bits/stdc++.h>
#include "candies.h"
using namespace std;
template <typename T>
using ve = vector<T>;
using ll = long long;
using pii = pair<int, int>;
#define rep(i, k, n) for (int i=k;i<n;i++)

ve<int> distribute_candies(ve<int> c, ve<int> l, ve<int> r, ve<int> v) {
	int n = c.size();
	int q = l.size();
	ve<int> a(n, 0);
	rep(i, 0, q) {
		rep(j, l[i], r[i]+1) {
			a[j] = (v[i] < 0 ? max(0, a[j]+v[i]) : min(c[j], a[j]+v[i]));
		}
	}
	return a;
}
#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...