# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
966194 | AkibAzmain | Distributing Candies (IOI21_candies) | C++17 | 146 ms | 24640 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.
#include "candies.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
std::vector<int> distribute_candies (std::vector<int> c, std::vector<int> l,
std::vector<int> r, std::vector<int> v)
{
ll n = c.size();
v.push_back (0);
vector < ll > a;
for (auto &x : v) a.push_back (x);
reverse (a.begin (), a.end ());
a.push_back (-1e18);
for (auto &x : a) x *= -1;
for (int i = 1; i < a.size (); ++i) a[i] += a[i - 1];
ll mn = 0, mx = 0;
vector < ll > mna (a.size ()), mxa = mna;
map < ll, int > mp;
for (int i = 0; i < a.size (); ++i)
{
mna[i] = mn = min (mn, a[i]);
mxa[i] = mx = max (mx, a[i]);
if (mp.count (mx - mn) == 0) mp[mx - mn] = i;
}
vector < int > ans (n);
for (int i = 0; i < n; ++i)
{
int j = mp.lower_bound (c[i])->second;
if (a[j] == mna[j])
ans[i] = c[i] - mxa[j];
else
ans[i] = -mna[j];
if (ans[i] < 0) ans[i] += c[i];
}
return ans;
}
Compilation message (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... |