# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
435014 | Hegdahl | Distributing Candies (IOI21_candies) | C++17 | 5089 ms | 7264 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2,ssse3,sse4,mmx")
#include "candies.h"
#include <bits/stdc++.h>
#define ar array
using namespace std;
vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) {
int n = (int)c.size();
int q = (int)v.size();
vector<int> s(n);
for (int qq = 0; qq < q; ++qq) {
int i = l[qq], j = r[qq], x = v[qq];
for (int k = i; k <= j; ++k)
s[k] += x;
for (int k = i; k <= j; ++k)
if (s[k] < 0)
s[k] = 0;
for (int k = i; k <= j; ++k)
if (s[k] > c[k])
s[k] = c[k];
}
# | 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... |