Submission #966124

#TimeUsernameProblemLanguageResultExecution timeMemory
966124AkibAzmainDistributing Candies (IOI21_candies)C++17
8 / 100
79 ms12884 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 < ll > s (n + 1);
  for (int i = 0; i < q; ++i)
    s[l[i]] += v[i], s[r[i] + 1] -= v[i];
  s.pop_back ();
  for (int i = 1; i < n; ++i) s[i] += s[i - 1];
  vector < int > ans (n);
  for (int i = 0; i < n; ++i) ans[i] = min (s[i], (ll) c[i]);
  return ans;
}
#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...