Submission #617409

#TimeUsernameProblemLanguageResultExecution timeMemory
617409amunduzbaevDistributing Candies (IOI21_candies)C++17
0 / 100
5044 ms12116 KiB
#include "candies.h" #include "bits/stdc++.h" using namespace std; #ifndef EVAL #include "grader.cpp" #endif 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<int> a(n); for(int i=0;i<q;i++){ l[i]--, r[i]--; for(int j=l[i];j<=r[i];j++){ a[i] += v[i]; a[i] = max(a[i], 0); a[i] = min(a[i], c[i]); } } return a; }
#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...