Submission #300093

# Submission time Handle Problem Language Result Execution time Memory
300093 2020-09-16T15:01:46 Z a_player Gap (APIO16_gap) C++14
0 / 100
73 ms 1968 KB
#include "gap.h"
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
long long findGap(int T, int N){
  if(T==1){
    ll mx, mn;
    vector<ll> a(N);
    MinMax(0,2e18,&mn,&mx);
    a[0]=mn;
    a[N-1]=mx;
    for(int i=1;i<(N+1)/2;i++){
      ll mnn,mxx;
      MinMax(mn+1,mx-1,&mnn,&mxx);
      if(mnn==-1)break;
      a[i]=mnn;
      a[N-i-1]=mxx;
      mn=mnn;
      mx=mxx;
    }
    ll ans=0;
    for(int i=1;i<N;i++)ans=max(ans,a[i]-a[i-1]);
    cout<<ans;
    return 0;
  }
  ll mn,mx;
  MinMax(0,2e18,&mn,&mx);
  ll d=(mx-mn+N-1)/N;
  ll a=mn+1;
  ll b=mn+d;
  ll l=mn;
  ll ans=0;
  for(int i=0;i<N;i++){
    if(b>=mx)b=mx-1;
    if(a>b)break;
    ll mnn,mxx;
    MinMax(a,b,&mnn,&mxx);
    if(mnn!=-1){
      ans=max(ans,mnn-l);
      l=mxx;
    }
    a+=d;
    b+=d;
  }
  ans=max(ans,mx-l);
  cout<<ans;
  return 0;
}
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 256 KB Output isn't correct
2 Incorrect 0 ms 384 KB Output isn't correct
3 Incorrect 1 ms 384 KB Output isn't correct
4 Incorrect 0 ms 384 KB Output isn't correct
5 Incorrect 0 ms 384 KB Output isn't correct
6 Incorrect 0 ms 384 KB Output isn't correct
7 Incorrect 0 ms 384 KB Output isn't correct
8 Incorrect 0 ms 384 KB Output isn't correct
9 Incorrect 0 ms 384 KB Output isn't correct
10 Incorrect 0 ms 384 KB Output isn't correct
11 Incorrect 1 ms 384 KB Output isn't correct
12 Incorrect 1 ms 384 KB Output isn't correct
13 Incorrect 1 ms 384 KB Output isn't correct
14 Incorrect 1 ms 384 KB Output isn't correct
15 Incorrect 1 ms 384 KB Output isn't correct
16 Incorrect 13 ms 768 KB Output isn't correct
17 Incorrect 13 ms 768 KB Output isn't correct
18 Incorrect 13 ms 768 KB Output isn't correct
19 Incorrect 15 ms 768 KB Output isn't correct
20 Incorrect 9 ms 768 KB Output isn't correct
21 Incorrect 54 ms 1920 KB Output isn't correct
22 Incorrect 50 ms 1912 KB Output isn't correct
23 Incorrect 58 ms 1896 KB Output isn't correct
24 Incorrect 53 ms 1912 KB Output isn't correct
25 Incorrect 44 ms 1900 KB Output isn't correct
26 Incorrect 55 ms 1920 KB Output isn't correct
27 Incorrect 55 ms 1968 KB Output isn't correct
28 Incorrect 52 ms 1912 KB Output isn't correct
29 Incorrect 51 ms 1912 KB Output isn't correct
30 Incorrect 36 ms 1920 KB Output isn't correct
31 Incorrect 1 ms 384 KB Output isn't correct
32 Incorrect 1 ms 384 KB Output isn't correct
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 384 KB Output isn't correct
2 Incorrect 0 ms 384 KB Output isn't correct
3 Incorrect 0 ms 384 KB Output isn't correct
4 Incorrect 0 ms 384 KB Output isn't correct
5 Incorrect 0 ms 384 KB Output isn't correct
6 Incorrect 0 ms 384 KB Output isn't correct
7 Incorrect 0 ms 384 KB Output isn't correct
8 Incorrect 1 ms 384 KB Output isn't correct
9 Incorrect 0 ms 384 KB Output isn't correct
10 Incorrect 0 ms 384 KB Output isn't correct
11 Incorrect 1 ms 384 KB Output isn't correct
12 Incorrect 2 ms 384 KB Output isn't correct
13 Incorrect 1 ms 384 KB Output isn't correct
14 Incorrect 1 ms 384 KB Output isn't correct
15 Incorrect 1 ms 384 KB Output isn't correct
16 Incorrect 16 ms 512 KB Output isn't correct
17 Incorrect 16 ms 512 KB Output isn't correct
18 Incorrect 16 ms 512 KB Output isn't correct
19 Incorrect 16 ms 512 KB Output isn't correct
20 Incorrect 9 ms 512 KB Output isn't correct
21 Incorrect 68 ms 1068 KB Output isn't correct
22 Incorrect 67 ms 1144 KB Output isn't correct
23 Incorrect 67 ms 1076 KB Output isn't correct
24 Incorrect 68 ms 1048 KB Output isn't correct
25 Incorrect 63 ms 1144 KB Output isn't correct
26 Incorrect 73 ms 1152 KB Output isn't correct
27 Incorrect 70 ms 1144 KB Output isn't correct
28 Incorrect 71 ms 1152 KB Output isn't correct
29 Incorrect 71 ms 1144 KB Output isn't correct
30 Incorrect 34 ms 1152 KB Output isn't correct
31 Incorrect 0 ms 384 KB Output isn't correct
32 Incorrect 0 ms 384 KB Output isn't correct