Submission #1219096

#TimeUsernameProblemLanguageResultExecution timeMemory
1219096brintonDistributing Candies (IOI21_candies)C++20
8 / 100
62 ms9032 KiB
#include "candies.h" #include <bits/stdc++.h> using namespace std; vector<int> distribute_candies(vector<int> c, vector<int> l,vector<int> r, vector<int> v) { int N = c.size(); int Q = l.size(); vector<long long> pref(N+1,0); for(int q = 0;q < Q;q++){ pref[l[q]] += v[q]; pref[r[q]+1] -= v[q]; } vector<int> ans(N,0); long long cur = 0; for(int i = 0;i < N;i++){ cur += pref[i]; ans[i] = min((long long)c[i],cur); } 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...