結果
問題 | No.253 ロウソクの長さ |
ユーザー | is_eri23 |
提出日時 | 2015-08-05 09:50:15 |
言語 | C++11 (gcc 11.4.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,608 bytes |
コンパイル時間 | 1,432 ms |
コンパイル使用メモリ | 158,632 KB |
実行使用メモリ | 25,832 KB |
平均クエリ数 | 28.69 |
最終ジャッジ日時 | 2024-07-16 05:36:01 |
合計ジャッジ時間 | 6,853 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | WA | - |
testcase_02 | WA | - |
testcase_03 | AC | 22 ms
25,604 KB |
testcase_04 | AC | 22 ms
24,964 KB |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | AC | 21 ms
24,964 KB |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | AC | 21 ms
25,220 KB |
testcase_15 | WA | - |
testcase_16 | AC | 21 ms
25,220 KB |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | AC | 21 ms
24,836 KB |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | AC | 21 ms
25,220 KB |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | AC | 22 ms
25,220 KB |
testcase_35 | WA | - |
コンパイルメッセージ
main.cpp: In function ‘int query(ll)’: main.cpp:37:8: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 37 | scanf("%d", &y); | ~~~~~^~~~~~~~~~
ソースコード
#include <bits/stdc++.h> #define EPS 1e-9 #define INF 1070000000LL #define MOD 1000000007LL #define fir first #define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++) #define numa(x,a) for(auto x: a) #define ite iterator #define mp make_pair #define rep(i,n) rep2(i,0,n) #define rep2(i,m,n) for(int i=m;i<(n);i++) #define pb push_back #define pf push_front #define sec second #define sz(x) ((int)(x).size()) #define ALL( c ) (c).begin(), (c).end() #define gcd(a,b) __gcd(a,b) #define mem(x,n) memset(x,n,sizeof(x)) #define endl "\n" using namespace std; template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){} template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t); deploy<POS + 1, TUPLE, Ts...>(os, t); } template <class T,class U> std::ostream& operator<<(std::ostream &os, std::pair<T,U> &p){ os << "(" << p.first <<", " << p.second <<")";return os; } template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; } template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; } template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "}" : ", "); return os; } #define DEBUG1(var0) { std::cerr << (#var0) << "=" << (var0) << endl; } #define DEBUG2(var0, var1) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG1(var1); } #define DEBUG3(var0, var1, var2) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG2(var1,var2); } #define DEBUG4(var0, var1, var2, var3) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG3(var1,var2,var3); } using ll = long long; int query(ll x){ printf("? %lld\n", x); fflush(stdout); int y; scanf("%d", &y); return y; } int main() { int y = query(35); if (y <= 0) { int cnt_ = 1; while(true){ int y = query(0); if (y == 0) { break; } cnt_ += 1; } printf("! %d\n", cnt_); return 0; } ll lp = 0; ll up = 1e9; int cnt = 1; while(lp != up) { ll mid = (lp + up) / 2; int y = query(mid - cnt); if (y == 0) { printf("! %lld\n", mid); return 0; } if (y == -1) { up = mid; }else{ lp = mid + 1; } } return 0; }