結果
問題 | No.253 ロウソクの長さ |
ユーザー |
![]() |
提出日時 | 2015-07-24 23:02:51 |
言語 | C++11 (gcc 13.3.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,779 bytes |
コンパイル時間 | 974 ms |
コンパイル使用メモリ | 92,700 KB |
実行使用メモリ | 40,400 KB |
平均クエリ数 | 0.86 |
最終ジャッジ日時 | 2024-07-16 05:00:04 |
合計ジャッジ時間 | 4,645 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | WA * 1 TLE * 1 -- * 34 |
ソースコード
#include <iostream>#include <iomanip>#include <sstream>#include <vector>#include <string>#include <set>#include <unordered_set>#include <map>#include <unordered_map>#include <stack>#include <queue>#include <deque>#include <algorithm>#include <functional>#include <iterator>#include <limits>#include <numeric>#include <utility>#include <cmath>#include <cassert>#include <cstdio>using namespace std; using namespace placeholders;using LL = long long;using ULL = unsigned long long;using VI = vector< int >;using VVI = vector< vector< int > >;using VS = vector< string >;using SS = stringstream;using PII = pair< int, int >;using VPII = vector< pair< int, int > >;template < typename T = int > using VT = vector< T >;template < typename T = int > using VVT = vector< vector< T > >;template < typename T = int > using LIM = numeric_limits< T >;template < typename T > inline istream& operator>>( istream &s, vector< T > &v ){ for ( T &t : v ) { s >> t; } return s; }template < typename T > inline ostream& operator<<( ostream &s, const vector< T > &v ){ for ( int i = 0; i < int( v.size() ); ++i ){ s << ( " " + !i) << v[i]; } return s; }template < typename T > inline T fromString( const string &s ) { T res; istringstream iss( s ); iss >> res; return res; };template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); };#define REP2( i, n ) REP3( i, 0, n )#define REP3( i, m, n ) for ( int i = ( int )( m ); i < ( int )( n ); ++i )#define GET_REP( a, b, c, F, ... ) F#define REP( ... ) GET_REP( __VA_ARGS__, REP3, REP2 )( __VA_ARGS__ )#define FOR( e, c ) for ( auto &e : c )#define ALL( c ) ( c ).begin(), ( c ).end()#define AALL( a, t ) ( t* )a, ( t* )a + sizeof( a ) / sizeof( t )#define DRANGE( c, p ) ( c ).begin(), ( c ).begin() + ( p ), ( c ).end()#define SZ( v ) ( (int)( v ).size() )#define PB push_back#define EM emplace#define EB emplace_back#define BI back_inserter#define EXIST( c, e ) ( ( c ).find( e ) != ( c ).end() )#define MP make_pair#define fst first#define snd second#define DUMP( x ) cerr << #x << " = " << ( x ) << endlint solve1(){int t = 1;while ( true ){cout << "? 0" << endl;int in;cin >> in;if ( in == 0 ){break;}++t;}return t;}int solve2(){int lb = 0, ub = 1000000001, t = 1;while ( lb + 1 < ub ){const int mid = ( lb + ub ) / 2;cout << "? " << mid - t << endl;int in;cin >> in;if ( in == 0 ){return mid;}( in < 0 ? lb : ub ) = mid;++t;}return lb;}int ( *fs[] )() = { solve1, solve2 };int main(){cin.tie( 0 );ios::sync_with_stdio( false );cout << "? 50" << endl;int in;cin >> in;cout << "! " << fs[ in == 1 ]() << endl;return 0;}