Submission #826888

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
826888	2023-08-16T05:57:02 Z	Sohsoh84	Distributing Candies (IOI21_candies)	C++17	100 / 100	4941 ms	7924 KB

candies

#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 = 700;

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;
}

Subtask #1

3.0 / 3.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	352 KB	Output is correct
5	Correct	2 ms	340 KB	Output is correct

Subtask #2

8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1913 ms	7372 KB	Output is correct
2	Correct	1888 ms	7408 KB	Output is correct
3	Correct	1864 ms	7368 KB	Output is correct

Subtask #3

27.0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	116 ms	5032 KB	Output is correct
3	Correct	57 ms	3840 KB	Output is correct
4	Correct	1938 ms	7372 KB	Output is correct
5	Correct	1875 ms	7376 KB	Output is correct
6	Correct	1887 ms	7368 KB	Output is correct
7	Correct	1875 ms	7424 KB	Output is correct

Subtask #4

29.0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	141 ms	5040 KB	Output is correct
4	Correct	90 ms	2816 KB	Output is correct
5	Correct	4941 ms	7368 KB	Output is correct
6	Correct	4917 ms	7368 KB	Output is correct
7	Correct	4897 ms	7368 KB	Output is correct
8	Correct	4833 ms	7628 KB	Output is correct
9	Correct	4899 ms	7880 KB	Output is correct

Subtask #5

33.0 / 33.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	352 KB	Output is correct
5	Correct	2 ms	340 KB	Output is correct
6	Correct	1913 ms	7372 KB	Output is correct
7	Correct	1888 ms	7408 KB	Output is correct
8	Correct	1864 ms	7368 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	116 ms	5032 KB	Output is correct
11	Correct	57 ms	3840 KB	Output is correct
12	Correct	1938 ms	7372 KB	Output is correct
13	Correct	1875 ms	7376 KB	Output is correct
14	Correct	1887 ms	7368 KB	Output is correct
15	Correct	1875 ms	7424 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	141 ms	5040 KB	Output is correct
19	Correct	90 ms	2816 KB	Output is correct
20	Correct	4941 ms	7368 KB	Output is correct
21	Correct	4917 ms	7368 KB	Output is correct
22	Correct	4897 ms	7368 KB	Output is correct
23	Correct	4833 ms	7628 KB	Output is correct
24	Correct	4899 ms	7880 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	53 ms	2904 KB	Output is correct
27	Correct	115 ms	5300 KB	Output is correct
28	Correct	1883 ms	7880 KB	Output is correct
29	Correct	1886 ms	7908 KB	Output is correct
30	Correct	1904 ms	7876 KB	Output is correct
31	Correct	1885 ms	7924 KB	Output is correct
32	Correct	1876 ms	7876 KB	Output is correct