oj.uz

Submission #305489

# Submission time Handle Problem Language Result Execution time Memory
305489 2020-09-23T10:30:16 Z MarcoMeijer Beads and wires (APIO14_beads) C++14
57 / 100
 480 ms 18040 KB 
#include <bits/stdc++.h>
using namespace std;
 
// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e18
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
#define sz size()
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
 
// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }
 
// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const vector<T>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class T> void OUT(const vector<T>& x) {RE(i,x.size()) OUT(i==0?"":" ",x[i]);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }
 
//===================//
//  Added libraries  //
//===================//
 
//===================//
//end added libraries//
//===================//
 
void program();
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    program();
}
 
 
//===================//
//   begin program   //
//===================//
 
const int MX = 3e5+5;

int n, m=0;
int a[MX], b[MX], c[MX];
int rev[MX];
vi adj[MX];
int dp[MX][2];
int sm[MX], skip[MX];

int getSum(int e) {
    int u = b[e], p = a[e];
    if(sm[u] == -1) {
        sm[u] = 0;
        FOR(v,adj[u]) if(b[v]!=p) sm[u] += max(dp[v][1]+c[v], dp[v][0]);
        skip[u] = p;
        return sm[u];
    } else if(skip[u] != -1 && skip[u] != p) {
        FOR(v,adj[u]) if(b[v]==skip[u]) sm[u] += max(dp[v][1]+c[v], dp[v][0]);
        skip[u] = -1;
    }
    int res = sm[u];
    if(p != -1 && skip[u] != p) res -= max(dp[rev[e]][1]+c[rev[e]], dp[rev[e]][0]);
    return res;
}
void dfsDP(int e) {
    int u=b[e], p=a[e];
    FOR(v,adj[u]) if(b[v]!=p && dp[v][0] == -1) dfsDP(v);

    int sm = getSum(e);
    dp[e][0] = sm;

    dp[e][1] = -1e9;
    FOR(v,adj[u]) if(b[v]!=p)
        dp[e][1] = max(dp[e][1], sm - max(dp[v][1]+c[v], dp[v][0]) + dp[v][0] + c[v]);
}

void program() {
    IN(n);
    RE1(i,n) {
        a[m]=-1;
        b[m]=i;
        c[m]=0;
        m++;
    }
    RE(i,n-1) {
        int u, v, w;
        IN(u,v,w);
        a[m]=u, b[m]=v, c[m]=w;
        rev[m] = m+1;
        adj[u].pb(m++);
        a[m]=v, b[m]=u, c[m]=w;
        rev[m] = m-1;
        adj[v].pb(m++);
    }

    int bst = 0;
    RE(i,m) dp[i][0] = -1;
    RE1(i,n) sm[i] = -1;
    RE(i,n) {
        dfsDP(i);
        bst = max(bst, dp[i][0]);
    }
    OUTL(bst);
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 7424 KB Output is correct
2 Correct 8 ms 7424 KB Output is correct
3 Correct 8 ms 7424 KB Output is correct
4 Correct 7 ms 7424 KB Output is correct
5 Correct 8 ms 7424 KB Output is correct
6 Correct 6 ms 7424 KB Output is correct
7 Correct 6 ms 7424 KB Output is correct
8 Correct 7 ms 7424 KB Output is correct
9 Correct 8 ms 7424 KB Output is correct
10 Correct 7 ms 7424 KB Output is correct
11 Correct 7 ms 7424 KB Output is correct
12 Correct 6 ms 7424 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 7424 KB Output is correct
2 Correct 8 ms 7424 KB Output is correct
3 Correct 8 ms 7424 KB Output is correct
4 Correct 7 ms 7424 KB Output is correct
5 Correct 8 ms 7424 KB Output is correct
6 Correct 6 ms 7424 KB Output is correct
7 Correct 6 ms 7424 KB Output is correct
8 Correct 7 ms 7424 KB Output is correct
9 Correct 8 ms 7424 KB Output is correct
10 Correct 7 ms 7424 KB Output is correct
11 Correct 7 ms 7424 KB Output is correct
12 Correct 6 ms 7424 KB Output is correct
13 Correct 10 ms 7552 KB Output is correct
14 Correct 8 ms 7424 KB Output is correct
15 Correct 6 ms 7424 KB Output is correct
16 Correct 6 ms 7424 KB Output is correct
17 Correct 6 ms 7424 KB Output is correct
18 Correct 8 ms 7424 KB Output is correct
19 Correct 8 ms 7424 KB Output is correct
20 Correct 6 ms 7424 KB Output is correct
21 Correct 6 ms 7424 KB Output is correct
22 Correct 6 ms 7424 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 7424 KB Output is correct
2 Correct 8 ms 7424 KB Output is correct
3 Correct 8 ms 7424 KB Output is correct
4 Correct 7 ms 7424 KB Output is correct
5 Correct 8 ms 7424 KB Output is correct
6 Correct 6 ms 7424 KB Output is correct
7 Correct 6 ms 7424 KB Output is correct
8 Correct 7 ms 7424 KB Output is correct
9 Correct 8 ms 7424 KB Output is correct
10 Correct 7 ms 7424 KB Output is correct
11 Correct 7 ms 7424 KB Output is correct
12 Correct 6 ms 7424 KB Output is correct
13 Correct 10 ms 7552 KB Output is correct
14 Correct 8 ms 7424 KB Output is correct
15 Correct 6 ms 7424 KB Output is correct
16 Correct 6 ms 7424 KB Output is correct
17 Correct 6 ms 7424 KB Output is correct
18 Correct 8 ms 7424 KB Output is correct
19 Correct 8 ms 7424 KB Output is correct
20 Correct 6 ms 7424 KB Output is correct
21 Correct 6 ms 7424 KB Output is correct
22 Correct 6 ms 7424 KB Output is correct
23 Correct 11 ms 7936 KB Output is correct
24 Correct 12 ms 7936 KB Output is correct
25 Correct 11 ms 7936 KB Output is correct
26 Correct 13 ms 8448 KB Output is correct
27 Correct 14 ms 8576 KB Output is correct
28 Correct 480 ms 8824 KB Output is correct
29 Correct 220 ms 8724 KB Output is correct
30 Correct 183 ms 8824 KB Output is correct
31 Correct 103 ms 8960 KB Output is correct

Subtask #4
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 7424 KB Output is correct
2 Correct 8 ms 7424 KB Output is correct
3 Correct 8 ms 7424 KB Output is correct
4 Correct 7 ms 7424 KB Output is correct
5 Correct 8 ms 7424 KB Output is correct
6 Correct 6 ms 7424 KB Output is correct
7 Correct 6 ms 7424 KB Output is correct
8 Correct 7 ms 7424 KB Output is correct
9 Correct 8 ms 7424 KB Output is correct
10 Correct 7 ms 7424 KB Output is correct
11 Correct 7 ms 7424 KB Output is correct
12 Correct 6 ms 7424 KB Output is correct
13 Correct 10 ms 7552 KB Output is correct
14 Correct 8 ms 7424 KB Output is correct
15 Correct 6 ms 7424 KB Output is correct
16 Correct 6 ms 7424 KB Output is correct
17 Correct 6 ms 7424 KB Output is correct
18 Correct 8 ms 7424 KB Output is correct
19 Correct 8 ms 7424 KB Output is correct
20 Correct 6 ms 7424 KB Output is correct
21 Correct 6 ms 7424 KB Output is correct
22 Correct 6 ms 7424 KB Output is correct
23 Correct 11 ms 7936 KB Output is correct
24 Correct 12 ms 7936 KB Output is correct
25 Correct 11 ms 7936 KB Output is correct
26 Correct 13 ms 8448 KB Output is correct
27 Correct 14 ms 8576 KB Output is correct
28 Correct 480 ms 8824 KB Output is correct
29 Correct 220 ms 8724 KB Output is correct
30 Correct 183 ms 8824 KB Output is correct
31 Correct 103 ms 8960 KB Output is correct
32 Correct 86 ms 13560 KB Output is correct
33 Correct 75 ms 13560 KB Output is correct
34 Correct 63 ms 13616 KB Output is correct
35 Incorrect 65 ms 18040 KB Output isn't correct
36 Halted 0 ms 0 KB -