Submission #521530

# Submission time Handle Problem Language Result Execution time Memory
521530 2022-02-02T11:12:45 Z marat0210 Distributing Candies (IOI21_candies) C++17
0 / 100
5000 ms 12192 KB
#include <candies.h>
#include <bits/stdc++.h>

using namespace std;

vector <int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v)
{
    int n = c.size();
    int q = l.size();
    vector <int> res(n);
    for (int i = 0; i < n; ++i) {
        res[i] = c[i];
    }
    for (int i = 0; i < q; ++i) {
        if (v[i] > 0) {
            for (int j = l[i]; j <= r[i]; ++j) {
                res[j] = min(c[j], res[j] + v[i]);
            }
        }
        else {
            for (int j = l[i]; j <= r[i]; ++j) {
                res[j] = max(0, res[j] + v[i]);
            }
        }
    }
    return res;
}

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 0 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 5027 ms 12192 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 296 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 0 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -