# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
835342 | 2023-08-23T13:33:02 Z | azatega | Distributing Candies (IOI21_candies) | C++17 | 1612 ms | 7268 KB |
#include "candies.h" #include <vector> using namespace std; vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) { int n = c.size(); vector<int> s(n); if(n <= 2000){ for(int i = 0; i < n; i++){ for(int j = 0; j < v.size(); j++){ if(i >= l[j] && i <= r[j]){ s[i] += v[j]; s[i] = max(s[i], 0); s[i] = min(s[i], c[i]); } } } }else{ for(int j = 0; j < v.size(); j++){ s[l[j]] += v[j]; if(r[j] + 1 < n) s[r[j] + 1] -= v[j]; } int curr = 0; for(int i = 0; i < n; i++){ curr += s[i]; s[i] = min(c[i], curr); } } return s; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
4 | Correct | 1 ms | 212 KB | Output is correct |
5 | Correct | 7 ms | 340 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 74 ms | 7268 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 1612 ms | 5016 KB | Output is correct |
3 | Incorrect | 37 ms | 4028 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 918 ms | 5012 KB | Output is correct |
4 | Incorrect | 40 ms | 3652 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
4 | Correct | 1 ms | 212 KB | Output is correct |
5 | Correct | 7 ms | 340 KB | Output is correct |
6 | Incorrect | 74 ms | 7268 KB | Output isn't correct |
7 | Halted | 0 ms | 0 KB | - |