| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 548626 | cig32 | Distributing Candies (IOI21_candies) | C++17 | 5054 ms | 10856 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;
#include <cassert>
#include <cstdio>
#include <vector>
std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l,
std::vector<int> r, std::vector<int> v) {
int n = c.size();
std::vector<int> s(n);
int q = l.size();
int p[n], invp[n];
for(int i=0; i<n; i++) p[i] = 0, invp[i] = c[i];
for(int i=0; i<q; i++) {
for(int j=l[i]; j<=r[i]; j++) {
p[j] += v[i];
invp[j] -= v[i];
if(p[j] < 0) {
p[j] = 0, invp[j] = c[j];
}
if(invp[j] < 0) {
invp[j] = 0, p[j] = c[j];
}
}
}
for(int i=0; i<n; i++) s[i] = p[i];
return s;
}| # | 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... | ||||
