結果
問題 | No.331 CodeRunnerでやれ |
ユーザー | firiexp |
提出日時 | 2019-12-26 21:57:39 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
CE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 2,202 bytes |
コンパイル時間 | 740 ms |
コンパイル使用メモリ | 89,632 KB |
最終ジャッジ日時 | 2024-11-14 22:00:28 |
合計ジャッジ時間 | 1,381 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。(リジャッジ後のコンパイルエラーは公開されます)
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
main.cpp:18:39: error: '::numeric_limits' has not been declared 18 | template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208; | ^~~~~~~~~~~~~~ main.cpp:18:55: error: expected primary-expression before '>' token 18 | template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208; | ^ main.cpp:18:61: error: no matching function for call to 'max()' 18 | 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:18:61: note: candidate expects 2 arguments, 0 provided 18 | 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> #include <cmath> static const int MOD = 1000000007; using ll = long long; using u32 = unsigned; using u64 = unsigned long long; using namespace std; template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208; template <class T, class U> vector<T> make_v(U size, const T& init){ return vector<T>(static_cast<size_t>(size), init); } template<class... Ts, class U> auto make_v(U size, Ts... rest) { return vector<decltype(make_v(rest...))>(static_cast<size_t>(size), make_v(rest...)); } template<class T> void chmin(T &a, const T &b){ a = (a < b ? a : b); } template<class T> void chmax(T &a, const T &b){ a = (a > b ? a : b); } int main() { auto v = make_v(50, 50, 0); int a = 25, b = 25, dir = 0; array<int, 4> dy{-1, 0, 1, 0}, dx{0, 1, 0, -1}; v[a][b] = 2; auto dfs = [&](auto &&f) -> int { for (int i = 0; i < 4; ++i) { string s; getline(cin, s); if(s == "Merry Christmas!") return 0; if(s == "20151224") return 1; int val = stoi(s); if(!v[a+dy[dir]][b+dx[dir]]){ v[a+dy[dir]][b+dx[dir]] = val+1; if(val){ cout << "F" << endl; a += dy[dir]; b += dx[dir]; int ret = f(f); if(ret >= 0) return ret; cout << "B" << endl; a -= dy[dir]; b -= dx[dir]; getline(cin, s); if(s == "Merry Christmas!") return 0; if(s == "20151224") return 1; } } cout << "R" << endl; dir = (dir+1)%4; } string s; getline(cin, s); if(s == "Merry Christmas!") return 0; if(s == "20151224") return 1; return -1; }; int ret = dfs(dfs); if(ret){ while(true){ cout << "F" << endl; string s; getline(cin, s); if(s == "Merry Christmas!") break; } } return 0; }