| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1243278 | guanex | 사탕 분배 (IOI21_candies) | C++20 | 60 ms | 9032 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);
vector<long long> sweep(c.size() + 1, 0);
for(int i = 0; i < (int)l.size(); ++i){
sweep[l[i]] += v[i];
sweep[r[i]+1] -= v[i];
}
long long cnt = 0;
for(int i = 0; i < (int)c.size(); ++i){
cnt += sweep[i];
ans[i] = min(cnt, 1LL * c[i]);
}
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... | ||||
