oj.uz

답안 #23540

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
23540 2017-05-12T13:54:20 Z repeating Gap (APIO16_gap) C++11
30.085 / 100
 493 ms 9132 KB 
#include <bits/stdc++.h>
#define F first
#define S second
#define P push
#define pb push_back
#define MEM(dp,i) memset(dp,i,sizeof(dp))
#define W while
#define R return
#define C continue
#define SI size()
#define ll long long
#define pll pair<ll,ll>
#define SF(x) scanf("%I64d",&x)

using namespace std;
const long long INF = 2e9;
long long MOD = 1e9+7;
void MinMax(ll ,ll ,ll *,ll *);
//ll ar[12];
//void MinMax(ll s,ll e,ll *mn,ll *mx){
//    *mn=-1;
//    *mx=-1;
//    for(int i=0;i<2;i++){
//        if(s<=ar[i]&&ar[i]<=e){
//            if(*mn!=-1)*mn=min(*mn,ar[i]);
//            else *mn=ar[i];
//            if(*mx!=-1)*mx=max(*mx,ar[i]);
//            else *mx=ar[i];
//        }
//    }
//}
long long findGap(int ,int );
ll a[300006];
vector<pll> v[3];
vector<ll> arr;
long long findGap(int t,int n){
    if(t==1){
        ll l=0,r=1e18;
        ll res=0;
        ll i=0,j=n-1;
        W(i<=j){
            MinMax(l,r,&l,&r);
            a[i]=l;
            a[j]=r;
            r--,l++;
            i++,j--;
        }
        for(int i=1;i<n;i++)res=max(res,a[i]-a[i-1]);
        R res;
    }
    else{
        v[0].pb({0,1e18});
        ll cur=0;
        W(!v[cur].empty()){
            ll sum=0;
            for(int i=0;i<v[cur].SI;i++){
                sum+=v[cur][i].S-v[cur][i].F+1;
            }
            ll len=ceil(sum/1000000.0);
            ll i;
            ll mx,mn;
//            cout<<sum<<endl;
            W(!v[cur].empty()){
                i=v[cur].SI-1;
                for(ll j=v[cur][i].F;j<=v[cur][i].S;j+=len){
                    MinMax(j,min(j+len-1,v[cur][i].S),&mn,&mx);
//                    cout<<j<<endl;
                    if(mn==-1)C;
                    arr.pb(mn);
                    if(mx!=mn)arr.pb(mx);
                    if(mn+1<mx)v[cur^1].pb({mn+1,mx-1});
//                    cout<<mn<<" "<<mx<<endl;
                }
//                cout<<'s';
//                cout<<v[cur][0].F<<" "<<v[cur][0].S<<endl;
                v[cur].pop_back();
            }
            cur^=1;
        }
        ll res=0;
        sort(arr.begin(),arr.end());
        for(int i=1;i<arr.SI;i++){
            res=max(res,arr[i]-arr[i-1]);
        }
        R res;
    }
}
//int main(){
//    ar[0]=0;
//    ar[1]=2;
//    ar[2]=10;
//    for(int i=3;i<10;i++)ar[i]=ar[i-1]*100;
//    cout<<findGap(2,2);
//}

Compilation message

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:56:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int i=0;i<v[cur].SI;i++){
                          ^
gap.cpp:82:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i=1;i<arr.SI;i++){
                      ^

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 7492 KB Output is correct
2 Correct 0 ms 7492 KB Output is correct
3 Correct 0 ms 7492 KB Output is correct
4 Correct 0 ms 7492 KB Output is correct
5 Correct 0 ms 7492 KB Output is correct
6 Correct 0 ms 7492 KB Output is correct
7 Correct 0 ms 7492 KB Output is correct
8 Correct 0 ms 7492 KB Output is correct
9 Correct 0 ms 7492 KB Output is correct
10 Correct 0 ms 7492 KB Output is correct
11 Correct 0 ms 7492 KB Output is correct
12 Correct 0 ms 7492 KB Output is correct
13 Correct 0 ms 7492 KB Output is correct
14 Correct 0 ms 7492 KB Output is correct
15 Correct 0 ms 7492 KB Output is correct
16 Correct 13 ms 7492 KB Output is correct
17 Correct 9 ms 7492 KB Output is correct
18 Correct 6 ms 7492 KB Output is correct
19 Correct 13 ms 7492 KB Output is correct
20 Correct 9 ms 7492 KB Output is correct
21 Correct 53 ms 7492 KB Output is correct
22 Correct 53 ms 7492 KB Output is correct
23 Correct 56 ms 7492 KB Output is correct
24 Correct 49 ms 7492 KB Output is correct
25 Correct 43 ms 7492 KB Output is correct
26 Correct 59 ms 7492 KB Output is correct
27 Correct 56 ms 7492 KB Output is correct
28 Correct 56 ms 7492 KB Output is correct
29 Correct 63 ms 7492 KB Output is correct
30 Correct 36 ms 7492 KB Output is correct
31 Correct 0 ms 7492 KB Output is correct
32 Correct 0 ms 7492 KB Output is correct

Subtask #2
0.084972771 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 19 ms 7492 KB Partially correct
2 Partially correct 43 ms 7492 KB Partially correct
3 Partially correct 39 ms 7492 KB Partially correct
4 Partially correct 43 ms 7492 KB Partially correct
5 Partially correct 93 ms 7492 KB Partially correct
6 Partially correct 83 ms 7492 KB Partially correct
7 Partially correct 86 ms 7492 KB Partially correct
8 Partially correct 79 ms 7492 KB Partially correct
9 Partially correct 83 ms 7492 KB Partially correct
10 Partially correct 146 ms 7492 KB Partially correct
11 Partially correct 123 ms 7492 KB Partially correct
12 Partially correct 249 ms 7492 KB Partially correct
13 Partially correct 133 ms 7492 KB Partially correct
14 Partially correct 119 ms 7492 KB Partially correct
15 Partially correct 246 ms 7492 KB Partially correct
16 Partially correct 366 ms 7968 KB Partially correct
17 Partially correct 366 ms 7968 KB Partially correct
18 Partially correct 399 ms 7968 KB Partially correct
19 Partially correct 369 ms 7968 KB Partially correct
20 Partially correct 363 ms 7964 KB Partially correct
21 Partially correct 463 ms 9132 KB Partially correct
22 Partially correct 443 ms 9132 KB Partially correct
23 Partially correct 453 ms 9132 KB Partially correct
24 Partially correct 473 ms 9132 KB Partially correct
25 Partially correct 453 ms 9116 KB Partially correct
26 Partially correct 493 ms 9132 KB Partially correct
27 Partially correct 473 ms 9132 KB Partially correct
28 Partially correct 473 ms 9132 KB Partially correct
29 Partially correct 469 ms 9132 KB Partially correct
30 Partially correct 343 ms 9116 KB Partially correct
31 Partially correct 239 ms 7492 KB Partially correct
32 Partially correct 229 ms 7492 KB Partially correct