Submission #1240402

#TimeUsernameProblemLanguageResultExecution timeMemory
1240402trimkusDistributing Candies (IOI21_candies)C++20
8 / 100
60 ms9032 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) {
   int N = c.size();
   vector<int> res(N);
   int Q = l.size();
   vector<ll> delta(N + 1);
   for (int i = 0; i < Q; ++i) {
    delta[l[i]] += v[i];
    delta[r[i] + 1] -= v[i];
   }
   ll now = 0;
   for (int i = 0; i < N; ++i) {
    now += delta[i];
    res[i] = min(1LL * c[i], res[i] + now);
   }
   return res;
}
#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...