# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
979329 | 2024-05-10T16:01:00 Z | Isam | Distributing Candies (IOI21_candies) | C++17 | 5000 ms | 13396 KB |
#include "candies.h" #include<bits/stdc++.h> using namespace std; constexpr int sz = 2e5 + 5; int n, Q; vector<int> a; std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l, std::vector<int> r, std::vector<int> v){ n = (int)c.size(), Q = (int)r.size(); a.assign(n, 0); for(register int q = 0; q < Q; ++q){ for(register int i = l[q]; i <= r[q]; ++i){ if(v[q] > 0){ a[i] = min(c[i], a[i] + v[q]); }else{ a[i] = max(0, a[i] + v[q]); } } } return a; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 1 ms | 348 KB | Output is correct |
4 | Correct | 1 ms | 348 KB | Output is correct |
5 | Correct | 3 ms | 348 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 5020 ms | 7504 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 162 ms | 8172 KB | Output is correct |
3 | Correct | 172 ms | 6796 KB | Output is correct |
4 | Execution timed out | 5006 ms | 13396 KB | Time limit exceeded |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 1 ms | 344 KB | Output is correct |
3 | Correct | 406 ms | 7636 KB | Output is correct |
4 | Correct | 402 ms | 4844 KB | Output is correct |
5 | Execution timed out | 5014 ms | 10972 KB | Time limit exceeded |
6 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 1 ms | 348 KB | Output is correct |
4 | Correct | 1 ms | 348 KB | Output is correct |
5 | Correct | 3 ms | 348 KB | Output is correct |
6 | Execution timed out | 5020 ms | 7504 KB | Time limit exceeded |
7 | Halted | 0 ms | 0 KB | - |