#include "candies.h"
#include <bits/stdc++.h>
#define ll long long
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(),q=l.size();
vector <ll> vec;
for(int i=0;i<=n;i++) vec.push_back(0);
for(int i=0;i<q;i++) vec[l[i]]+=v[i],vec[r[i]+1]-=v[i];
vector <ll> solve;
solve.push_back(vec[0]);
for(int i=1;i<n;i++) solve.push_back(vec[i]+solve[i-1]);
for(int i=0;i<n;i++) solve[i]=min(solve[i],(ll)c[i]);
vector <int> solvedevdd;
for(int i=0;i<n;i++) solvedevdd.push_back(solve[i]);
return solvedevdd;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
111 ms |
11488 KB |
Output is correct |
2 |
Correct |
99 ms |
15564 KB |
Output is correct |
3 |
Correct |
98 ms |
15392 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |