Submission #966118

#TimeUsernameProblemLanguageResultExecution timeMemory
966118AkibAzmainDistributing Candies (IOI21_candies)C++17
3 / 100
5043 ms13284 KiB
#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(), q = v.size ();
  vector < int > s (n);
  for (int i = 0; i < q; ++i)
    for (int j = l[i]; j <= r[i]; ++j)
      s[j] += v[i], s[j] = max (s[j], 0), s[j] = min (s[j], c[j]);
  return s;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...