| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1308583 | SmuggingSpun | 사탕 분배 (IOI21_candies) | C++20 | 60 ms | 9248 KiB |
#include "candies.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<int>distribute_candies(vector<int>c, vector<int>l, vector<int>r, vector<int>v){
int n = c.size(), q = l.size();
if(max(n, q) <= 2000){
vector<int>ans(n, 0);
for(int i = 0; i < q; i++){
for(int j = l[i]; j <= r[i]; j++){
if(v[i] > 0){
ans[j] = min(c[j], ans[j] + v[i]);
}
else{
ans[j] = max(0, ans[j] + v[i]);
}
}
}
return ans;
}
else if(*min_element(v.begin(), v.end()) > 0){
vector<ll>f(n + 1, 0);
for(int i = 0; i < q; i++){
f[l[i]] += v[i];
f[r[i] + 1] -= v[i];
}
vector<int>ans;
ans.push_back(min(ll(c[0]), f[0]));
for(int i = 1; i < n; i++){
ans.push_back(min(ll(c[i]), f[i] += f[i - 1]));
}
return ans;
}
}
컴파일 시 표준 에러 (stderr) 메시지
| # | 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... | ||||
