Submission #3665225


Source Code Expand

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define CHMIN(a,b) a=min((a),(b))
#define CHMAX(a,b) a=max((a),(b))

// mod
const ll MOD = 1000000007ll;
#define FIX(a) ((a)%MOD+MOD)%MOD

// floating
typedef double Real;
const Real EPS = 1e-11;
#define EQ0(x) (abs(x)<EPS)
#define EQ(a,b) (abs(a-b)<EPS)
typedef complex<Real> P;

int n;
ll a[1252];
ll s[1252];

// bool win[2][1252][2521];
int win[2][1252];
const int C = 1252;

int main(){
  scanf("%d",&n);
  REP(i,n)scanf("%lld",a+i);
  REP(i,n)s[i+1] = s[i]+a[i];
  ll low = -1e16, high = 1e16;
  while(low+1<high){
    ll x = (low+high)/2;
    // answer is leq than x?

    // init
    // REP(i,2)REP(j,n+1)REP(kl,2521)win[i][j][kl]=false;
    REP(i,2)REP(j,n+1)win[i][j] = i==0 ? -1e9 : 1e9;
    // term
    win[0][n] = 0;  // upper bound
    win[1][n] = 1;  // lower bound
    // REP(i,2)REP(kl,2521){
    //   win[i][n][kl] = (i==0) ^ (kl-C<=0) ^ 1;
    // }
    FORR(j,0,n)FOR(a,1,n-j+1){
      int add = s[j+a]-s[j]<=x ? 1 : -1;
      // i==0 Alice
      CHMAX(win[0][j], win[1][j+a]-add-1);
      // i==1 Bob
      CHMIN(win[1][j], win[0][j+a]-add+1);
      // REP(i,2)FOR(kl,1,2521-1){
      //   win[i][j][kl] = win[i][j][kl] || !win[i^1][j+a][kl+add];
      // }
    }
    // if(win[0][0][C]){
    if(win[0][0] >= 0){
      low = x;
    }else{
      high = x;
    }
  }
  printf("%lld\n",high);
  return 0;
}

Submission Info

Submission Time
Task H - Median Game
User rickytheta
Language C++14 (GCC 5.4.1)
Score 500
Code Size 1958 Byte
Status AC
Exec Time 78 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:43:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&n);
                 ^
./Main.cpp:44:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   REP(i,n)scanf("%lld",a+i);
                            ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
AC × 2
AC × 32
Set Name Test Cases
Sample s1.txt, s2.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, s1.txt, s2.txt
Case Name Status Exec Time Memory
01.txt AC 1 ms 256 KB
02.txt AC 1 ms 256 KB
03.txt AC 1 ms 256 KB
04.txt AC 1 ms 256 KB
05.txt AC 1 ms 256 KB
06.txt AC 1 ms 256 KB
07.txt AC 1 ms 256 KB
08.txt AC 1 ms 256 KB
09.txt AC 1 ms 256 KB
10.txt AC 1 ms 256 KB
11.txt AC 78 ms 256 KB
12.txt AC 72 ms 256 KB
13.txt AC 65 ms 256 KB
14.txt AC 74 ms 256 KB
15.txt AC 68 ms 256 KB
16.txt AC 74 ms 256 KB
17.txt AC 77 ms 256 KB
18.txt AC 71 ms 256 KB
19.txt AC 75 ms 256 KB
20.txt AC 75 ms 256 KB
21.txt AC 71 ms 256 KB
22.txt AC 73 ms 256 KB
23.txt AC 73 ms 256 KB
24.txt AC 72 ms 256 KB
25.txt AC 76 ms 256 KB
26.txt AC 72 ms 256 KB
27.txt AC 72 ms 256 KB
28.txt AC 77 ms 256 KB
29.txt AC 73 ms 256 KB
30.txt AC 76 ms 256 KB
s1.txt AC 1 ms 256 KB
s2.txt AC 1 ms 256 KB