#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(), q = l.size();
vector<int> candies(n, 0);
if (n <= 2000 && q <= 2000)
{
for (int i = 0; i < q; i++)
{
int ll = l[i], rr = r[i];
while (ll <= rr)
{
candies[ll] += v[i];
if (candies[ll] > c[ll])
candies[ll] = c[ll];
if (candies[ll] < 0)
candies[ll] = 0;
ll++;
}
}
return candies;
}
else
{
vector<int> pref1(n, 0), pref2(n, 0);
for (int i = 0; i < q; i++)
{
pref1[l[i]] += v[i];
pref2[r[i]] += v[i];
}
for(int i=0;i<n;i++)
{
int ans = pref1[i];
if(i > 0)
ans -= pref2[i - 1];
candies[i] = min(candies[i], ans);
if(i < n - 1)
{
pref1[i + 1] += pref1[i];
pref2[i + 1] += pref2[i];
}
}
return candies;
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
320 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
2 ms |
340 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
82 ms |
8808 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Incorrect |
43 ms |
4976 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Incorrect |
45 ms |
4972 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
320 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
2 ms |
340 KB |
Output is correct |
6 |
Incorrect |
82 ms |
8808 KB |
Output isn't correct |
7 |
Halted |
0 ms |
0 KB |
- |