Submission #992951
Source Code Expand
#include <bits/stdc++.h> #define FOR(i,a,b) for( ll i = (a); i < (ll)(b); i++ ) #define REP(i,n) FOR(i,0,n) #define YYS(x,arr) for(auto& x:arr) #define ALL(x) (x).begin(),(x).end() #define SORT(x) sort( (x).begin(),(x).end() ) #define REVERSE(x) reverse( (x).begin(),(x).end() ) #define UNIQUE(x) (x).erase( unique( ALL( (x) ) ) , (x).end() ) #define PW(x) (1LL<<(x)) #define SZ(x) ((ll)(x).size()) #define SHOW(x) cout << #x << " = " << x << endl #define pb emplace_back #define fi first #define se second using namespace std; typedef long double ld; typedef long long int ll; typedef pair<int,int> pi; typedef pair<ll,ll> pl; typedef vector<int> vi; typedef vector<ll> vl; typedef vector<bool> vb; typedef vector<ld> vd; typedef vector<pi> vpi; typedef vector<pl> vpl; typedef vector<vpl> gr; typedef vector<vl> ml; typedef vector<vd> md; typedef vector<vi> mi; const ll INF = (ll)1e9 + 10; const ll INFLL = (ll)1e18 + 10; const ld EPS = 1e-8; const ll MOD = 1e9+7; template<class T> T &chmin( T &a , const T &b ){ return a = min(a,b); } template<class T> T &chmax( T &a , const T &b ){ return a = max(a,b); } template<class T> inline T sq( T a ){ return a * a; } ll in(){ ll x; scanf( "%lld" , &x ); return x; } // head ll dp[4000010]; ll n, a; ll ans; ll f( ll x , ll y ){ return dp[x] * ( y - x - a ); } ll calc( ll x ){ ll lb = 1, ub = x-a; while( ub - lb > 4 ){ ll md1 = ( lb * 2 + ub ) / 3; ll md2 = ( lb + ub * 2 ) / 3; if( f( md1 , x ) > f( md2 , x ) ){ ub = md2; } else { lb = md1; } } ll res = -INFLL; FOR( i , lb , ub+1 ){ chmax( res , f( i , x ) ); } return res; } int main(){ n = in(); a = in(); FOR( i , 1 , 4000010 ){ dp[i] = i; chmax( dp[i] , calc( i ) ); // cout << i << " " << dp[i] << endl; if( dp[i] >= n ){ cout << i << endl; return 0; } } cout << n << endl; // assert( false ); return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Cookies |
User | joisino |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 2029 Byte |
Status | WA |
Exec Time | 305 ms |
Memory | 31616 KB |
Compile Error
./Main.cpp: In function ‘ll in()’: ./Main.cpp:43:36: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] ll in(){ ll x; scanf( "%lld" , &x ); return x; } ^
Judge Result
Set Name | sample | dataset1 | dataset2 | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 500 | 0 / 500 | ||||||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
sample | sample-01.txt, sample-02.txt, sample-03.txt |
dataset1 | sample-01.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, 01-21.txt, 01-22.txt, 01-23.txt, 01-24.txt, 01-25.txt, 01-26.txt |
dataset2 | sample-01.txt, sample-02.txt, sample-03.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, 01-21.txt, 01-22.txt, 01-23.txt, 01-24.txt, 01-25.txt, 01-26.txt, 02-01.txt, 02-02.txt, 02-03.txt, 02-04.txt, 02-05.txt, 02-06.txt, 02-07.txt, 02-08.txt, 02-09.txt, 02-10.txt, 02-11.txt, 02-12.txt, 02-13.txt, 02-14.txt, 02-15.txt, 02-16.txt, 02-17.txt, 02-18.txt, 02-19.txt, 02-20.txt, 02-21.txt, 02-22.txt, 02-23.txt, 02-24.txt, 02-25.txt, 02-26.txt, 02-27.txt, 02-28.txt, 02-29.txt, 02-30.txt, 02-31.txt, 02-32.txt, 02-33.txt, 02-34.txt, 02-35.txt, 02-36.txt, 02-37.txt, 02-38.txt, 02-39.txt, 02-40.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01-01.txt | AC | 2 ms | 256 KB |
01-02.txt | AC | 2 ms | 256 KB |
01-03.txt | AC | 2 ms | 256 KB |
01-04.txt | AC | 2 ms | 256 KB |
01-05.txt | AC | 2 ms | 256 KB |
01-06.txt | AC | 2 ms | 256 KB |
01-07.txt | AC | 2 ms | 256 KB |
01-08.txt | AC | 2 ms | 256 KB |
01-09.txt | AC | 2 ms | 256 KB |
01-10.txt | WA | 2 ms | 256 KB |
01-11.txt | AC | 3 ms | 256 KB |
01-12.txt | AC | 14 ms | 8064 KB |
01-13.txt | AC | 14 ms | 8064 KB |
01-14.txt | AC | 2 ms | 256 KB |
01-15.txt | AC | 2 ms | 256 KB |
01-16.txt | AC | 2 ms | 256 KB |
01-17.txt | AC | 2 ms | 256 KB |
01-18.txt | AC | 3 ms | 256 KB |
01-19.txt | AC | 2 ms | 256 KB |
01-20.txt | AC | 2 ms | 256 KB |
01-21.txt | AC | 2 ms | 256 KB |
01-22.txt | AC | 2 ms | 256 KB |
01-23.txt | AC | 2 ms | 256 KB |
01-24.txt | AC | 2 ms | 256 KB |
01-25.txt | AC | 2 ms | 256 KB |
01-26.txt | AC | 2 ms | 256 KB |
02-01.txt | AC | 2 ms | 256 KB |
02-02.txt | AC | 2 ms | 256 KB |
02-03.txt | AC | 2 ms | 256 KB |
02-04.txt | AC | 3 ms | 256 KB |
02-05.txt | AC | 3 ms | 256 KB |
02-06.txt | AC | 2 ms | 256 KB |
02-07.txt | AC | 2 ms | 256 KB |
02-08.txt | AC | 2 ms | 256 KB |
02-09.txt | AC | 3 ms | 256 KB |
02-10.txt | AC | 2 ms | 256 KB |
02-11.txt | AC | 2 ms | 256 KB |
02-12.txt | AC | 2 ms | 256 KB |
02-13.txt | AC | 2 ms | 256 KB |
02-14.txt | AC | 2 ms | 256 KB |
02-15.txt | AC | 2 ms | 256 KB |
02-16.txt | AC | 2 ms | 256 KB |
02-17.txt | AC | 3 ms | 256 KB |
02-18.txt | WA | 3 ms | 256 KB |
02-19.txt | AC | 3 ms | 256 KB |
02-20.txt | AC | 3 ms | 384 KB |
02-21.txt | WA | 9 ms | 896 KB |
02-22.txt | AC | 305 ms | 31232 KB |
02-23.txt | WA | 47 ms | 31488 KB |
02-24.txt | AC | 47 ms | 31488 KB |
02-25.txt | AC | 2 ms | 256 KB |
02-26.txt | AC | 2 ms | 256 KB |
02-27.txt | AC | 2 ms | 256 KB |
02-28.txt | AC | 2 ms | 256 KB |
02-29.txt | AC | 2 ms | 256 KB |
02-30.txt | AC | 2 ms | 256 KB |
02-31.txt | AC | 2 ms | 256 KB |
02-32.txt | AC | 2 ms | 256 KB |
02-33.txt | AC | 2 ms | 256 KB |
02-34.txt | AC | 3 ms | 384 KB |
02-35.txt | AC | 3 ms | 256 KB |
02-36.txt | AC | 3 ms | 256 KB |
02-37.txt | WA | 3 ms | 256 KB |
02-38.txt | AC | 4 ms | 384 KB |
02-39.txt | WA | 153 ms | 15360 KB |
02-40.txt | WA | 47 ms | 31488 KB |
sample-01.txt | AC | 3 ms | 256 KB |
sample-02.txt | AC | 47 ms | 31616 KB |
sample-03.txt | AC | 3 ms | 256 KB |