Submission #827008

#TimeUsernameProblemLanguageResultExecution timeMemory
827008tigranDistributing Candies (IOI21_candies)C++17
0 / 100
82 ms9580 KiB
#include "candies.h" #include <bits/stdc++.h> std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l, std::vector<int> r, std::vector<int> v) { int n = c.size(); std::vector<int> s(n); int q = l.size(); int V = 0; for (int i = 0; i < q; i++){ V += v[i]; } for (int i = 0; i < n; i++){ s[i] = c[i]; if (V < s[i]){ s[i] = V; } } 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...