제출 #247701

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
247701		rqi	구슬과 끈 (APIO14_beads)	C++14	100 / 100	305 ms	50916 KiB

beads

#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef double db; 
typedef string str; 

typedef pair<int,int> pi;
typedef pair<ll,ll> pl; 
typedef pair<db,db> pd; 

typedef vector<int> vi; 
typedef vector<ll> vl; 
typedef vector<db> vd; 
typedef vector<str> vs; 
typedef vector<pi> vpi;
typedef vector<pl> vpl; 
typedef vector<pd> vpd; 

#define mp make_pair
#define f first
#define s second
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend() 
#define rsz resize
#define ins insert 
#define ft front() 
#define bk back()
#define pf push_front 
#define pb push_back
#define eb emplace_back 
#define lb lower_bound 
#define ub upper_bound 

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

const int MOD = 1e9+7; // 998244353;
const int MX = 2e5+5; 
const ll INF = 1e18; 
const ld PI = acos((ld)-1);
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1}; 
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 

template<class T> bool ckmin(T& a, const T& b) { 
    return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { 
    return a < b ? a = b, 1 : 0; } 
int pct(int x) { return __builtin_popcount(x); } 
int bits(int x) { return 31-__builtin_clz(x); } // floor(log2(x)) 
int cdiv(int a, int b) { return a/b+!(a<0||a%b == 0); } // division of a by b rounded up, assumes b > 0 
int fstTrue(function<bool(int)> f, int lo, int hi) {
    hi ++; assert(lo <= hi); // assuming f is increasing
    while (lo < hi) { // find first index such that f is true 
        int mid = (lo+hi)/2; 
        f(mid) ? hi = mid : lo = mid+1; 
    } 
    return lo;
}

// INPUT
template<class A> void re(complex<A>& c);
template<class A, class B> void re(pair<A,B>& p);
template<class A> void re(vector<A>& v);
template<class A, size_t SZ> void re(array<A,SZ>& a);

template<class T> void re(T& x) { cin >> x; }
void re(db& d) { str t; re(t); d = stod(t); }
void re(ld& d) { str t; re(t); d = stold(t); }
template<class H, class... T> void re(H& h, T&... t) { re(h); re(t...); }

template<class A> void re(complex<A>& c) { A a,b; re(a,b); c = {a,b}; }
template<class A, class B> void re(pair<A,B>& p) { re(p.f,p.s); }
template<class A> void re(vector<A>& x) { trav(a,x) re(a); }
template<class A, size_t SZ> void re(array<A,SZ>& x) { trav(a,x) re(a); }

// TO_STRING
#define ts to_string
str ts(char c) { return str(1,c); }
str ts(bool b) { return b ? "true" : "false"; }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
template<class A> str ts(complex<A> c) { 
    stringstream ss; ss << c; return ss.str(); }
str ts(vector<bool> v) { 
    str res = "{"; F0R(i,sz(v)) res += char('0'+v[i]);
    res += "}"; return res; }
template<size_t SZ> str ts(bitset<SZ> b) {
    str res = ""; F0R(i,SZ) res += char('0'+b[i]);
    return res; }
template<class A, class B> str ts(pair<A,B> p);
template<class T> str ts(T v) { // containers with begin(), end()
    bool fst = 1; str res = "{";
    for (const auto& x: v) {
        if (!fst) res += ", ";
        fst = 0; res += ts(x);
    }
    res += "}"; return res;
}
template<class A, class B> str ts(pair<A,B> p) {
    return "("+ts(p.f)+", "+ts(p.s)+")"; }

// OUTPUT
template<class A> void pr(A x) { cout << ts(x); }
template<class H, class... T> void pr(const H& h, const T&... t) { 
    pr(h); pr(t...); }
void ps() { pr("\n"); } // print w/ spaces
template<class H, class... T> void ps(const H& h, const T&... t) { 
    pr(h); if (sizeof...(t)) pr(" "); ps(t...); }

// DEBUG
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
    cerr << ts(h); if (sizeof...(t)) cerr << ", ";
    DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL
#define dbg(...) cerr << "LINE(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif

// FILE I/O
void setIn(string s) { freopen(s.c_str(),"r",stdin); }
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
void unsyncIO() { ios_base::sync_with_stdio(0); cin.tie(0); }
void setIO(string s = "") {
    unsyncIO();
    // cin.exceptions(cin.failbit); 
    // throws exception when do smth illegal
    // ex. try to read letter into int
    if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}

const int mx = 200005;

int n;
vector<pair<int, ll>> adj[mx]; // node, dist
pair<int, ll> par[mx];
vector<pair<int, ll>> children[mx];

ll dp[mx][2]; //filled everything up, 1 blue hanging from root
ll adp[mx][2];

void ndfs(int node, int prv = -1){
    for(auto u: adj[node]){
        if(u.f == prv) continue;
        par[u.f] = mp(node, u.s);
        children[node].pb(u);
        ndfs(u.f, node);
    }
    dp[node][0] = 0;

    for(auto u: adj[node]){
        if(u.f == prv) continue;
        dp[node][0]+=max(u.s+dp[u.f][1], dp[u.f][0]);
    }
    dp[node][1] = -INF;

    for(auto u: adj[node]){
        if(u.f == prv) continue;
        ckmax(dp[node][1], dp[node][0]-max(u.s+dp[u.f][1], dp[u.f][0])+u.s+dp[u.f][0]);
    }
    //dbg(node, dp[node][0]);
}



ll naivesolve(int R){
    //dbg(R);
    for(int i = 1; i <= n; i++){
        dp[i][0] = dp[i][1] = -INF;
    }
    ndfs(R);
    return dp[R][0]; 
}

void adfs(int node){
    //find answer for adp[children]
    ll dp0 = 0;
    for(auto u: children[node]){
        dp0+=max(dp[u.f][0], dp[u.f][1]+u.s);
    }
    if(node != 1) dp0+=max(adp[node][0], adp[node][1]+par[node].s);

    for(auto u: children[node]){
        adp[u.f][0] = dp0-max(dp[u.f][0], dp[u.f][1]+u.s);
    }

    vl vals;
    vl pre;
    vl suf;

    for(int i = 0; i < sz(children[node]); i++){
        pair<int, ll> u = children[node][i];
        vals.pb(u.s+dp[u.f][0]-max(dp[u.f][0], dp[u.f][1]+u.s));
    }

    pre = suf = vals;
    for(int i = 1; i < sz(pre); i++){
        ckmax(pre[i], pre[i-1]);
    }
    for(int i = sz(suf)-2; i >= 0; i--){
        ckmax(suf[i], suf[i+1]);
    }

    ll topval = -INF;
    if(node != 1){
        ckmax(topval, adp[node][0]+par[node].s-max(adp[node][0], adp[node][1]+par[node].s));
    }
    for(int i = 0; i < sz(children[node]); i++){
        pair<int, ll> u = children[node][i];
        ll bval = topval;
        if(i-1 >= 0) ckmax(bval, pre[i-1]);
        if(i+1 < sz(suf)) ckmax(bval, suf[i+1]);
        ckmax(adp[u.f][1], adp[u.f][0]+bval);
    }

    for(auto u: children[node]){
        adfs(u.f);
    }
}

ll smartsolve(int R){
    for(int i = 1; i <= n; i++){
        adp[i][0] = adp[i][1] = -INF;
    }
    adfs(R);
    ll ans = 0;
    for(int i = 1; i <= n; i++){
        if(i == R) continue;
        ckmax(ans, dp[i][0]+adp[i][0]);
        ckmax(ans, dp[i][0]+adp[i][1]+par[i].s);
    }
    return ans;
}


int main() {
    setIO();
    
    cin >> n;
    for(int i = 1; i <= n-1; i++){
        int a, b;
        ll c;
        cin >> a >> b >> c;
        adj[a].pb(mp(b, c));
        adj[b].pb(mp(a, c));
    }

    ll ans = 0;

    // for(int i = 1; i <= n; i++){
    //     //dbg(i, naivesolve(i));
    //     ckmax(ans, naivesolve(i));
    // }

    ckmax(ans, naivesolve(1));

    ckmax(ans, smartsolve(1));
    // for(int i = 1; i <= n; i++){
    //     dbg(i, adp[i][0], adp[i][1]);
    // }
    ps(ans);

    // you should actually read the stuff at the bottom
}

/* stuff you should look for
    * int overflow, array bounds
    * special cases (n=1?)
    * do smth instead of nothing and stay organized
    * WRITE STUFF DOWN
*/

컴파일 시 표준 에러 (stderr) 메시지

beads.cpp: In function 'void setIn(std::__cxx11::string)':
beads.cpp:128:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void setIn(string s) { freopen(s.c_str(),"r",stdin); }
                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
beads.cpp: In function 'void setOut(std::__cxx11::string)':
beads.cpp:129:32: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void setOut(string s) { freopen(s.c_str(),"w",stdout); }
                         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 13 / 13
• Subtask 2: 15 / 15
• Subtask 3: 29 / 29
• Subtask 4: 43 / 43