Submission #1044210

# Submission time Handle Problem Language Result Execution time Memory
1044210 2024-08-05T08:02:05 Z Unforgettablepl Distributing Candies (IOI21_candies) C++17
8 / 100
59 ms 13020 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<long long> 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],(long long)c[i]);
    return s;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 57 ms 8960 KB Output is correct
2 Correct 56 ms 13020 KB Output is correct
3 Correct 59 ms 12888 KB Output is correct
# 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 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -