Submission #1044206

# Submission time Handle Problem Language Result Execution time Memory
1044206 2024-08-05T08:01:08 Z Unforgettablepl Distributing Candies (IOI21_candies) C++17
0 / 100
54 ms 8024 KB
#include "candies.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> distribute_candies(vector<int> c, vector<int> l,
                               vector<int> r, vector<int> v){
    int n = c.size();
    int q = v.size();
    vector<int> s(n);
    vector<int> p(n+1);
    for(int i=0;i<q;i++){
        p[l[i]]+=v[i];
        p[r[i]+1]-=v[i];
    }
    for(int i=1;i<n;i++)p[i]+=p[i-1];
    for(int i=0;i<n;i++)s[i]=min(p[i],c[i]);
    return s;
}
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 54 ms 8024 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -