Submission #1016228

#	Time	Username	Problem	Language	Result	Execution time	Memory
1016228		pawned	Distributing Candies (IOI21_candies)	C++17	38 / 100	5013 ms	14200 KiB

candies

#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")
 
#include <bits/stdc++.h>
using namespace std;
 
#define fi first
#define se second
#define pb push_back
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
 
#include "candies.h"
 
vi distribute_candies(vi C, vi L, vi R, vi V) {
	int N = C.size();
	int Q = V.size();
	vi ans(N, 0);
	for (int i = 0; i < Q; i++) {
		for (int j = L[i]; j <= R[i]; j++) {
			ans[j] += V[i];
			ans[j] = max(ans[j], 0);
			ans[j] = min(ans[j], C[j]);
		}
	}
	return ans;
}

• Subtask 1: 3 / 3
• Subtask 2: 8 / 8
• Subtask 3: 27 / 27
• Subtask 4: 0 / 29
• Subtask 5: 0 / 33