# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1058411 | vjudge1 | Distributing Candies (IOI21_candies) | C++17 | 69 ms | 11356 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "candies.h"
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
vi distribute_candies(vi c, vi l, vi r, vi v) {
int n = c.size(), q = l.size();
bool all_poz = true;
for(auto it : v)
if(it < 0) all_poz = false;
if(n <= 2000 && q <= 2000) {
vi A(n, 0);
for(int i = 0; i < q; ++i) {
for(int j = l[i]; j <= r[i]; ++j) {
A[j] += v[i];
A[j] = max(A[j], 0);
A[j] = min(A[j], c[j]);
}
}
return A;
}
return vi();
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |