oj.uz

Submission #442949

# Submission time Handle Problem Language Result Execution time Memory
442949 2021-07-09T11:43:18 Z benedict0724 Distributing Candies (IOI21_candies) C++17
0 / 100
 132 ms 7336 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();
    int q = l.size();
    std::vector<int> s(n);
    for(int i=0;i<q;i++)
    {
        s[l[i]] += v[i];
        if(r[i] < n-1) s[r[i]+1] -= v[i];
    }
    for(int i=1;i<n;i++) s[i] += s[i-1];
    for(int i=0;i<n;i++) s[i] = max(s[i], c[i]);
    return s;
}

Subtask #1
0 / 3.0

# 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 -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 132 ms 7336 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 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 -