Submission #1007803

#TimeUsernameProblemLanguageResultExecution timeMemory
1007803jer033Distributing Candies (IOI21_candies)C++17
0 / 100
5057 ms7372 KiB
#include "candies.h" #include <vector> #include <bits/stdc++.h> using namespace std; int bound(int a, int b) { if (a<0) return 0; if (a>b) return b; return a; } 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, 0); int q = v.size(); for (int i=0; i<q; i++) { for (int j=l[i]; j<=r[i]; j++) { if (v[j]>0) { s[j] = min(c[j], s[j]+v[j]); } else { s[j] = max(c[j], s[j]+v[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...