Submission #813914

#TimeUsernameProblemLanguageResultExecution timeMemory
813914alvingogoDistributing Candies (IOI21_candies)C++17
8 / 100
87 ms8892 KiB
#include "candies.h" #include <bits/stdc++.h> #define fs first #define sc second #define p_q priority_queue using namespace std; vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) { int n = c.size(); vector<long long> pre(n+1); int q=l.size(); for(int i=0;i<q;i++){ pre[l[i]]+=v[i]; pre[r[i]+1]-=v[i]; } for(int i=1;i<n;i++){ pre[i]+=pre[i-1]; } vector<int> s(n); for(int i=0;i<n;i++){ s[i]=(int)min((long long)c[i],pre[i]); } 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...