結果

問題 No.777 再帰的ケーキ
ユーザー sak
提出日時 2020-07-25 17:08:01
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 911 ms / 2,000 ms
コード長 2,882 bytes
コンパイル時間 3,520 ms
コンパイル使用メモリ 207,936 KB
最終ジャッジ日時 2025-01-12 05:35:13
ジャッジサーバーID
(参考情報)
judge4 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 4
other AC * 33
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i,N) repr(i,0,N)
#define per(i,N) for (int i=(int)N-1; i>=0; i--)
const ll MOD = pow(10,9)+7;
const ll LLINF = pow(2,61)-1;
const int INF = pow(2,30)-1;
vector<ll> fac;
void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; }
ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; }
ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; }
ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }
// ----------------------------------------------------------------------
// ----------------------------------------------------------------------
struct SegTree {
int size;
vector<ll> pos;
SegTree(ll N) { size = 1; while(size<N) size<<=1; pos.resize(2*size,0); }
ll operator[](const ll &x) const { return pos[x+size]; }
void build() { per(i,size) operate(i); }
void set(ll x, const ll v) { pos[x+size] = v; }
void update(ll x, const ll v) { set(x,v); x+=size; while (x>>=1) operate(x); }
ll query(ll a, ll b) {
ll L = 0, R = 0;
for (a+=size, b+=size; a<b; a>>=1, b>>=1) {
if (a&1) { L = q(L,pos[a]); a++; }
if (b&1) { b--; R = q(R,pos[b]); }
}
return q(L,R);
}
void operate(ll i) { pos[i] = max(pos[i*2], pos[i*2+1]); }
ll q(ll x, ll y) { return max(x,y); }
};
// ----------------------------------------------------------------------
// ----------------------------------------------------------------------
vector<ll> zaatsu(vector<ll> &list) {
map<ll, ll> num; for (auto x: list) num[x]++;
ll p = 0; for (auto x: num) { num[x.first] = p; p++; }
vector<ll> result; for (auto x: list) result.push_back(num[x]);
return result;
}
// ----------------------------------------------------------------------
// ----------------------------------------------------------------------
struct cake {
ll a, b, c;
bool operator< (const cake &x) const { return a<x.a||(a==x.a&&b>x.b); };
};
int main() {
ll N; cin >> N;
vector<ll> A(N), B(N), C(N); rep(i,N) cin >> A[i] >> B[i] >> C[i];
vector<ll> ZB = zaatsu(B);
cake c[N]; rep(i,N) c[i] = {A[i], ZB[i], C[i]}; sort(c,c+N);
// rep(i,N) cout << c[i].a << " " << c[i].b << " " << c[i].c << endl;
SegTree st(N);
rep(i,N) {
ll ml = st.query(0,c[i].b);
st.update(c[i].b,max(st[c[i].b], ml+c[i].c));
}
// rep(i,N) cout << st[i] << " "; cout << endl;
ll result = st.query(0,N);
cout << result << endl;
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0