| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1325276 | eri16 | 사탕 분배 (IOI21_candies) | C++20 | 62 ms | 9680 KiB |
#include <bits/stdc++.h>
#include "candies.h"
using namespace std;
using ll = long long;
vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v){
int n=c.size();
int m=l.size();
vector <ll> ans(n,0);
vector <int> vv(n+1,0);
for(int i=0; i<m; i++){
vv[l[i]]+=v[i];
vv[r[i]+1]-=v[i];
}
ll cur=0;
for(int i=0; i<n; i++){
cur+=vv[i];
ans[i]=min(cur,(ll)c[i]);
}
vector <int> ans2(n);
for (int i=0; i<n; i++){
ans2[i]=ans[i];
}
return ans2;
}| # | 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... | ||||
