#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx")
#include "candies.h"
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5;
const int T = 1000;
int A[MAXN];
vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) {
int q = l.size(), n = c.size();
vector<int> A(n, 0);
for (int s = 0; s < MAXN; s += T) {
int fl = s, fr = s + T - 1;
for (int i = 0; i < q; i++) {
int tl = (fl > l[i] ? fl : l[i]);
int tr = (fr < r[i] ? fr : r[i]);
for (int j = tl; j <= tr; j++) {
A[j] = A[j] + v[i];
A[j] = (A[j] >= c[j] ? c[j] : A[j]);
A[j] = (A[j] >= 0 ? A[j] : 0);
}
}
}
return A;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
2 ms |
340 KB |
Output is correct |
4 |
Correct |
2 ms |
340 KB |
Output is correct |
5 |
Correct |
2 ms |
340 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1821 ms |
7368 KB |
Output is correct |
2 |
Correct |
1794 ms |
7372 KB |
Output is correct |
3 |
Correct |
1813 ms |
7240 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
99 ms |
5040 KB |
Output is correct |
3 |
Correct |
62 ms |
3772 KB |
Output is correct |
4 |
Correct |
1811 ms |
7376 KB |
Output is correct |
5 |
Correct |
1816 ms |
7368 KB |
Output is correct |
6 |
Correct |
1822 ms |
7364 KB |
Output is correct |
7 |
Correct |
1802 ms |
7368 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
123 ms |
4940 KB |
Output is correct |
4 |
Correct |
82 ms |
2740 KB |
Output is correct |
5 |
Correct |
4880 ms |
7416 KB |
Output is correct |
6 |
Correct |
4840 ms |
7372 KB |
Output is correct |
7 |
Correct |
4950 ms |
7368 KB |
Output is correct |
8 |
Correct |
4829 ms |
7364 KB |
Output is correct |
9 |
Correct |
4861 ms |
7368 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
2 ms |
340 KB |
Output is correct |
4 |
Correct |
2 ms |
340 KB |
Output is correct |
5 |
Correct |
2 ms |
340 KB |
Output is correct |
6 |
Correct |
1821 ms |
7368 KB |
Output is correct |
7 |
Correct |
1794 ms |
7372 KB |
Output is correct |
8 |
Correct |
1813 ms |
7240 KB |
Output is correct |
9 |
Correct |
0 ms |
212 KB |
Output is correct |
10 |
Correct |
99 ms |
5040 KB |
Output is correct |
11 |
Correct |
62 ms |
3772 KB |
Output is correct |
12 |
Correct |
1811 ms |
7376 KB |
Output is correct |
13 |
Correct |
1816 ms |
7368 KB |
Output is correct |
14 |
Correct |
1822 ms |
7364 KB |
Output is correct |
15 |
Correct |
1802 ms |
7368 KB |
Output is correct |
16 |
Correct |
0 ms |
212 KB |
Output is correct |
17 |
Correct |
0 ms |
212 KB |
Output is correct |
18 |
Correct |
123 ms |
4940 KB |
Output is correct |
19 |
Correct |
82 ms |
2740 KB |
Output is correct |
20 |
Correct |
4880 ms |
7416 KB |
Output is correct |
21 |
Correct |
4840 ms |
7372 KB |
Output is correct |
22 |
Correct |
4950 ms |
7368 KB |
Output is correct |
23 |
Correct |
4829 ms |
7364 KB |
Output is correct |
24 |
Correct |
4861 ms |
7368 KB |
Output is correct |
25 |
Correct |
1 ms |
212 KB |
Output is correct |
26 |
Correct |
53 ms |
2644 KB |
Output is correct |
27 |
Correct |
95 ms |
4964 KB |
Output is correct |
28 |
Correct |
1817 ms |
7372 KB |
Output is correct |
29 |
Correct |
1810 ms |
7404 KB |
Output is correct |
30 |
Correct |
1806 ms |
7368 KB |
Output is correct |
31 |
Correct |
1816 ms |
7368 KB |
Output is correct |
32 |
Correct |
1823 ms |
7372 KB |
Output is correct |