Submission #617409

# Submission time Handle Problem Language Result Execution time Memory
617409 2022-08-01T11:13:23 Z amunduzbaev Distributing Candies (IOI21_candies) C++17
0 / 100
5000 ms 12116 KB
#include "candies.h"

#include "bits/stdc++.h"
using namespace std;

#ifndef EVAL
#include "grader.cpp"
#endif

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> a(n);
	for(int i=0;i<q;i++){
		l[i]--, r[i]--;
		for(int j=l[i];j<=r[i];j++){
			a[i] += v[i];
			a[i] = max(a[i], 0);
			a[i] = min(a[i], c[i]);
		}
	}
	
	return a;
}
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 5044 ms 12116 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -