oj.uz

답안 #28807

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
28807 2017-07-17T08:40:11 Z ozaslan 쌀 창고 (IOI11_ricehub) C++14
17 / 100
 1000 ms 6080 KB 
#include "ricehub.h"
#include<bits/stdc++.h>

#include "ricehub.h"
#include <stdio.h>
#include <stdlib.h>

#define MAX_R  1000000

using namespace std;

/*
static int R, L;
static long long B;
static int X[MAX_R];
static int solution;

inline
void my_assert(int e) {if (!e) abort();}

static void read_input()
{
  int i;
  my_assert(3==scanf("%d %d %lld",&R,&L,&B));
  for(i=0; i<R; i++)
    my_assert(1==scanf("%d",&X[i]));
  my_assert(1==scanf("%d",&solution));
}

int main()
{
    freopen("grader.in.1", "r", stdin);
  int ans;
  read_input();
  ans = besthub(R,L,X,B);
  if(ans==solution)
    printf("Correct.\n");
  else
    printf("Incorrect.  Returned %d instead of %d.\n",ans,solution);

  return 0;
}*/

int besthub(int R, int L, int X[], long long B)
{
	int enIyi = 0;
	vector<int> uzak(R);

	for (int i = 0; i <= L; i++) {
		for (int j = 0; j < R; j++)
			uzak[j] = abs(i - X[j]);

		sort(uzak.begin(), uzak.end());

		long long toplam = 0;
		int k;
		for (k = 0; k < R && toplam <= B; k++)
			toplam += uzak[k];

		enIyi = max(enIyi, k-1);
	}

	return enIyi;
}

Subtask #1
17.0 / 17.0

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

Subtask #2
0 / 25.0

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

Subtask #3
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 5924 KB Output is correct
2 Correct 23 ms 5924 KB Output is correct
3 Execution timed out 1000 ms 5924 KB Execution timed out
4 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1000 ms 6080 KB Execution timed out
2 Halted 0 ms 0 KB -