oj.uz

답안 #60837

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
60837 2018-07-24T19:49:17 Z Vahan 쌀 창고 (IOI11_ricehub) C++17
17 / 100
 33 ms 4608 KB 
#include "ricehub.h"
#include<algorithm>
using namespace std;
int x[200000],su[200000];
int bin(int l,int r,int v)
{
    if(l==r)
        return l;
    if(l==r-1)
    {
        if(x[r]<=v)
            return r;
        else
            return l;
    }
    int mid=(l+r)/2;
    if(x[mid]<=v)
        return bin(mid,r,v);
    else
        return bin(l,mid-1,v);
}
int pat(int l,int r)
{
    int mig=(su[r]-su[l]+x[l])/(r-l+1);
    int f,e;
    if((su[r]-su[l]+x[l])%(r-l+1)==0)
    {
        e=bin(l,r,mig);
        return (e-l+1)*mig+su[l]-x[l]+su[r]-(r-e)*mig-2*su[e];
    }
    else
    {
        e=bin(l,r,mig);
        f=bin(l,r,mig+1);
        return min((e-l+1)*mig+su[l]-x[l]+su[r]-(r-e)*mig-2*su[e],(f-l+1)*(mig+1)+su[l]-x[l]+su[r]-(r-f)*(mig+1)-2*su[f]);
    }

}
int besthub(int R, int L, int X[], long long B)
{
    for(int r=0;r<R;r++)
    {
        x[r]=X[r];
        if(r==0)
            su[r]=X[r];
        else
            su[r]=su[r-1]+X[r];
    }
    int l=0;
    int q,an=-1;
    for(int r=0;r<R;r++)
    {
        q=pat(l,r);
        while(q>B)
        {
            l++;
            q=pat(l,r);
        }
        an=max(an,r-l+1);
    }
    return an;
}

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 420 KB Output is correct
4 Correct 2 ms 440 KB Output is correct
5 Correct 2 ms 444 KB Output is correct

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 480 KB Output is correct
2 Correct 3 ms 532 KB Output is correct
3 Correct 3 ms 576 KB Output is correct
4 Correct 2 ms 600 KB Output is correct
5 Correct 2 ms 632 KB Output is correct
6 Correct 2 ms 632 KB Output is correct
7 Correct 2 ms 632 KB Output is correct
8 Correct 2 ms 644 KB Output is correct
9 Correct 3 ms 644 KB Output is correct
10 Correct 2 ms 644 KB Output is correct
11 Correct 4 ms 680 KB Output is correct
12 Correct 3 ms 684 KB Output is correct
13 Correct 2 ms 684 KB Output is correct
14 Correct 2 ms 684 KB Output is correct
15 Correct 2 ms 684 KB Output is correct
16 Correct 3 ms 684 KB Output is correct
17 Correct 3 ms 704 KB Output is correct
18 Correct 2 ms 704 KB Output is correct
19 Correct 3 ms 704 KB Output is correct
20 Correct 3 ms 704 KB Output is correct
21 Correct 2 ms 720 KB Output is correct
22 Correct 3 ms 848 KB Output is correct
23 Correct 3 ms 848 KB Output is correct
24 Correct 3 ms 848 KB Output is correct
25 Correct 2 ms 848 KB Output is correct
26 Correct 3 ms 848 KB Output is correct
27 Incorrect 3 ms 848 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 848 KB Output is correct
2 Correct 3 ms 848 KB Output is correct
3 Correct 3 ms 848 KB Output is correct
4 Correct 1 ms 848 KB Output is correct
5 Correct 2 ms 848 KB Output is correct
6 Correct 2 ms 848 KB Output is correct
7 Correct 3 ms 848 KB Output is correct
8 Correct 3 ms 848 KB Output is correct
9 Correct 3 ms 848 KB Output is correct
10 Correct 3 ms 848 KB Output is correct
11 Correct 4 ms 848 KB Output is correct
12 Correct 3 ms 848 KB Output is correct
13 Correct 3 ms 848 KB Output is correct
14 Correct 3 ms 848 KB Output is correct
15 Correct 3 ms 848 KB Output is correct
16 Correct 3 ms 856 KB Output is correct
17 Correct 3 ms 860 KB Output is correct
18 Correct 2 ms 860 KB Output is correct
19 Correct 4 ms 980 KB Output is correct
20 Correct 3 ms 980 KB Output is correct
21 Correct 3 ms 980 KB Output is correct
22 Correct 5 ms 980 KB Output is correct
23 Correct 4 ms 980 KB Output is correct
24 Correct 4 ms 980 KB Output is correct
25 Correct 5 ms 1048 KB Output is correct
26 Incorrect 5 ms 1128 KB Output isn't correct
27 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 1340 KB Output is correct
2 Correct 8 ms 1496 KB Output is correct
3 Correct 32 ms 3520 KB Output is correct
4 Incorrect 33 ms 4608 KB Output isn't correct
5 Halted 0 ms 0 KB -