답안 #655500

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
655500	2022-11-04T15:12:13 Z	PanTkd	쌀 창고 (IOI11_ricehub)	C++14	68 / 100	1000 ms	596 KB

ricehub

#include "ricehub.h"
#include <iostream>
#include <cmath>
typedef long long ll;
using namespace std;

int besthub(int R, int L, int X[], long long B)
{
  for(ll i = R;i>=1;i--){
    ll cost = 0;
    ll med = ((i)/2);
    //cout<<i<<"----\n";
    for(ll j = 0;j<i;j++){
      cost += abs(X[med]-X[j]);
    }
    if(cost<=B){ return i;}
    for(ll j = 1;j<=R-i;j++){
      med++;
      cost += (i/2-(i-1)/2)*(X[med]-X[med-1]);
      cost += abs(X[med]-X[j+i-1]);
      cost -= abs(X[med-1]-X[j-1]);
      if(cost<=B){return i;}
    } 
  }
  return 1;
}

Subtask #1

17.0 / 17.0

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

Subtask #2

25.0 / 25.0

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

Subtask #3

26.0 / 26.0

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

Subtask #4

0 / 32.0

#	결과	실행 시간	메모리	Grader output
1	Correct	585 ms	380 KB	Output is correct
2	Correct	584 ms	364 KB	Output is correct
3	Correct	10 ms	596 KB	Output is correct
4	Correct	11 ms	596 KB	Output is correct
5	Execution timed out	1091 ms	468 KB	Time limit exceeded
6	Halted	0 ms	0 KB	-