結果

問題 No.165 四角で囲え！
ユーザー firiexpfiriexp
提出日時 2019-11-07 23:50:26
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
CE  
(最新)
AC  
(最初)
実行時間 -
コード長 2,301 bytes
コンパイル時間 698 ms
コンパイル使用メモリ 90,420 KB
最終ジャッジ日時 2024-11-14 21:49:22
合計ジャッジ時間 1,275 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、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: note: candidate: 'templat

ソースコード

diff # 

#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, b;
    cin >> n >> b;
    vector<int> xs(n), ys(n), ps(n);
    for (int i = 0; i < n; ++i) {
        cin >> xs[i] >> ys[i] >> ps[i];
    }
    auto zx = xs, zy = ys;
    sort(zx.begin(), zx.end());
    zx.erase(unique(zx.begin(), zx.end()), zx.end());
    sort(zy.begin(), zy.end());
    zy.erase(unique(zy.begin(), zy.end()), zy.end());
    auto v = make_v(zy.size()+1, zx.size()+1, 0);
    auto v2 = v;
    auto fx = [&zx](int x){ return lower_bound(zx.begin(),zx.end(), x) - zx.begin(); };
    auto fy = [&zy](int y){ return lower_bound(zy.begin(),zy.end(), y) - zy.begin(); };
    for (int i = 0; i < n; ++i) {
        v[fy(ys[i])+1][fx(xs[i])+1] += ps[i];
        v2[fy(ys[i])+1][fx(xs[i])+1]++;
    }
    for (int i = 0; i < zy.size(); ++i) {
        for (int j = 0; j < zx.size()+1; ++j) {
            v[i+1][j] += v[i][j];
            v2[i+1][j] += v2[i][j];
        }
    }
    for (int i = 0; i < zy.size()+1; ++i) {
        for (int j = 0; j < zx.size(); ++j) {
            v[i][j+1] += v[i][j];
            v2[i][j+1] += v2[i][j];
        }
    }
    int ans = 0;
    for (int i = 0; i < zy.size(); ++i) {
        for (int j = i+1; j <= zy.size(); ++j) {
            int l = 0, r = 0;
            while(r < zx.size()){
                r++;
                while(l < r && v[j][r]-v[j][l]-v[i][r]+v[i][l] > b){
                    l++;
                }
                ans = max(ans, v2[j][r]-v2[j][l]-v2[i][r]+v2[i][l]);
            }
        }
    }
    cout << ans << "\n";
    return 0;
}
0