Submission #712145

#TimeUsernameProblemLanguageResultExecution timeMemory
712145danikoynovDistributing Candies (IOI21_candies)C++17
3 / 100
5070 ms13284 KiB
#include "candies.h" #include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 10; int n, q; vector < int > s; vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) { n = c.size(); q = l.size(); s.resize(n, 0); for (int i = 0; i < q; i ++) { for (int j = l[i]; j <= r[i]; j ++) { s[j] += v[i]; if (s[j] < 0) s[j] = 0; if (s[j] > c[j]) s[j] = c[j]; } } 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...