oj.uz

답안 #105909

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
105909 2019-04-15T15:38:16 Z tincamatei 쌀 창고 (IOI11_ricehub) C++14
17 / 100
 1000 ms 1664 KB 
#include <bits/stdc++.h>
#include "ricehub.h"

using namespace std;

const int MAX_N = 100;

int aux[MAX_N];

bool works(int *v, int n, long long B) {
	for(int i = 0; i < n; ++i)
		aux[i] = v[i];
	
	sort(aux, aux + n);

	int med = aux[n / 2];

	for(int i = 0; i < n; ++i)
		B = B - abs(med - aux[i]);
	
	return (B >= 0);
}

int besthub(int R, int L, int X[], long long B) {
	int l;
	int rez = 0;

	// X[l...r] works
	l = 0;
	for(int r = 0; r < R; ++r) {
		while(l < r && !works(X + l, r - l + 1, B))
			l++;

		if(works(X + l, r - l + 1, B))
			rez = max(rez, r - l + 1);
	}

	return rez;
}

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 256 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 3 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 4 ms 384 KB Output is correct
22 Correct 4 ms 256 KB Output is correct
23 Incorrect 7 ms 256 KB Output isn't correct
24 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Incorrect 13 ms 384 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 63 ms 536 KB Output is correct
2 Correct 51 ms 512 KB Output is correct
3 Execution timed out 1067 ms 1664 KB Time limit exceeded
4 Halted 0 ms 0 KB -