oj.uz

Submission #45688

# Submission time Handle Problem Language Result Execution time Memory
45688 2018-04-16T03:09:16 Z JohnTitor Beads and wires (APIO14_beads) C++11
100 / 100
 487 ms 52096 KB 
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, j, k) for(int i=(j); i<=(k); i++)
#define FFOR(i, j, k) for(int i=(j); i<(k); i++)
#define DFOR(i, j, k) for(int i=(j); i>=(k); i--)
#define bug(x) cerr<<#x<<" = "<<(x)<<'\n'
#define pb push_back
#define mp make_pair
#define setbit(s, i) (s|=(1LL<<(i)))
#define bit(s, i) (((s)>>(i))&1LL)
#define mask(i) ((1LL<<(i)))
#define builtin_popcount __builtin_popcountll
typedef long long ll;
typedef long double ld;
template <typename T> inline void read(T &x){
    char c;
    bool nega=0;
    while((!isdigit(c=getchar()))&&(c!='-'));
    if(c=='-'){
        nega=1;
        c=getchar();
    }
    x=c-48;
    while(isdigit(c=getchar())) x=x*10+c-48;
    if(nega) x=-x;
}
template <typename T> inline void writep(T x){
    if(x>9) writep(x/10);
    putchar(x%10+48);
}
template <typename T> inline void write(T x){
    if(x<0){
        putchar('-');
        x=-x;
    }
    writep(x);
}
template <typename T> inline void writeln(T x){
    write(x);
    putchar('\n');
}
#define taskname "beads"
int n;
vector <pair <int, int> > g[200001];
vector <pair <int, int> > h[200001];
bool done[200001];
ll f[200001][2];
ll all[200001];
ll dtp[200001];
multiset <ll> d[200001];
void make(int u){
    if(done[u]) return;
    done[u]=1;
    f[u][0]=f[u][1]=0;
    all[u]=0;
    for(pair <int, int> v: h[u]){
        dtp[v.first]=v.second;
        make(v.first);
        d[u].insert(f[v.first][0]+dtp[v.first]-max(f[v.first][0], f[v.first][1]+dtp[v.first]));
        all[u]+=max(f[v.first][0], f[v.first][1]+v.second);
    }
    f[u][0]=all[u];
    if(d[u].empty()) f[u][1]=-mask(40);
    else f[u][1]=all[u]+*d[u].rbegin();
}
bool vs[200001];
vector <int> euler;
void dfs(int u){
    vs[u]=1;
    h[u].clear();
    euler.pb(u);
    for(pair <int, int> v: g[u]) if(!vs[v.first]){
        h[u].pb(v);
        dfs(v.first);
        euler.pb(u);
    }
}
vector <int> v;
int main(){
    #ifdef Kanikou
        if(fopen(taskname".inp", "r"))
            freopen(taskname".inp", "r", stdin);
    #endif // Kanikou
    read(n);
    {
        int a, b, c;
        FFOR(i, 1, n){
            read(a);
            read(b);
            read(c);
            g[a].pb(mp(b, c));
            g[b].pb(mp(a, c));
        }
    }
    ll ans=0;
    int root=1;
    dfs(1);
    make(1);
    ans=max(ans, f[1][0]);
    for(int u: euler){
        if(u==root) continue;
        ///make u become root
        ///push root down
        d[root].erase(d[root].find(f[u][0]+dtp[u]-max(f[u][0], f[u][1]+dtp[u])));
        all[root]-=max(f[u][0], f[u][1]+dtp[u]);
        f[root][0]=all[root];
        if(d[root].empty()) f[root][1]=-mask(40);
        else f[root][1]=all[root]+*d[root].rbegin();
        dtp[root]=dtp[u];
        ///bring u up
        d[u].insert(f[root][0]+dtp[root]-max(f[root][0], f[root][1]+dtp[root]));
        all[u]+=max(f[root][0], f[root][1]+dtp[root]);
        f[u][0]=all[u];
        if(d[u].empty()) f[u][1]=-mask(40);
        else f[u][1]=all[u]+*d[u].rbegin();
        dtp[u]=0;
        root=u;
        ans=max(ans, f[u][0]);
    }
    write(ans);
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 19200 KB Output is correct
2 Correct 19 ms 19200 KB Output is correct
3 Correct 20 ms 19192 KB Output is correct
4 Correct 18 ms 19200 KB Output is correct
5 Correct 17 ms 19132 KB Output is correct
6 Correct 18 ms 19068 KB Output is correct
7 Correct 17 ms 19072 KB Output is correct
8 Correct 18 ms 19200 KB Output is correct
9 Correct 17 ms 19072 KB Output is correct
10 Correct 17 ms 19072 KB Output is correct
11 Correct 18 ms 19260 KB Output is correct
12 Correct 19 ms 19072 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 19200 KB Output is correct
2 Correct 19 ms 19200 KB Output is correct
3 Correct 20 ms 19192 KB Output is correct
4 Correct 18 ms 19200 KB Output is correct
5 Correct 17 ms 19132 KB Output is correct
6 Correct 18 ms 19068 KB Output is correct
7 Correct 17 ms 19072 KB Output is correct
8 Correct 18 ms 19200 KB Output is correct
9 Correct 17 ms 19072 KB Output is correct
10 Correct 17 ms 19072 KB Output is correct
11 Correct 18 ms 19260 KB Output is correct
12 Correct 19 ms 19072 KB Output is correct
13 Correct 18 ms 19200 KB Output is correct
14 Correct 18 ms 19200 KB Output is correct
15 Correct 18 ms 19200 KB Output is correct
16 Correct 18 ms 19200 KB Output is correct
17 Correct 19 ms 19200 KB Output is correct
18 Correct 18 ms 19200 KB Output is correct
19 Correct 18 ms 19200 KB Output is correct
20 Correct 18 ms 19200 KB Output is correct
21 Correct 18 ms 19200 KB Output is correct
22 Correct 17 ms 19320 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 19200 KB Output is correct
2 Correct 19 ms 19200 KB Output is correct
3 Correct 20 ms 19192 KB Output is correct
4 Correct 18 ms 19200 KB Output is correct
5 Correct 17 ms 19132 KB Output is correct
6 Correct 18 ms 19068 KB Output is correct
7 Correct 17 ms 19072 KB Output is correct
8 Correct 18 ms 19200 KB Output is correct
9 Correct 17 ms 19072 KB Output is correct
10 Correct 17 ms 19072 KB Output is correct
11 Correct 18 ms 19260 KB Output is correct
12 Correct 19 ms 19072 KB Output is correct
13 Correct 18 ms 19200 KB Output is correct
14 Correct 18 ms 19200 KB Output is correct
15 Correct 18 ms 19200 KB Output is correct
16 Correct 18 ms 19200 KB Output is correct
17 Correct 19 ms 19200 KB Output is correct
18 Correct 18 ms 19200 KB Output is correct
19 Correct 18 ms 19200 KB Output is correct
20 Correct 18 ms 19200 KB Output is correct
21 Correct 18 ms 19200 KB Output is correct
22 Correct 17 ms 19320 KB Output is correct
23 Correct 21 ms 19840 KB Output is correct
24 Correct 22 ms 19968 KB Output is correct
25 Correct 22 ms 19840 KB Output is correct
26 Correct 26 ms 20600 KB Output is correct
27 Correct 27 ms 20608 KB Output is correct
28 Correct 28 ms 20576 KB Output is correct
29 Correct 29 ms 20600 KB Output is correct
30 Correct 28 ms 20608 KB Output is correct
31 Correct 27 ms 20984 KB Output is correct

Subtask #4
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 19200 KB Output is correct
2 Correct 19 ms 19200 KB Output is correct
3 Correct 20 ms 19192 KB Output is correct
4 Correct 18 ms 19200 KB Output is correct
5 Correct 17 ms 19132 KB Output is correct
6 Correct 18 ms 19068 KB Output is correct
7 Correct 17 ms 19072 KB Output is correct
8 Correct 18 ms 19200 KB Output is correct
9 Correct 17 ms 19072 KB Output is correct
10 Correct 17 ms 19072 KB Output is correct
11 Correct 18 ms 19260 KB Output is correct
12 Correct 19 ms 19072 KB Output is correct
13 Correct 18 ms 19200 KB Output is correct
14 Correct 18 ms 19200 KB Output is correct
15 Correct 18 ms 19200 KB Output is correct
16 Correct 18 ms 19200 KB Output is correct
17 Correct 19 ms 19200 KB Output is correct
18 Correct 18 ms 19200 KB Output is correct
19 Correct 18 ms 19200 KB Output is correct
20 Correct 18 ms 19200 KB Output is correct
21 Correct 18 ms 19200 KB Output is correct
22 Correct 17 ms 19320 KB Output is correct
23 Correct 21 ms 19840 KB Output is correct
24 Correct 22 ms 19968 KB Output is correct
25 Correct 22 ms 19840 KB Output is correct
26 Correct 26 ms 20600 KB Output is correct
27 Correct 27 ms 20608 KB Output is correct
28 Correct 28 ms 20576 KB Output is correct
29 Correct 29 ms 20600 KB Output is correct
30 Correct 28 ms 20608 KB Output is correct
31 Correct 27 ms 20984 KB Output is correct
32 Correct 75 ms 26380 KB Output is correct
33 Correct 75 ms 26356 KB Output is correct
34 Correct 75 ms 26352 KB Output is correct
35 Correct 423 ms 48044 KB Output is correct
36 Correct 412 ms 48008 KB Output is correct
37 Correct 421 ms 47972 KB Output is correct
38 Correct 471 ms 46948 KB Output is correct
39 Correct 440 ms 46228 KB Output is correct
40 Correct 435 ms 46552 KB Output is correct
41 Correct 487 ms 52096 KB Output is correct