답안 #225650

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
225650	2020-04-21T02:44:29 Z	chubyxdxd	쌀 창고 (IOI11_ricehub)	C++11	68 / 100	1000 ms	1792 KB

ricehub

#include "ricehub.h"
#include <bits/stdc++.h>
#include <stdio.h>
#include <stdlib.h>

#define MAX_R  1000000
using namespace std;
typedef long long ll;
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 besthub(int R, int L, int x[], long long B){
  ll maxrice=0;
  for(int i=0;i<R;i++){
    ll curr=B;
    ll currrice=1;
    ll lf=i-1,rh=i+1;
    while(lf>=0 and rh<R){
      ll pos=abs(x[i]-x[lf]);
      ll pos1=abs(x[i]-x[rh]);
      if(curr<pos and curr<pos1)break;
      if(pos<pos1){
	curr-=pos;
	lf--;
	currrice++;
      }
      else{
	curr-=pos1;
	rh++;
	currrice++;
      }
    }
    if(lf>=0){
      while(lf>=0){
	ll pos=abs(x[i]-x[lf]);
	if(curr<pos)break;
	curr-=pos;
	currrice++;
	lf--;
      }
    }
    else{
      while(rh<R){
	ll pos1=abs(x[i]-x[rh]);
	if(curr<pos1)break;
	curr-=pos1;
	currrice++;
	rh++;
      }
    }
    maxrice=max(maxrice,currrice);
  }
  return maxrice;
}/*
int main()
{
  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;
  }*/

Compilation message

ricehub.cpp:17:13: warning: 'void read_input()' defined but not used [-Wunused-function]
 static void read_input()
             ^~~~~~~~~~

Subtask #1

17.0 / 17.0

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

Subtask #2

25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	4 ms	256 KB	Output is correct
3	Correct	4 ms	256 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	5 ms	256 KB	Output is correct
6	Correct	5 ms	360 KB	Output is correct
7	Correct	5 ms	304 KB	Output is correct
8	Correct	5 ms	256 KB	Output is correct
9	Correct	4 ms	256 KB	Output is correct
10	Correct	5 ms	384 KB	Output is correct
11	Correct	4 ms	256 KB	Output is correct
12	Correct	5 ms	384 KB	Output is correct
13	Correct	5 ms	256 KB	Output is correct
14	Correct	5 ms	384 KB	Output is correct
15	Correct	4 ms	256 KB	Output is correct
16	Correct	5 ms	384 KB	Output is correct
17	Correct	5 ms	256 KB	Output is correct
18	Correct	5 ms	256 KB	Output is correct
19	Correct	5 ms	256 KB	Output is correct
20	Correct	4 ms	256 KB	Output is correct
21	Correct	5 ms	384 KB	Output is correct
22	Correct	5 ms	384 KB	Output is correct
23	Correct	5 ms	384 KB	Output is correct
24	Correct	5 ms	384 KB	Output is correct
25	Correct	7 ms	256 KB	Output is correct
26	Correct	6 ms	384 KB	Output is correct
27	Correct	5 ms	384 KB	Output is correct
28	Correct	5 ms	256 KB	Output is correct

Subtask #3

26.0 / 26.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	5 ms	288 KB	Output is correct
3	Correct	7 ms	384 KB	Output is correct
4	Correct	6 ms	384 KB	Output is correct
5	Correct	5 ms	384 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	5 ms	384 KB	Output is correct
8	Correct	5 ms	384 KB	Output is correct
9	Correct	5 ms	384 KB	Output is correct
10	Correct	5 ms	384 KB	Output is correct
11	Correct	5 ms	384 KB	Output is correct
12	Correct	5 ms	384 KB	Output is correct
13	Correct	7 ms	384 KB	Output is correct
14	Correct	7 ms	384 KB	Output is correct
15	Correct	6 ms	384 KB	Output is correct
16	Correct	5 ms	384 KB	Output is correct
17	Correct	8 ms	384 KB	Output is correct
18	Correct	7 ms	384 KB	Output is correct
19	Correct	9 ms	384 KB	Output is correct
20	Correct	9 ms	384 KB	Output is correct
21	Correct	8 ms	384 KB	Output is correct
22	Correct	8 ms	384 KB	Output is correct
23	Correct	55 ms	384 KB	Output is correct
24	Correct	51 ms	384 KB	Output is correct
25	Correct	112 ms	480 KB	Output is correct
26	Correct	112 ms	384 KB	Output is correct
27	Correct	37 ms	384 KB	Output is correct
28	Correct	36 ms	384 KB	Output is correct

Subtask #4

0 / 32.0

#	결과	실행 시간	메모리	Grader output
1	Correct	12 ms	384 KB	Output is correct
2	Correct	12 ms	512 KB	Output is correct
3	Execution timed out	1099 ms	1792 KB	Time limit exceeded
4	Halted	0 ms	0 KB	-