Submission #617426

#TimeUsernameProblemLanguageResultExecution timeMemory
617426amunduzbaevDistributing Candies (IOI21_candies)C++17
8 / 100
109 ms12972 KiB
#include "candies.h" #include "bits/stdc++.h" using namespace std; #ifndef EVAL #include "grader.cpp" #endif typedef long long ll; 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<ll> a(n); for(int i=0;i<q;i++){ a[l[i]] += v[i]; if(r[i] + 1 < n) a[r[i] + 1] -= v[i]; } vector<int> b(n); for(int i=0;i<n;i++){ if(i) a[i] += a[i-1]; b[i] = min(a[i], 1ll * c[i]); } return b; }
#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...