結果
問題 | No.335 門松宝くじ |
ユーザー | firiexp |
提出日時 | 2019-12-12 13:27:01 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
CE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 2,590 bytes |
コンパイル時間 | 692 ms |
コンパイル使用メモリ | 89,004 KB |
最終ジャッジ日時 | 2024-11-14 21:57:02 |
合計ジャッジ時間 | 1,204 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。(リジャッジ後のコンパイルエラーは公開されます)
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
main.cpp:17:39: error: '::numeric_limits' has not been declared 17 | template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208; | ^~~~~~~~~~~~~~ main.cpp:17:55: error: expected primary-expression before '>' token 17 | template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208; | ^ main.cpp:17:61: error: no matching function for call to 'max()' 17 | 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:17:61: note: candidate expects 2 arguments, 0 provided 17 | 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: n
ソースコード
#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 = uint32_t; 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() { int n, m; cin >> n >> m; int ans = -1, ind = -1, cnt = 0; while(cnt < m){ vector<int> v(n); for (auto &&i : v) scanf("%d", &i); auto submax = make_v(n, n, -1), submin = make_v(n, n, -1); for (int i = 0; i < n; ++i) { for (int j = i; j < n; ++j) { if(i == j) submax[i][j] = v[i], submin[i][j] = v[i]; else { submax[i][j] = max(submax[i][j-1], v[j]); submin[i][j] = min(submin[i][j-1], v[j]); } } } int sum = 0; for (int i = 0; i < n; ++i) { for (int j = i+1; j < n; ++j) { int val = 0, ok = 0; if(i != 0){ if(v[i] < v[j]) { if(v[i] < submax[0][i-1]) ok = 1, val = max(val, submax[0][i-1]); }else { if(v[i] > submin[0][i-1]) ok = 1; } } if(i+1 < j){ if(submax[i+1][j-1] > max(v[i], v[j])){ ok = 1, val = max(val, submax[i+1][j-1]); } if(submin[i+1][j-1] < min(v[i], v[j])){ ok = 1; } } if(j != n-1){ if(v[j] < v[i]) { if(v[j] < submax[j+1][n-1]) ok = 1, val = max(val, submax[j+1][n-1]); }else { if(v[j] > submin[j+1][n-1]) ok = 1; } } if(ok) val = max({val, v[i], v[j]}); sum += val; } } if(ans < sum) ans = sum, ind = cnt; cnt++; } cout << ind << "\n"; return 0; }