| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1334097 | activedeltorre | Distributing Candies (IOI21_candies) | C++20 | 5091 ms | 8224 KiB |
#include "candies.h"
#include <iostream>
#include <cassert>
#include <cstdio>
#include <vector>
int cap[200005];
int val[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++)
{
for(int j=l[i]+1;j<=r[i]+1;j++)
{
val[j]+=v[i];
val[j]=max(val[j],0);
val[j]=min(val[j],cap[j]);
}
}
vector<int>rasp;
for(int i=1;i<=n;i++)
{
rasp.push_back(val[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... | ||||
