結果

問題 No.1014 competitive fighting
ユーザー 👑 tute7627tute7627
提出日時 2020-03-20 23:04:34
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 5,310 bytes
コンパイル時間 2,853 ms
コンパイル使用メモリ 189,248 KB
実行使用メモリ 14,464 KB
最終ジャッジ日時 2024-05-09 00:16:09
合計ジャッジ時間 7,457 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 3 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 AC 43 ms
14,336 KB
testcase_11 AC 71 ms
14,336 KB
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 WA -
testcase_31 WA -
testcase_32 WA -
testcase_33 AC 7 ms
5,376 KB
testcase_34 AC 73 ms
12,544 KB
testcase_35 AC 100 ms
13,952 KB
testcase_36 AC 71 ms
12,160 KB
testcase_37 AC 4 ms
5,376 KB
testcase_38 AC 59 ms
9,600 KB
testcase_39 AC 30 ms
6,400 KB
testcase_40 AC 60 ms
9,472 KB
testcase_41 AC 41 ms
8,192 KB
testcase_42 AC 97 ms
13,952 KB
testcase_43 AC 7 ms
5,376 KB
testcase_44 AC 88 ms
13,184 KB
testcase_45 AC 49 ms
8,704 KB
testcase_46 AC 9 ms
5,376 KB
testcase_47 AC 27 ms
6,272 KB
testcase_48 AC 70 ms
12,160 KB
testcase_49 AC 4 ms
5,376 KB
testcase_50 AC 92 ms
13,568 KB
testcase_51 AC 50 ms
8,832 KB
testcase_52 AC 5 ms
5,376 KB
testcase_53 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = (m) - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD1 = 1e9+7;
const ll MOD9 = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T>
bool chmin(T &a,T b){if(a>b){a=b;return true;}else return false;}
template<typename T>
bool chmax(T &a,T b){if(a<b){a=b;return true;}else return false;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>
void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T>
void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)
{cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};
void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++)
{for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};
template<typename T>
void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];
for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};
template<typename T>
vector<vector<T>>vec(ll x, ll y, T w){
  vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
vector<ll>dx={1,0,-1,0,1,1,-1,-1};
vector<ll>dy={0,1,0,-1,1,-1,1,-1};
template<typename T>
vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>
auto make_v(size_t a,Ts... ts){
  return vector<decltype(make_v(ts...))>(a,make_v(ts...));
}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2>&p){
  return os << p.first << " " << p.second;
}  
template<typename T>
struct SegmentTree{
  using F = function<T(T,T)>;
  vector<T> data;
  ll n,lastlen = 1;
  T func(T a, T b){return a > b ? a : b;};
  bool check (T a, T b){return a >= b;};
  T iden = 0; //単位元を変えるのを忘れない！！！！！！！！！！
  SegmentTree(vector<T> &v){
    build(v);
  }
  SegmentTree(ll size){
    n = size;
    while(lastlen < n)lastlen *= 2;
    data.assign(lastlen*2-1,iden);
  }
  void build(vector<T> &v){
    n = (ll)v.size();
    while(lastlen < n)lastlen *= 2;
    data.assign(lastlen*2-1,iden);
    for(ll i=0;i<n;i++)data[i+lastlen-1] = v[i];
    for(ll i=lastlen-2;i>=0;i--){
      data[i] = func(data[2*i+1], data[2*i+2]);
    }
  }
  void build(){
    for(ll i=lastlen-2;i>=0;i--){
      data[i] = func(data[2*i+1], data[2*i+2]);
    }
  }
  void update(ll point, T x){
    point+=lastlen-1;
    data[point] = x;
    while(point!=0){
      point=(point-1)/2;
      data[point]=func(data[2*point+1],data[2*point+2]);
    }
  }
  T query(ll l,ll r){
	if(l>=r)return iden;
    T left = iden, right = iden;
    l+=lastlen-1, r+=lastlen-1;
    while(l != r){
      if(~l&1)left = func(left, data[l++]);
      if(~r&1)right = func(data[--r], right);
      l >>= 1,r >>= 1;
    }
    return func(left, right);
  }
  T &operator[](ll x){
    return data[lastlen-1+x];
  }
  void print(){
    for(ll i=0;i<n;i++)cout<<((*this)[i]==iden?"x":to_string((*this)[i]))<<" ";
    cout<<endl;
  }
  T lower_bound(ll p,T x){
    ll sumbuf=iden, l=p,r=p+1;
    p = p + lastlen - 1;
    while(1){
      if(!check(func(sumbuf,data[p]), x)){
        if(p%2==1){
          p = (p-1)/2;
          r = l + (r-l)*2;
        }
        else if(r>=n){
          return n;
        }
        else{
          func(sumbuf,data[p]);
          p >>= 1;
          ll x = r + (r-l)*2; 
          l = r; r = x;
        }
      }
      else if(p >= lastlen - 1)return r - 1;
      else if(!check(func(sumbuf,data[2*p+1]),x)){
        sumbuf = func(sumbuf, data[2*p+1]);
        p = 2*p+2; l = (r+l)/2;
      }
      else{
        p = 2*p+1; r = (r+l)/2;
      }
    }  
  }
};
int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res=0,buf=0;
  bool judge = true;
  ll n;cin>>n;
  vector<ll>a(n),b(n),c(n);
  rep(i,0,n)cin>>a[i]>>b[i]>>c[i];
  vector<ll>vala=a;
  sort(ALLR(vala));
  vector<ll>order(n);
  iota(ALL(order),0);
  sort(ALL(order),[&](ll x,ll y){
    return max(a[x],b[x]-c[x])>max(a[y],b[y]-c[y]);});
  vector<P>p(n);
  rep(i,0,n)p[i]=MP(a[i],i);
  sort(ALLR(p));
  SegmentTree<ll>seg(n);
  SegmentTree<ll>segmx(n);
  vector<ll>aidx(n);
  rep(i,0,n)aidx[p[i].se]=i;
  rep(i,0,n)segmx[aidx[i]]=b[i]-c[i];
  segmx.build();
  vector<ll>ret(n,INF);
  rrep(i,0,n){
    ll t=order[i];
    ll idx=lower_bound(ALL(vala),b[t]-c[t],greater<ll>())-vala.begin();
    ll k=aidx[t];
    segmx.update(k,0);
    if(segmx.query(idx,n)>=a[t]){
      //debug(vala,n);
      //cout<<idx spa i spa t spa a[t] spa b[t] spa k<<endl;
      //segmx.print();
      break;
    }
    else ret[t]=min(INF,seg.query(idx,n)+b[t]);
    segmx.update(k,b[t]-c[t]);
    //cout<<t spa idx<<endl;
    seg.update(k,ret[t]);
    //seg.print();
  }
  rep(i,0,n)ans(ret[i]==INF,"BAN",ret[i]);
  return 0;
}
0