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