oj.uz

Submission #1062727

# Submission time Handle Problem Language Result Execution time Memory
1062727 2024-08-17T10:04:21 Z fv3 Distributing Candies (IOI21_candies) C++17
0 / 100
 65 ms 8944 KB 
#include "candies.h"
#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<ll> ps(N+1);

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

    vector<int> s(N);
    ll sum = 0;
    for (int i = 0; i < N; i++)
    {
        sum += ps[i];
        s[i] = max((ll)c[i], sum);
    }
    return s;
}

Subtask #1
0 / 3.0

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

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 65 ms 8944 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 344 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 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

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