oj.uz

Submission #23552

# Submission time Handle Problem Language Result Execution time Memory
23552 2017-05-12T14:09:10 Z repeating Gap (APIO16_gap) C++11
30 / 100
 66 ms 7656 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;
////    cout<<s<<" "<<e<<endl;
//    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 len;
            ll i;
            ll mx,mn;
//            cout<<sum<<endl;
            W(!v[cur].empty()){
                i=v[cur].SI-1;
                len=ceil((v[cur][i].S-v[cur][i].F+1)/((rand()%70)+0.0));
                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(mx>mn+1)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:81: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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 7496 KB Output is correct
2 Correct 0 ms 7496 KB Output is correct
3 Correct 0 ms 7496 KB Output is correct
4 Correct 0 ms 7496 KB Output is correct
5 Correct 0 ms 7496 KB Output is correct
6 Correct 0 ms 7496 KB Output is correct
7 Correct 0 ms 7496 KB Output is correct
8 Correct 0 ms 7496 KB Output is correct
9 Correct 0 ms 7496 KB Output is correct
10 Correct 0 ms 7496 KB Output is correct
11 Correct 0 ms 7496 KB Output is correct
12 Correct 0 ms 7496 KB Output is correct
13 Correct 0 ms 7496 KB Output is correct
14 Correct 0 ms 7496 KB Output is correct
15 Correct 0 ms 7496 KB Output is correct
16 Correct 16 ms 7496 KB Output is correct
17 Correct 9 ms 7496 KB Output is correct
18 Correct 16 ms 7496 KB Output is correct
19 Correct 13 ms 7496 KB Output is correct
20 Correct 6 ms 7496 KB Output is correct
21 Correct 53 ms 7496 KB Output is correct
22 Correct 49 ms 7496 KB Output is correct
23 Correct 56 ms 7496 KB Output is correct
24 Correct 56 ms 7496 KB Output is correct
25 Correct 49 ms 7496 KB Output is correct
26 Correct 59 ms 7496 KB Output is correct
27 Correct 66 ms 7496 KB Output is correct
28 Correct 66 ms 7496 KB Output is correct
29 Correct 59 ms 7496 KB Output is correct
30 Correct 49 ms 7496 KB Output is correct
31 Correct 0 ms 7496 KB Output is correct
32 Correct 0 ms 7496 KB Output is correct

Subtask #2
0 / 70.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 7496 KB Partially correct
2 Partially correct 0 ms 7496 KB Partially correct
3 Partially correct 0 ms 7496 KB Partially correct
4 Partially correct 0 ms 7496 KB Partially correct
5 Partially correct 0 ms 7496 KB Partially correct
6 Partially correct 0 ms 7496 KB Partially correct
7 Partially correct 0 ms 7496 KB Partially correct
8 Partially correct 0 ms 7496 KB Partially correct
9 Partially correct 0 ms 7496 KB Partially correct
10 Partially correct 0 ms 7496 KB Partially correct
11 Incorrect 0 ms 7496 KB Unexpected end of file - int64 expected
12 Incorrect 0 ms 7496 KB Unexpected end of file - int64 expected
13 Incorrect 0 ms 7496 KB Unexpected end of file - int64 expected
14 Incorrect 0 ms 7496 KB Unexpected end of file - int64 expected
15 Incorrect 0 ms 7496 KB Unexpected end of file - int64 expected
16 Incorrect 9 ms 7632 KB Unexpected end of file - int64 expected
17 Incorrect 9 ms 7632 KB Unexpected end of file - int64 expected
18 Incorrect 6 ms 7632 KB Unexpected end of file - int64 expected
19 Incorrect 6 ms 7632 KB Unexpected end of file - int64 expected
20 Incorrect 3 ms 7652 KB Unexpected end of file - int64 expected
21 Incorrect 39 ms 7632 KB Unexpected end of file - int64 expected
22 Incorrect 33 ms 7632 KB Unexpected end of file - int64 expected
23 Incorrect 29 ms 7632 KB Unexpected end of file - int64 expected
24 Incorrect 33 ms 7632 KB Unexpected end of file - int64 expected
25 Incorrect 26 ms 7632 KB Unexpected end of file - int64 expected
26 Incorrect 33 ms 7632 KB Unexpected end of file - int64 expected
27 Incorrect 39 ms 7632 KB Unexpected end of file - int64 expected
28 Incorrect 29 ms 7632 KB Unexpected end of file - int64 expected
29 Incorrect 33 ms 7632 KB Unexpected end of file - int64 expected
30 Incorrect 13 ms 7656 KB Unexpected end of file - int64 expected
31 Partially correct 0 ms 7496 KB Partially correct
32 Partially correct 0 ms 7496 KB Partially correct