#include "candies.h"
#include <cstdio>
#include <vector>
#include <algorithm>
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(), q = l.size();
std::vector<int> s(n);
std::vector<long long int> ps(n), cand(n+1);
for(int i=0; i<q; i++){
cand[l[i]] += v[i];
cand[r[i]+1] -= v[i];
}
ps[0] = cand[0];
for(int i=1; i<n; i++){
cand[i] += cand[i-1];
ps[i] = cand[i];
}
for(int i=0; i<n; i++) ps[i] = std::min((long long int) c[i],ps[i]);
for(int i=0; i<n; i++) s[i] = ps[i];
return s;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
137 ms |
10408 KB |
Output is correct |
2 |
Correct |
131 ms |
14488 KB |
Output is correct |
3 |
Correct |
145 ms |
14360 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
256 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |