oj.uz

Submission #435501

# Submission time Handle Problem Language Result Execution time Memory
435501 2021-06-23T11:38:00 Z grt Distributing Candies (IOI21_candies) C++17
0 / 100
 5000 ms 10052 KB 
#include <bits/stdc++.h>
#define ST first
#define ND second
#define PB push_back

using namespace std;
using ll = long long;
using pi = pair<int,int>;
using vi = vector<int>;

int n, q;

vi distribute_candies(vi c, vi l, vi r, vi v) {
	n = (int)c.size();
	q = (int)l.size();
	vi ans(n);
	for(int i = 0; i < q; ++i) {
		for(int a = l[i]; a <= r[i]; a++) {
			ans[a] += v[i];
			ans[a] = max(ans[a], 0);
			ans[a] = min(ans[a], c[i]);
		}
	}
	return ans;
}

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 1 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 Execution timed out 5016 ms 7220 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Runtime error 84 ms 10052 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 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 1 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -