oj.uz

Submission #826863

# Submission time Handle Problem Language Result Execution time Memory
826863 2023-08-16T05:34:55 Z Sohsoh84 Distributing Candies (IOI21_candies) C++17
38 / 100
 5000 ms 8540 KB 
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2")

#include "candies.h"
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 2e5;
const int T = 500;

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();
	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]);
			if (v[i] >= 0) {
				for (int j = tl; j <= tr; j++) {
					A[j] = (A[j] + v[i] >= c[j] ? c[j] : A[j] + v[i]);	
				}
			} else {
				for (int j = tl; j <= tr; j++) {
					A[j] = (A[j] + v[i] >= 0 ? A[j] + v[i] : 0);
				}
			}
		}
	}

	vector<int> ans;
	for (int i = 0; i < n; i++) ans.push_back(A[i]);
	return ans;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory 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 3 ms 356 KB Output is correct
5 Correct 3 ms 340 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3068 ms 8440 KB Output is correct
2 Correct 3103 ms 8432 KB Output is correct
3 Correct 3065 ms 8540 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 570 ms 5036 KB Output is correct
3 Correct 70 ms 4668 KB Output is correct
4 Correct 3289 ms 8468 KB Output is correct
5 Correct 3278 ms 8400 KB Output is correct
6 Correct 3305 ms 8424 KB Output is correct
7 Correct 2788 ms 8452 KB Output is correct

Subtask #4
0 / 29.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 599 ms 5036 KB Output is correct
4 Correct 118 ms 3784 KB Output is correct
5 Execution timed out 5089 ms 7056 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory 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 3 ms 356 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 3068 ms 8440 KB Output is correct
7 Correct 3103 ms 8432 KB Output is correct
8 Correct 3065 ms 8540 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 570 ms 5036 KB Output is correct
11 Correct 70 ms 4668 KB Output is correct
12 Correct 3289 ms 8468 KB Output is correct
13 Correct 3278 ms 8400 KB Output is correct
14 Correct 3305 ms 8424 KB Output is correct
15 Correct 2788 ms 8452 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 599 ms 5036 KB Output is correct
19 Correct 118 ms 3784 KB Output is correct
20 Execution timed out 5089 ms 7056 KB Time limit exceeded
21 Halted 0 ms 0 KB -