oj.uz

Submission #440231

# Submission time Handle Problem Language Result Execution time Memory
440231 2021-07-01T19:17:32 Z BaraaArmoush Distributing Candies (IOI21_candies) C++17
8 / 100
 149 ms 12872 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

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> a(n);
    vector<ll> p(n + 1);

    for (int j = 0; j < q; j++) {
        p[l[j]] += v[j];
        p[r[j] + 1] -= v[j];
    }

    for (int i = 1; i <= n; i++) {
        p[i] += p[i - 1];
    }

    for (int i = 0; i < n; i++) {
        a[i] = min((ll)c[i], p[i]);
    }

    return a;
}

Subtask #1
0 / 3.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 141 ms 8884 KB Output is correct
2 Correct 149 ms 12872 KB Output is correct
3 Correct 129 ms 12868 KB Output is correct

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 1 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 1 ms 204 KB Output is correct
2 Incorrect 0 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -