結果

問題 No.568 じゃんじゃん　落とす　委員会
ユーザー しらっ亭しらっ亭
提出日時 2017-09-09 00:30:25
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 90 ms / 1,000 ms
コード長 6,344 bytes
コンパイル時間 2,046 ms
コンパイル使用メモリ 180,636 KB
実行使用メモリ 5,648 KB
最終ジャッジ日時 2023-08-20 09:48:07
合計ジャッジ時間 4,913 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 87 ms
5,648 KB
testcase_01 AC 88 ms
5,168 KB
testcase_02 AC 38 ms
4,376 KB
testcase_03 AC 36 ms
4,376 KB
testcase_04 AC 36 ms
4,376 KB
testcase_05 AC 45 ms
4,380 KB
testcase_06 AC 36 ms
4,380 KB
testcase_07 AC 37 ms
4,376 KB
testcase_08 AC 35 ms
4,380 KB
testcase_09 AC 46 ms
4,376 KB
testcase_10 AC 45 ms
4,376 KB
testcase_11 AC 38 ms
4,380 KB
testcase_12 AC 88 ms
5,336 KB
testcase_13 AC 90 ms
5,212 KB
testcase_14 AC 90 ms
5,104 KB
testcase_15 AC 87 ms
5,456 KB
testcase_16 AC 88 ms
5,352 KB
testcase_17 AC 87 ms
5,396 KB
testcase_18 AC 88 ms
5,480 KB
testcase_19 AC 90 ms
5,384 KB
testcase_20 AC 88 ms
5,484 KB
testcase_21 AC 90 ms
5,468 KB
testcase_22 AC 88 ms
5,292 KB
testcase_23 AC 35 ms
4,376 KB
testcase_24 AC 45 ms
4,376 KB
testcase_25 AC 45 ms
4,380 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

#define forr(x,arr) for(auto&& x:arr)
#define _overload3(_1,_2,_3,name,...) name
#define _rep2(i,n) _rep3(i,0,n)
#define _rep3(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,_rep3,_rep2,)(__VA_ARGS__)
#define _rrep2(i,n) _rrep3(i,0,n)
#define _rrep3(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define bit(n) (1LL<<(n))
#define sz(x) ((int)(x).size())
#define TEN(n) ((ll)(1e##n))
#define fst first
#define snd second

string DBG_DLM(int &i){return(i++==0?"":", ");}
#define DBG_B(exp){int i=0;os<<"{";{exp;}os<<"}";return os;}
template<class T>ostream&operator<<(ostream&os,vector<T>v);
template<class T>ostream&operator<<(ostream&os,set<T>v);
template<class T>ostream&operator<<(ostream&os,queue<T>q);
template<class T>ostream&operator<<(ostream&os,priority_queue<T>q);
template<class T,class K>ostream&operator<<(ostream&os,pair<T,K>p);
template<class T,class K>ostream&operator<<(ostream&os,map<T,K>mp);
template<class T,class K>ostream&operator<<(ostream&os,unordered_map<T,K>mp);
template<int I,class TPL>void DBG(ostream&os,TPL t){}
template<int I,class TPL,class H,class...Ts>void DBG(ostream&os,TPL t){os<<(I==0?"":", ")<<get<I>(t);DBG<I+1,TPL,Ts...>(os,t);}
template<class T,class K>void DBG(ostream&os,pair<T,K>p,string delim){os<<"("<<p.first<<delim<<p.second<<")";}
template<class...Ts>ostream&operator<<(ostream&os,tuple<Ts...>t){os<<"(";DBG<0,tuple<Ts...>,Ts...>(os,t);os<<")";return os;}
template<class T,class K>ostream&operator<<(ostream&os,pair<T,K>p){DBG(os,p,", ");return os;}
template<class T>ostream&operator<<(ostream&os,vector<T>v){DBG_B(forr(t,v){os<<DBG_DLM(i)<<t;});}
template<class T>ostream&operator<<(ostream&os,set<T>s){DBG_B(forr(t,s){os<<DBG_DLM(i)<<t;});}
template<class T>ostream&operator<<(ostream&os,queue<T>q){DBG_B(for(;q.size();q.pop()){os<<DBG_DLM(i)<<q.front();});}
template<class T>ostream&operator<<(ostream&os,priority_queue<T>q){DBG_B(for(;q.size();q.pop()){os<<DBG_DLM(i)<<q.top();});}
template<class T,class K>ostream&operator<<(ostream&os,map<T,K>m){DBG_B(forr(p,m){os<<DBG_DLM(i);DBG(os,p,"->");});}
template<class T,class K>ostream&operator<<(ostream&os,unordered_map<T,K>m){DBG_B(forr(p,m){os<<DBG_DLM(i);DBG(os,p,"->");});}
#define DBG_OVERLOAD(_1,_2,_3,_4,_5,_6,macro_name,...)macro_name
#define DBG_LINE(){char s[99];sprintf(s,"line:%3d | ",__LINE__);cerr<<s;}
#define DBG_OUTPUT(v){cerr<<(#v)<<"="<<(v);}
#define DBG1(v,...){DBG_OUTPUT(v);}
#define DBG2(v,...){DBG_OUTPUT(v);cerr<<", ";DBG1(__VA_ARGS__);}
#define DBG3(v,...){DBG_OUTPUT(v);cerr<<", ";DBG2(__VA_ARGS__);}
#define DBG4(v,...){DBG_OUTPUT(v);cerr<<", ";DBG3(__VA_ARGS__);}
#define DBG5(v,...){DBG_OUTPUT(v);cerr<<", ";DBG4(__VA_ARGS__);}
#define DBG6(v,...){DBG_OUTPUT(v);cerr<<", ";DBG5(__VA_ARGS__);}
#define DEBUG0(){DBG_LINE();cerr<<endl;}
#ifdef LOCAL
#define out(...){DBG_LINE();DBG_OVERLOAD(__VA_ARGS__,DBG6,DBG5,DBG4,DBG3,DBG2,DBG1)(__VA_ARGS__);cerr<<endl;}
#else
#define out(...)
#endif

using ll=long long;
using pii=pair<int,int>;using pll=pair<ll,ll>;using pil=pair<int,ll>;using pli=pair<ll,int>;
using vs=vector<string>;using vvs=vector<vs>;using vvvs=vector<vvs>;
using vb=vector<bool>;using vvb=vector<vb>;using vvvb=vector<vvb>;
using vi=vector<int>;using vvi=vector<vi>;using vvvi=vector<vvi>;
using vl=vector<ll>;using vvl=vector<vl>;using vvvl=vector<vvl>;
using vd=vector<double>;using vvd=vector<vd>;using vvvd=vector<vvd>;
using vpii=vector<pii>;using vvpii=vector<vpii>;using vvvpii=vector<vvpii>;
template<class A,class B>bool amax(A&a,const B&b){return b>a?a=b,1:0;}
template<class A,class B>bool amin(A&a,const B&b){return b<a?a=b,1:0;}
ll ri(){ll l;cin>>l;return l;} string rs(){string s;cin>>s;return s;}


template <typename T> struct BinaryIndexedTree0 {
  const int N;
  vector<T> val;

  BinaryIndexedTree0(int N) : N(N), val(N) {}

  T sum(int i) const {
    T s = 0;
    --i;
    if (i >= N) i = N - 1;
    for (; i >= 0; i = (i & (i + 1)) - 1) s += val[i];
    return s;
  }

  T sum(int l, int r) const {
    return sum(r) - sum(l);
  }

  void add(int i, T x) {
    for (; i < N; i |= i + 1) val[i] += x;
  }

  void set(int i, T x) {
    T c = sum(i, i + 1);
    add(i, x - c);
  }

  int lower_bound(T w) const {
    int x = 0;

    for (int k = (1 << (31 - __builtin_clz(N))) - 1; ; k >>= 1) {
      if (x + k < N && val[x + k] < w) {
        w -= val[x + k];
        x += k + 1;
      }
      if (k == 0) break;
    }
    return x;
  }
};

void Main() {
  int n = ri(), m = ri();

  int p3 = 0;

  vvpii A(3), D(3);

  rep(i, n) {
    int x = ri(), a = ri(), b = ri();
    if (x == 3) p3++;
    else {
      A[x].emplace_back(a, b);
      D[x].emplace_back(a, b);
    }
  }

  rep(i, 3) {
    sort(all(A[i]));
    sort(all(D[i]), greater<pii>());
  }

  BinaryIndexedTree0<int> ft1(100010);
  BinaryIndexedTree0<int> ft2(100010);

  forr(ab, A[1]) ft2.add(ab.snd, 1);
  forr(ab, A[0]) ft1.add(ab.snd, 1);
  out(p3);

  int q3 = sz(A[2]);

  int ans = 1e9;

  out(D[0]);
  out(D[1]);
  out(D[2]);

  rep(a, 1, 100002) {
    while (sz(D[0]) && D[0].back().fst < a) {
      int b = D[0].back().snd;
      ft1.add(b, -1);
      D[0].pop_back();
    }
    while (sz(D[1]) && D[1].back().fst < a) {
      int b = D[1].back().snd;
      ft2.add(b, -1);
      ft1.add(b, 1);
      D[1].pop_back();
    }
    while (sz(D[2]) && D[2].back().fst < a) {
      q3--;
      int b = D[2].back().snd;
      ft2.add(b, 1);
      D[2].pop_back();
    }

    auto cnt = [&](int x) -> int {
      int f1 = ft1.sum(x, 100002);
      int f2 = ft2.sum(100002);
      out(x, f1, f2, q3, p3);
      return f1+f2+q3+p3;
    };

    int lim;
    {
      auto check = [&](int x) -> bool {
        return cnt(x) >= m;
      };

      int ok = 0;
      int ng = 100003;

      while (abs(ok - ng) > 1) {
        int mid = (ok + ng) / 2;
        bool c = check(mid);
        if (c) ok = mid;
        else ng = mid;
      }
      lim = ok;
    }

    int ccc = cnt(lim);
    if (ccc >= m) {
      out(ccc);
      int cand = ft2.sum(lim, 100003) + q3 + p3;
      out(a, lim, cand);
      amin(ans, cand);
    }
  }

  cout << ans << endl;
}

signed main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  Main();
  return 0;
}
0