結果
問題 | No.755 Zero-Sum Rectangle |
ユーザー | firiexp |
提出日時 | 2018-12-03 00:21:27 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
CE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 1,787 bytes |
コンパイル時間 | 751 ms |
コンパイル使用メモリ | 75,952 KB |
最終ジャッジ日時 | 2024-11-14 20:41:24 |
合計ジャッジ時間 | 1,436 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。(リジャッジ後のコンパイルエラーは公開されます)
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
main.cpp:14:21: error: '::numeric_limits' has not been declared 14 | constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208; | ^~~~~~~~~~~~~~ main.cpp:14:37: error: expected primary-expression before '>' token 14 | constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208; | ^ main.cpp:14:43: error: no matching function for call to 'max()' 14 | 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:14:43: note: candidate expects 2 arguments, 0 provided 14 | 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: 'template<class _Tp, class _Compare> constexpr const _Tp& std::max(const _Tp&, const _Tp&, _Compare)' 300 | max(const _Tp&
ソースコード
#include <iostream> #include <algorithm> #include <vector> #include <iomanip> #include <map> #include <queue> static const int MOD = 1000000007; using ll = long long; using u32 = unsigned; using namespace std; template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208; template <class T> vector<T> make_v(size_t size, const T& init){ return vector<T>(size, init); } template<class... Ts> auto make_v(size_t size, Ts... rest) { return vector<decltype(make_v(rest...))>(size, make_v(rest...)); } int main() { int n, m; cin >> n >> m; auto v = make_v(m+1, m+1, 0); auto ans = make_v(m+1, m+1, 0); for (int i = 0; i < m; ++i) { for (int j = 0; j < m; ++j) { cin >> v[i+1][j+1]; } } for (int i = 0; i <= m; ++i) { for (int j = 1; j <= m; ++j) { v[i][j] += v[i][j-1]; } } for (int i = 1; i <= m; ++i) { for (int j = 0; j <= m; ++j) { v[i][j] += v[i-1][j]; } } for (int i = 1; i <= m; ++i) { for (int j = 1; j <= m; ++j) { for (int k = i; k <= m; ++k) { for (int l = j; l <= m; ++l) { if(v[k][l]-v[i-1][l]-v[k][j-1]+v[i-1][j-1] == 0){ ans[i-1][j-1]++; ans[i-1][l]--; ans[k][j-1]--; ans[k][l]++; } } } } } for (int i = 0; i <= m; ++i) { for (int j = 1; j <= m; ++j) { ans[i][j] += ans[i][j-1]; } } for (int i = 1; i <= m; ++i) { for (int j = 0; j <= m; ++j) { ans[i][j] += ans[i-1][j]; } } for (int i = 0; i < n; ++i) { int a, b; cin >> a >> b; cout << ans[a-1][b-1] << "\n"; } return 0; }