| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1179392 | hyakup | Distributing Candies (IOI21_candies) | C++20 | 58 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(), m = l.size();
vector<int> resp(n);
for( int i = 0; i < m; i++ ){
resp[l[i]] += v[i];
if( r[i] < n - 1 ) resp[r[i] + 1] -= v[i];
}
for( int i = 1; i < n; i++ ) resp[i] += resp[i - 1];
for( int i = 0; i < n; i++ ) resp[i] = min( resp[i], c[i] );
return resp;
}
| # | 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... | ||||
