oj.uz

Submission #109859

# Submission time Handle Problem Language Result Execution time Memory
109859 2019-05-08T07:55:19 Z mohammad Rice Hub (IOI11_ricehub) C++14
0 / 100
 1000 ms 896 KB 
#include "ricehub.h"
#include "iostream"
#include "vector"
#include "map"
#include "math.h"
#include "string"
#include "algorithm"
#include "set"
#include <iterator>
#include <string.h>
#include <queue>
#include <list>

using namespace	std;

typedef long long ll ;
const ll M = 1e9 + 7 ;
const ll oo = 1e13 ;

int besthub(int R, int L, int X[], long long B){
	int best = 0 ;
	for(int i = 1 ; i < L ; ++i){
		int a[10010];
		for(int j = 0 ; j < R ; ++j){
			a[j] = abs(i - X[j]);
		}
		sort(a , a + R);
		int b = B , co = 0;
		while(b){
			if(b > a[co]){
				b -= a[co];
			}else{
				best = max(best , co);
			}
			co++;
		}
	}
	return best;
}

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1075 ms 256 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1067 ms 384 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1069 ms 384 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Runtime error 9 ms 896 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -