| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1208065 | bangan | 사탕 분배 (IOI21_candies) | C++20 | 5093 ms | 7240 KiB |
#include "candies.h"
#include <vector>
std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l_in, std::vector<int> r_in, std::vector<int> v_in) {
int n = c.size();
int q = l_in.size();
std::vector<int> cur(n);
for (int i = 0; i < q; i++) {
int l = l_in[i];
int r = r_in[i];
int x = v_in[i];
for (int i = l; i <= r; i++) {
cur[i] += x;
if (cur[i] < 0) {
cur[i] = 0;
}
if (cur[i] > c[i]) {
cur[i] = c[i];
}
}
}
return cur;
}
| # | 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... | ||||
