oj.uz

Submission #826858

# Submission time Handle Problem Language Result Execution time Memory
826858 2023-08-16T05:31:06 Z Sohsoh84 Distributing Candies (IOI21_candies) C++17
11 / 100
 5000 ms 9124 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;

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 += 100) {
		int fl = s, fr = s + 99;

		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 1 ms 256 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 9 ms 352 KB Output is correct
4 Correct 10 ms 356 KB Output is correct
5 Correct 9 ms 340 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4638 ms 8468 KB Output is correct
2 Correct 4479 ms 9124 KB Output is correct
3 Correct 4493 ms 8984 KB Output is correct

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2451 ms 5036 KB Output is correct
3 Correct 73 ms 4656 KB Output is correct
4 Execution timed out 5091 ms 7688 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 2459 ms 5040 KB Output is correct
4 Correct 140 ms 3828 KB Output is correct
5 Execution timed out 5064 ms 6904 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 9 ms 352 KB Output is correct
4 Correct 10 ms 356 KB Output is correct
5 Correct 9 ms 340 KB Output is correct
6 Correct 4638 ms 8468 KB Output is correct
7 Correct 4479 ms 9124 KB Output is correct
8 Correct 4493 ms 8984 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 2451 ms 5036 KB Output is correct
11 Correct 73 ms 4656 KB Output is correct
12 Execution timed out 5091 ms 7688 KB Time limit exceeded
13 Halted 0 ms 0 KB -