| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1240399 | trimkus | 사탕 분배 (IOI21_candies) | C++20 | 5091 ms | 7480 KiB |
#include "candies.h"
#include <bits/stdc++.h>
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();
vector<int> res(N);
int Q = l.size();
for (int i = 0; i < Q; ++i) {
for (int j = l[i]; j <= r[i]; ++j) {
// cout << j << " ";
res[j] = max(0, min(c[j], res[j] + v[i]));
}
// cout << "\n";
// for (int j = 0; j < N; ++j) {
// cout << res[j] << " ";
// }
// cout << "\n";
}
// cout << "\n";
return res;
}
| # | 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... | ||||
