#include <bits/stdc++.h>
using namespace std;
vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) {
int ok = 1;
for(auto u : v)
if(u < 0)
ok=0;
int n = c.size(), q = l.size();
if(ok) {
vector<int>s(n);
vector<long long> pref(n+1,0);
for(int i=0; i<q; i++) {
pref[l[i]] += v[i];
pref[r[i]+1] -= v[i];
}
for(int i=1; i<=n; i++)
pref[i]+=pref[i-1];
for(int i=0; i<n; i++)
s[i] = min((long long)c[i],pref[i]);
return s;
} else {
vector<int>s(n,0);
for(int i=0; i<q; i++) {
for(int j=l[i]; j<=r[i]; j++) {
if(v[i] > 0)
s[j] = min((long long)c[j], (long long) s[j] + (long long)v[i]);
else
s[j] = max(0LL, (long long)s[j] + (long long)v[i]);
}
}
return s;
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Correct |
2 ms |
388 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
65 ms |
9044 KB |
Output is correct |
2 |
Correct |
61 ms |
9040 KB |
Output is correct |
3 |
Correct |
60 ms |
9300 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
130 ms |
8028 KB |
Output is correct |
3 |
Correct |
128 ms |
6032 KB |
Output is correct |
4 |
Execution timed out |
5030 ms |
13400 KB |
Time limit exceeded |
5 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
323 ms |
7784 KB |
Output is correct |
4 |
Correct |
320 ms |
3932 KB |
Output is correct |
5 |
Execution timed out |
5015 ms |
10832 KB |
Time limit exceeded |
6 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Correct |
2 ms |
388 KB |
Output is correct |
6 |
Correct |
65 ms |
9044 KB |
Output is correct |
7 |
Correct |
61 ms |
9040 KB |
Output is correct |
8 |
Correct |
60 ms |
9300 KB |
Output is correct |
9 |
Correct |
0 ms |
344 KB |
Output is correct |
10 |
Correct |
130 ms |
8028 KB |
Output is correct |
11 |
Correct |
128 ms |
6032 KB |
Output is correct |
12 |
Execution timed out |
5030 ms |
13400 KB |
Time limit exceeded |
13 |
Halted |
0 ms |
0 KB |
- |