| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1195323 | DeathIsAwe | 사탕 분배 (IOI21_candies) | C++20 | 5094 ms | 7344 KiB |
#include "candies.h"
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define ll long long
using namespace std;
vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) {
int n = c.size(), q = l.size();
vector<int> s(n);
for (int i=0;i<n;i++) {
s[i] = 0;
}
for (int i=0;i<q;i++) {
if (v[i] > 0) {
for (int j=l[i];j<=r[i];j++) {
s[j] = min(c[j], s[j] + v[i]);
}
} else {
for (int j=l[i];j<=r[i];j++) {
s[j] = max(0, s[j] + v[i]);
}
}
}
return s;
}
| # | 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... | ||||
