oj.uz

Submission #5971

# Submission time Handle Problem Language Result Execution time Memory
5971 2014-06-08T06:49:24 Z baneling100 Rice Hub (IOI11_ricehub) C++
0 / 100
 20 ms 4992 KB 
#include "ricehub.h"
#include <stdlib.h>

int besthub(int R, int L, int X[], long long B)
{
    int i, j, left=1, mid, right=R, x, ok, ans;
    long long hab;

    while(left<=right)
    {
        mid=(left+right)/2;
        x=(mid-1)/2;
        hab=ok=0;
        for(i=0 ; i<mid ; i++)
            hab+=abs((long long)X[x]-(long long)X[i]);
        if(hab<=B)
            ok=1;
        for(i=1 ; i<=R-mid ; i++)
        {
            j=i+mid-1;
            hab-=(long long)X[x]-(long long)X[i-1];
            x++;
            hab+=(long long)X[j]-(long long)X[x];
            if(hab<=B)
                ok=1;
        }
        if(ok)
        {
            left=mid+1;
            ans=mid;
        }
        else
            right=mid-1;
    }
    return ans;
}

Subtask #1
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 4992 KB Output is correct
2 Incorrect 0 ms 4992 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 4992 KB Output is correct
2 Correct 0 ms 4992 KB Output is correct
3 Correct 0 ms 4992 KB Output is correct
4 Correct 0 ms 4992 KB Output is correct
5 Correct 0 ms 4992 KB Output is correct
6 Correct 0 ms 4992 KB Output is correct
7 Correct 0 ms 4992 KB Output is correct
8 Correct 0 ms 4992 KB Output is correct
9 Correct 0 ms 4992 KB Output is correct
10 Correct 0 ms 4992 KB Output is correct
11 Correct 0 ms 4992 KB Output is correct
12 Correct 0 ms 4992 KB Output is correct
13 Correct 0 ms 4992 KB Output is correct
14 Correct 0 ms 4992 KB Output is correct
15 Correct 0 ms 4992 KB Output is correct
16 Correct 0 ms 4992 KB Output is correct
17 Correct 0 ms 4992 KB Output is correct
18 Correct 0 ms 4992 KB Output is correct
19 Incorrect 0 ms 4992 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #3
0.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 4992 KB Output is correct
2 Correct 0 ms 4992 KB Output is correct
3 Correct 0 ms 4992 KB Output is correct
4 Correct 0 ms 4992 KB Output is correct
5 Correct 0 ms 4992 KB Output is correct
6 Correct 0 ms 4992 KB Output is correct
7 Correct 0 ms 4992 KB Output is correct
8 Correct 0 ms 4992 KB Output is correct
9 Correct 0 ms 4992 KB Output is correct
10 Correct 0 ms 4992 KB Output is correct
11 Correct 0 ms 4992 KB Output is correct
12 Correct 0 ms 4992 KB Output is correct
13 Correct 0 ms 4992 KB Output is correct
14 Correct 0 ms 4992 KB Output is correct
15 Incorrect 0 ms 4992 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #4
0.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4992 KB Output is correct
2 Correct 4 ms 4992 KB Output is correct
3 Correct 20 ms 4992 KB Output is correct
4 Correct 12 ms 4992 KB Output is correct
5 Correct 8 ms 4992 KB Output is correct
6 Correct 8 ms 4992 KB Output is correct
7 Correct 16 ms 4992 KB Output is correct
8 Correct 8 ms 4992 KB Output is correct
9 Correct 8 ms 4992 KB Output is correct
10 Correct 4 ms 4992 KB Output is correct
11 Correct 12 ms 4992 KB Output is correct
12 Correct 20 ms 4992 KB Output is correct
13 Incorrect 4 ms 4992 KB Output isn't correct
14 Halted 0 ms 0 KB -