結果

問題 No.165 四角で囲え！
ユーザー fumiphysfumiphys
提出日時 2019-09-22 23:41:07
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 228 ms / 5,000 ms
コード長 4,606 bytes
コンパイル時間 2,245 ms
コンパイル使用メモリ 182,848 KB
実行使用メモリ 6,272 KB
最終ジャッジ日時 2024-09-19 03:48:18
合計ジャッジ時間 4,666 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 111 ms
5,632 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 1 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 158 ms
5,760 KB
testcase_06 AC 34 ms
5,376 KB
testcase_07 AC 2 ms
5,376 KB
testcase_08 AC 2 ms
5,376 KB
testcase_09 AC 2 ms
5,376 KB
testcase_10 AC 2 ms
5,376 KB
testcase_11 AC 65 ms
5,376 KB
testcase_12 AC 29 ms
5,376 KB
testcase_13 AC 29 ms
5,376 KB
testcase_14 AC 21 ms
5,376 KB
testcase_15 AC 20 ms
5,376 KB
testcase_16 AC 209 ms
6,144 KB
testcase_17 AC 187 ms
6,144 KB
testcase_18 AC 228 ms
6,144 KB
testcase_19 AC 197 ms
6,144 KB
testcase_20 AC 179 ms
6,144 KB
testcase_21 AC 181 ms
6,272 KB
testcase_22 AC 179 ms
6,272 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// includes
#include <bits/stdc++.h>
using namespace std;

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define bit(n) (1LL<<(n))
// functions
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;

ll sum[441][441], cnt[441][441];

int main(int argc, char const* argv[])
{
  int n, b;
  cin >> n >> b;
  vector<ll> x(n), y(n), p(n);
  rep(i, n)cin >> x[i] >> y[i] >> p[i];
  vector<ll> X = x, Y = y;
  sort(all(X)); UNIQUE(X);
  sort(all(Y)); UNIQUE(Y);
  map<ll, int> mpx, mpy;
  rep(i, sz(X))mpx[X[i]] = i;
  rep(i, sz(Y))mpy[Y[i]] = i;

  rep(i, n){
    sum[mpx[x[i]]][mpy[y[i]]] += p[i];
    cnt[mpx[x[i]]][mpy[y[i]]] += 1;
  }
  rep(i, sz(X)){
    FOR(j, 1, sz(Y)){
      cnt[i][j] += cnt[i][j-1];
      sum[i][j] += sum[i][j-1];
    }
  }
  FOR(i, 1, sz(X)){
    rep(j, sz(Y)){
      cnt[i][j] += cnt[i-1][j];
      sum[i][j] += sum[i-1][j];
    }
  }
  auto calc_sum = [&](int i, int j, int k, int r){
                    ll res = 0;
                    res += sum[j][r];
                    if(k>0)res -= sum[j][k-1];
                    if(i>0)res -= sum[i-1][r];
                    if(i>0&&j>0)res += sum[i-1][k-1];
                    return res;
                  };
  auto calc_cnt = [&](int i, int j, int k, int r){
                    ll res = 0;
                    res += cnt[j][r];
                    if(k>0)res -= cnt[j][k-1];
                    if(i>0)res -= cnt[i-1][r];
                    if(i>0&&j>0)res += cnt[i-1][k-1];
                    return res;
                  };
  ll res = 0;
  rep(i, sz(X)){
    FOR(j, i, sz(X)){
      int r = 0;
      rep(k, sz(Y)){
        r = max(r, k);
        for(; r < sz(Y); r++){
          if(calc_sum(i, j, k, r) > b)break;
        }
        if(r == k)continue;
        //cerr << i << " " << j << " " << k << " " << r << " " << calc_cnt(i, j, k, r) << endl;
        res = max(res, calc_cnt(i, j, k, r - 1));
      }
    }
  }
  cout << res << endl;
  return 0;
}
0