oj.uz

Submission #23153

# Submission time Handle Problem Language Result Execution time Memory
23153 2017-05-03T17:06:04 Z themastermind Beads and wires (APIO14_beads) C++14
100 / 100
 201 ms 22640 KB 
#include <bits/stdc++.h>
#define forinc(i,a,b) for(int i = a, _key = b; i <= _key; ++i)
#define fordec(i,a,b) for(int i = a, _key = b; i >= _key; --i)
#define fori(i,n) for(int i = 0, _key = n; i < _key; ++i)
#define ford(i,n) for(int i = n - 1; i >= 0; --i)
#define forvct(i,v) for(int i = 0, _key = v.size(); i < _key; ++i)
#define sqr(x) ((ll)x) * (x)
#define task "beads"
#define st first
#define nd second
#define m_p make_pair
#define m_t make_tuple
#define p_b push_back
#define p_f push_front
#define pp_b pop_back
#define pp_f pop_front
#define sn string::npos
#define heap priority_queue
#define ll long long
#define db double
#define str string
#define nn 200010

using namespace std;

const ll oo = 100000000000000007LL;

int n;
ll f[nn][4];
vector<pair<int,int> > adj[nn];

void enter()
{
    cin >> n;
    forinc(i,2,n)
    {
        int u, v, w;
        cin >> u >> v >> w;
        adj[u].p_b(m_p(v,w));
        adj[v].p_b(m_p(u,w));
    }
}

void visit(const int &u, const int &x)
{
    f[u][0] = 0;
    f[u][1] = 0;
    f[u][2] = -oo;
    f[u][3] = -oo;
    forvct(j,adj[u])
    {
        int v = adj[u][j].st, w = adj[u][j].nd;
        if (v == x) continue;
        visit(v,u);
        ll tmp = max(f[v][0],f[v][2] + w),
            t0 = f[u][0] + tmp,
            t1 = max(max(max(f[u][1] + tmp,f[u][0] + max(f[v][1],f[v][3] + w)),f[u][2] + max(f[v][0],f[v][1]) + w),f[u][3] + f[v][0] + w),
            t2 = max(f[u][2] + tmp,f[u][0] + f[v][0] + w),
            t3 = max(f[u][3] + tmp,f[u][0] + f[v][1] + w);
        f[u][0] = t0;
        f[u][1] = t1;
        f[u][2] = t2;
        f[u][3] = t3;
    }
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    //srand(time(NULL));
    //freopen(task".inp","r",stdin);
    //freopen(task".out","w",stdout);
    enter();
    int root = 1;
    visit(root,0);
    cout << max(f[root][0],f[root][1]) << "\n";
}

Subtask #1
13.0 / 13.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4992 KB Output is correct
2 Correct 6 ms 5120 KB Output is correct
3 Correct 6 ms 5120 KB Output is correct
4 Correct 6 ms 5120 KB Output is correct
5 Correct 6 ms 5120 KB Output is correct
6 Correct 6 ms 4992 KB Output is correct
7 Correct 5 ms 4992 KB Output is correct
8 Correct 6 ms 4992 KB Output is correct
9 Correct 6 ms 4992 KB Output is correct
10 Correct 6 ms 5164 KB Output is correct
11 Correct 6 ms 5120 KB Output is correct
12 Correct 7 ms 5120 KB Output is correct
13 Correct 6 ms 5120 KB Output is correct
14 Correct 6 ms 5120 KB Output is correct
15 Correct 6 ms 5120 KB Output is correct
16 Correct 6 ms 5120 KB Output is correct
17 Correct 6 ms 5120 KB Output is correct
18 Correct 6 ms 5120 KB Output is correct
19 Correct 5 ms 5120 KB Output is correct
20 Correct 6 ms 5120 KB Output is correct
21 Correct 6 ms 4992 KB Output is correct
22 Correct 5 ms 5120 KB Output is correct
23 Correct 7 ms 5376 KB Output is correct
24 Correct 8 ms 5376 KB Output is correct
25 Correct 8 ms 5376 KB Output is correct
26 Correct 10 ms 5760 KB Output is correct
27 Correct 10 ms 5760 KB Output is correct
28 Correct 9 ms 5760 KB Output is correct
29 Correct 10 ms 5760 KB Output is correct
30 Correct 10 ms 5760 KB Output is correct
31 Correct 11 ms 6144 KB Output is correct

Subtask #4
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4992 KB Output is correct
2 Correct 6 ms 5120 KB Output is correct
3 Correct 6 ms 5120 KB Output is correct
4 Correct 6 ms 5120 KB Output is correct
5 Correct 6 ms 5120 KB Output is correct
6 Correct 6 ms 4992 KB Output is correct
7 Correct 5 ms 4992 KB Output is correct
8 Correct 6 ms 4992 KB Output is correct
9 Correct 6 ms 4992 KB Output is correct
10 Correct 6 ms 5164 KB Output is correct
11 Correct 6 ms 5120 KB Output is correct
12 Correct 7 ms 5120 KB Output is correct
13 Correct 6 ms 5120 KB Output is correct
14 Correct 6 ms 5120 KB Output is correct
15 Correct 6 ms 5120 KB Output is correct
16 Correct 6 ms 5120 KB Output is correct
17 Correct 6 ms 5120 KB Output is correct
18 Correct 6 ms 5120 KB Output is correct
19 Correct 5 ms 5120 KB Output is correct
20 Correct 6 ms 5120 KB Output is correct
21 Correct 6 ms 4992 KB Output is correct
22 Correct 5 ms 5120 KB Output is correct
23 Correct 7 ms 5376 KB Output is correct
24 Correct 8 ms 5376 KB Output is correct
25 Correct 8 ms 5376 KB Output is correct
26 Correct 10 ms 5760 KB Output is correct
27 Correct 10 ms 5760 KB Output is correct
28 Correct 9 ms 5760 KB Output is correct
29 Correct 10 ms 5760 KB Output is correct
30 Correct 10 ms 5760 KB Output is correct
31 Correct 11 ms 6144 KB Output is correct
32 Correct 32 ms 8416 KB Output is correct
33 Correct 32 ms 8524 KB Output is correct
34 Correct 34 ms 8448 KB Output is correct
35 Correct 193 ms 18808 KB Output is correct
36 Correct 201 ms 18828 KB Output is correct
37 Correct 184 ms 18808 KB Output is correct
38 Correct 140 ms 19144 KB Output is correct
39 Correct 145 ms 19160 KB Output is correct
40 Correct 140 ms 18984 KB Output is correct
41 Correct 178 ms 22640 KB Output is correct