oj.uz

Submission #474243

# Submission time Handle Problem Language Result Execution time Memory
474243 2021-09-17T13:16:57 Z oliversommer Distributing Candies (IOI21_candies) C++17
0 / 100
 124 ms 8784 KB 
#include "candies.h"

#include <limits.h>

#include <algorithm>
#include <vector>

using namespace std;

vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) {
	int n = c.size();
	int q = l.size();
	vector<int> s(n);
	vector<long long> lls(n);

	// queries
	for (int j = 0; j < q; ++j) {
		int left = l[j];
		int right = r[j];

		lls[left] += v[j];
		if (right < n - 1) {
			lls[right] -= v[j];
		}
	}

	// prefix sum
	for (int i = 1; i < n; ++i) {
		lls[i] += lls[i - 1];
	}

	// capacity
	for (int i = 0; i < n; ++i) {
		s[i] = min(max(lls[i], 0ll), (long long) c[i]);
	}

	return s;
}

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 0 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 124 ms 8784 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 0 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -