Submission #1048122

# Submission time Handle Problem Language Result Execution time Memory
1048122 2024-08-07T23:39:08 Z vjudge1 Distributing Candies (IOI21_candies) C++17
0 / 100
58 ms 7252 KB
#include "candies.h"

#include<bits/stdc++.h>
using namespace std;
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();
    std::vector<int> s(n+1);
    int q=l.size();
    for(int i=0;i<q;i++)
        s[l[i]]+=v[i],s[r[i]+1]-=v[i];
    for(int i=1;i<n;i++)
        s[i]+=s[i-1];
    for(int i=0;i<n;i++)
        s[i]=min(s[i],c[i]);
    s.pop_back();
    return s;
}
# 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 58 ms 7252 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 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 348 KB Output isn't correct
2 Halted 0 ms 0 KB -