Submission #798827

#TimeUsernameProblemLanguageResultExecution timeMemory
798827khshgDistributing Candies (IOI21_candies)C++17
8 / 100
85 ms12884 KiB
#include <bits/stdc++.h> using namespace std; #define pb push_back vector<int> distribute_candies(vector<int> C, vector<int> L, vector<int> R, vector<int> V) { int Q = (int)L.size(), N = (int)C.size(); vector<int> ans0(N); vector<long long> ans(N); for(int i = 0; i < Q; ++i) { ans[L[i]] += V[i]; if(R[i] + 1 < N) ans[R[i] + 1] -= V[i]; } for(int i = 1; i < N; ++i) { ans[i] += ans[i - 1]; } for(int i = 0; i < N; ++i) { ans[i] = min(ans[i], (long long)C[i]); ans0[i] = (int)ans[i]; } return ans0; }
#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...