Submission #826847

#	Time	Username	Problem	Language	Result	Execution time	Memory
826847		Sohsoh84	Distributing Candies (IOI21_candies)	C++17	3 / 100	5075 ms	7296 KiB

candies

#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 i = 0; i < q; i++) {
		if (v[i] >= 0) {
			for (int j = l[i]; j <= r[i]; j++) {
				A[j] = (A[j] + v[i] >= c[j] ? c[j] : A[j] + v[i]);	
			}
		} else {
			for (int j = l[i]; j <= r[i]; 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 / 3
• Subtask 2: 0 / 8
• Subtask 3: 0 / 27
• Subtask 4: 0 / 29
• Subtask 5: 0 / 33