oj.uz

Submission #1058904

# Submission time Handle Problem Language Result Execution time Memory
1058904 2024-08-14T14:56:14 Z LittleOrange Distributing Candies (IOI21_candies) C++17
0 / 100
 55 ms 8272 KB 
#include "candies.h"

#include <vector>
#include<bits/stdc++.h>
using namespace std;
using ll = int;

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();
    ll q = l.size();
    vector<ll> a(n+1,0);
    for(ll i = 0;i<q;i++){
        a[l[i]] += v[i];
        a[r[i]+1] -= v[i];
    }
    for(ll i = 0;i<n;i++) a[i+1] += a[i];
    vector<ll> out(n,0);
    for(ll i = 0;i<n;i++) out[i] = min(c[i],a[i]);
    return out;
}

Subtask #1
0 / 3.0

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

Subtask #2
0 / 8.0

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

Subtask #3
0 / 27.0

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