| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1219061 | brinton | 사탕 분배 (IOI21_candies) | C++20 | 5095 ms | 7236 KiB |
#include "candies.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> distribute_candies(vector<int> c, vector<int> l,vector<int> r, vector<int> v) {
int N = c.size();
int Q = l.size();
vector<int> ans(N,0);
for(int q = 0;q < Q;q++){
for(int i = l[q];i <= r[q];i++){
ans[i] += v[q];
if(ans[i] > c[i]) v[i] = c[i];
if(ans[i] < 0) v[i] = 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... | ||||
