Submission #438956

# Submission time Handle Problem Language Result Execution time Memory
438956 2021-06-29T01:34:25 Z jlozano254 Distributing Candies (IOI21_candies) C++17
0 / 100
5000 ms 12096 KB
#include "candies.h"

#include <vector>

using namespace std;

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);

    for (int i = 0; i <= n; ++i)
    {
        for (int j = l[i]; j <= r[i]; ++j)
        {
            if (v[i] < 0) {
                s[j] = max(0, s[j] + v[i]);
            }
            else {
                s[j] = min(c[j], s[j] + v[i]);
            }
        }
    }

    return s;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 332 KB Output isn't correct
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 5056 ms 12096 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 332 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Runtime error 1 ms 332 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 332 KB Output isn't correct
4 Halted 0 ms 0 KB -