結果
問題 | No.513 宝探し2 |
ユーザー | firiexp |
提出日時 | 2019-03-02 20:42:59 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
CE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 1,055 bytes |
コンパイル時間 | 643 ms |
コンパイル使用メモリ | 74,908 KB |
最終ジャッジ日時 | 2024-11-14 21:16:20 |
合計ジャッジ時間 | 1,171 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。(リジャッジ後のコンパイルエラーは公開されます)
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
main.cpp:15:39: error: '::numeric_limits' has not been declared 15 | template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208; | ^~~~~~~~~~~~~~ main.cpp:15:55: error: expected primary-expression before '>' token 15 | template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208; | ^ main.cpp:15:61: error: no matching function for call to 'max()' 15 | template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208; | ~~~~~^~ In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/string:50, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/locale_classes.h:40, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/ios_base.h:41, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ios:42, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ostream:38, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/iostream:39, from main.cpp:1: /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_algobase.h:254:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::max(const _Tp&, const _Tp&)' 254 | max(const _Tp& __a, const _Tp& __b) | ^~~ /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_algobase.h:254:5: note: template argument deduction/substitution failed: main.cpp:15:61: note: candidate expects 2 arguments, 0 provided 15 | template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208; | ~~~~~^~ /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_algobase.h:300:5: note: candidate: 'templat
ソースコード
#include <iostream> #include <algorithm> #include <iomanip> #include <map> #include <set> #include <queue> #include <stack> #include <numeric> #include <bitset> static const int MOD = 1000000007; using ll = int64_t; using namespace std; template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208; int main() { int l = 0, r = 100001, ans1 = 0; while(r-l > 1){ int mid = (r+l)/2; cout << mid << " " << 0 << endl; int val1; cin >> val1; if(val1 == 0) return 0; cout << mid-1 << " " << 0 << endl; int val2; cin >> val2; if(val2 == 0) return 0; if(val1 < val2) l = mid; else r = mid; } ans1 = l, l = 0, r = 100001; while(r-l > 1){ int mid = (r+l)/2; cout << ans1 << " " << mid << endl; int val1; cin >> val1; if(val1 == 0) return 0; cout << ans1 << " " << mid-1 << endl; int val2; cin >> val2; if(val2 == 0) return 0; if(val1 < val2) l = mid; else r = mid; } return 0; }