| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1334100 | activedeltorre | Distributing Candies (IOI21_candies) | C++20 | 60 ms | 10788 KiB |
#include "candies.h"
#include <iostream>
#include <cassert>
#include <cstdio>
#include <vector>
int cap[200005];
int val[200005];
long long spar[200005];
using namespace std;
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();
for(int i=1;i<=n;i++)
{
cap[i]=c[i-1];
val[i]=0;
}
for(int i=0;i<l.size();i++)
{
spar[l[i]+1]+=v[i];
spar[r[i]+2]-=v[i];
}
vector<int>rasp;
for(int i=1;i<=n;i++)
{
spar[i]=spar[i-1]+spar[i];
rasp.push_back(min((long long)cap[i],spar[i]));
}
return rasp;
}| # | 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... | ||||
