| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1133712 | alterio | 사탕 분배 (IOI21_candies) | C++20 | 62 ms | 8004 KiB |
#include <bits/stdc++.h>
#include "candies.h"
using namespace std;
vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) {
int n = c.size(), q = l.size();
vector<int> s(n);
int prf[n + 1];
memset(prf, 0, sizeof(prf));
for (int i = 0; i < q; i++) prf[l[i]] += v[i], prf[r[i] + 1] -= v[i];
int sum = 0;
for (int i = 0; i < n; i++) {
sum += prf[i];
s[i] = min(sum, c[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... | ||||
