Submission #933678

#TimeUsernameProblemLanguageResultExecution timeMemory
933678thunoproThe Big Prize (IOI17_prize)C++14
100 / 100
29 ms6200 KiB
#include<bits/stdc++.h> using namespace std ; #define maxn 200009 #define ll long long #define pb push_back #define fi first #define se second #define left id<<1 #define right id<<1|1 #define re exit(0); #define _lower(x) lower_bound(v.begin(),v.end(),x)-v.begin()+1 const int mod = 1e9+7 ; const int INF = 1e9 ; typedef vector<int> vi ; typedef pair<int,int> pii ; typedef vector<pii> vii ; template < typename T > void chkmin ( T &a , T b ) { if ( a > b ) a = b ; } template < typename T > void chkmax ( T &a , T b ) { if ( a < b ) a = b ; } void add ( int &a , int b ) { a += b ; if ( a >= mod ) a -= mod ; if ( a < 0 ) a += mod ; } void rf () { freopen ("bai1.inp","r",stdin) ; } int _pow ( int a , int n ) { if ( n == 0 ) return 1 ; int res = _pow (a,n/2) ; if ( n % 2 ) return 1ll*res*res%mod*a%mod ; else return 1ll*res*res%mod ; } //int main () //{ // ios_base::sync_with_stdio(0); // cin.tie(0);cout.tie(0); //// rf () ; //} vi ask ( int i ) ; int res = -1 , mx = -1 ; vi asked [maxn] ; vi Ask ( int i ) { if ( asked[i].empty() ) asked [i] = ask (i) ; chkmax (mx,asked[i][0]+asked[i][1]) ; return asked [i] ; } int Ask_cnt ( int i ) { vi v = Ask (i) ; if ( v [0] + v [1] == 0 ) res = i ; return v [0] + v [1] ; } void solve ( int l , int r ) { while ( Ask_cnt (l) != mx && l <= r ) l ++ ; while ( Ask_cnt (r) != mx && l <= r ) r -- ; if ( res != -1 ) return ; if ( l >= r ) return ; vi A = Ask (l) , B = Ask (r) ; if ( A [0] == B [0] && A [1] == B [1] ) return ; int mid = (l+r)/2 ; solve (l,mid) ; solve (mid,r) ; } int find_best ( int n ) { solve (0,n-1) ; return res ; }

Compilation message (stderr)

prize.cpp: In function 'void rf()':
prize.cpp:31:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 |  freopen ("bai1.inp","r",stdin) ;
      |  ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...