oj.uz

Submission #1024206

# Submission time Handle Problem Language Result Execution time Memory
1024206 2024-07-15T16:10:27 Z Abito Distributing Candies (IOI21_candies) C++17
0 / 100
 64 ms 8016 KB 
#include "candies.h"
#include <bits/stdc++.h>
using namespace std;
const int N=2e5+5;
int n,q;
std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l,
                                    std::vector<int> r, std::vector<int> v) {

    n=c.size();
    q=l.size();
    vector<int> a(n,0),ans(n,0);
    for (int i=0;i<q;i++){
        a[l[i]]+=v[i];
        if (r[i]<n-1) a[r[i]+1]-=v[i];
    }
    for (int i=0;i<n;i++){
        if (i) a[i]+=a[i-1];
        ans[i]=min(a[i],c[i]);
    }return ans;
}

Subtask #1
0 / 3.0

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

Subtask #2
0 / 8.0

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