Submission #436323

# Submission time Handle Problem Language Result Execution time Memory
436323 2021-06-24T12:31:13 Z gromperen Distributing Candies (IOI21_candies) C++17
0 / 100
165 ms 8884 KB
#include "candies.h"
#include <bits/stdc++.h>

using namespace std;

std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l,
		std::vector<int> r, std::vector<int> v) {
	int n = c.size();
	int q = l.size();
	vector<int> s(n);
	vector<long long> pre(n+1);

	for (int i = 0; i < q; ++i) {
		pre[l[i]] += v[i];
		pre[r[i]+1] -= v[i];
	}
	for (int i = 0; i < n; ++i) {
		if (i > 0) pre[i] += pre[i-1];
		s[i] = max(pre[i], 1LL * c[i]);
	}
	return s;
}
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 165 ms 8884 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -