oj.uz

Submission #28919

# Submission time Handle Problem Language Result Execution time Memory
28919 2017-07-17T19:18:22 Z ozaslan Rice Hub (IOI11_ricehub) C++14
100 / 100
 23 ms 5924 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, k = 1;

    int sag = 0, sol = 0;
    long long toplam = 0;

    while(1) {
        int orta = (sol + sag + 1) / 2;

        if(toplam > B) {
            toplam -= (X[orta] - X[sol]);
            sol++;
            k--;
        }

        else if(sag < R-1){
            enIyi = max(k, enIyi);
            k++;
            sag++;
            toplam += (X[sag] - X[orta]);
        }
        else break;
    }

    enIyi = max(k, enIyi);

	return enIyi;
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory 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
25.0 / 25.0

# Verdict Execution time Memory 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
6 Correct 0 ms 5924 KB Output is correct
7 Correct 0 ms 5924 KB Output is correct
8 Correct 0 ms 5924 KB Output is correct
9 Correct 0 ms 5924 KB Output is correct
10 Correct 0 ms 5924 KB Output is correct
11 Correct 0 ms 5924 KB Output is correct
12 Correct 0 ms 5924 KB Output is correct
13 Correct 0 ms 5924 KB Output is correct
14 Correct 0 ms 5924 KB Output is correct
15 Correct 0 ms 5924 KB Output is correct
16 Correct 0 ms 5924 KB Output is correct
17 Correct 0 ms 5924 KB Output is correct
18 Correct 0 ms 5924 KB Output is correct
19 Correct 0 ms 5924 KB Output is correct
20 Correct 0 ms 5924 KB Output is correct
21 Correct 0 ms 5924 KB Output is correct
22 Correct 0 ms 5924 KB Output is correct
23 Correct 0 ms 5924 KB Output is correct
24 Correct 0 ms 5924 KB Output is correct
25 Correct 0 ms 5924 KB Output is correct
26 Correct 0 ms 5924 KB Output is correct
27 Correct 0 ms 5924 KB Output is correct
28 Correct 0 ms 5924 KB Output is correct

Subtask #3
26.0 / 26.0

# Verdict Execution time Memory 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
6 Correct 0 ms 5924 KB Output is correct
7 Correct 0 ms 5924 KB Output is correct
8 Correct 0 ms 5924 KB Output is correct
9 Correct 0 ms 5924 KB Output is correct
10 Correct 0 ms 5924 KB Output is correct
11 Correct 0 ms 5924 KB Output is correct
12 Correct 0 ms 5924 KB Output is correct
13 Correct 0 ms 5924 KB Output is correct
14 Correct 0 ms 5924 KB Output is correct
15 Correct 0 ms 5924 KB Output is correct
16 Correct 0 ms 5924 KB Output is correct
17 Correct 0 ms 5924 KB Output is correct
18 Correct 0 ms 5924 KB Output is correct
19 Correct 0 ms 5924 KB Output is correct
20 Correct 0 ms 5924 KB Output is correct
21 Correct 0 ms 5924 KB Output is correct
22 Correct 0 ms 5924 KB Output is correct
23 Correct 0 ms 5924 KB Output is correct
24 Correct 0 ms 5924 KB Output is correct
25 Correct 0 ms 5924 KB Output is correct
26 Correct 0 ms 5924 KB Output is correct
27 Correct 0 ms 5924 KB Output is correct
28 Correct 0 ms 5924 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5924 KB Output is correct
2 Correct 3 ms 5924 KB Output is correct
3 Correct 16 ms 5924 KB Output is correct
4 Correct 16 ms 5924 KB Output is correct
5 Correct 6 ms 5924 KB Output is correct
6 Correct 6 ms 5924 KB Output is correct
7 Correct 13 ms 5924 KB Output is correct
8 Correct 13 ms 5924 KB Output is correct
9 Correct 6 ms 5924 KB Output is correct
10 Correct 6 ms 5924 KB Output is correct
11 Correct 23 ms 5924 KB Output is correct
12 Correct 16 ms 5924 KB Output is correct
13 Correct 9 ms 5924 KB Output is correct
14 Correct 3 ms 5924 KB Output is correct
15 Correct 16 ms 5924 KB Output is correct
16 Correct 13 ms 5924 KB Output is correct
17 Correct 9 ms 5924 KB Output is correct
18 Correct 13 ms 5924 KB Output is correct
19 Correct 13 ms 5924 KB Output is correct
20 Correct 16 ms 5924 KB Output is correct