oj.uz

Submission #570487

# Submission time Handle Problem Language Result Execution time Memory
570487 2022-05-30T07:45:00 Z groshi Beads and wires (APIO14_beads) C++17
100 / 100
 183 ms 32608 KB 
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
#define int long long
int inf=1e9;
struct wi{
    vector<int> Q;
    long long dp[4]={0,0,0,0};///0->srodek i zost, 1->srodek i gora, 2->pocz, 3-> kon
    long long do_ojca=0;
}*w;
void dfs(int x,int ojc)
{
    if(w[x].Q.size()==2 && ojc!=0)
        return;
    long long a=-inf,b=-inf,c=-inf,d=-inf,e=-inf;
    int gdzie1,gdzie2,skad1,skad2;
    long long suma=0;
    for(int i=0;i<w[x].Q.size();i+=2)
    {
        int pom=w[x].Q[i];
        int koszt=w[x].Q[i+1];
        if(pom==ojc)
            continue;
        w[pom].do_ojca=koszt;
        dfs(pom,x);
        long long teraz=max(w[pom].dp[0],w[pom].dp[2]);
        suma+=teraz;
        long long srodek=max(w[pom].dp[1],w[pom].dp[3])-teraz;
        if(srodek>e)
            e=srodek;
        long long bez=w[pom].dp[1]+koszt-teraz;
        if(bez>a)
        {
            gdzie2=gdzie1;
            b=a;
            gdzie1=pom;
            a=bez;
        }
        else if(bez>b)
        {
            gdzie2=pom;
            b=bez;
        }
        long long bez_sr=w[pom].dp[0]+koszt-teraz;
        if(bez_sr>c)
        {
            skad2=skad1;
            d=c;
            skad1=pom;
            c=bez_sr;
        }
        else if(bez_sr>d)
        {
            skad2=pom;
            d=bez_sr;
        }
    }
    w[x].dp[0]=suma;
    w[x].dp[1]=suma+max((long long)0,e);
    w[x].dp[1]=max(w[x].dp[1],suma+c+d);
    if(gdzie1!=skad1)
        w[x].dp[1]=max(w[x].dp[1],suma+a+c);
    else{
        w[x].dp[1]=max(w[x].dp[1],suma+a+d);
        w[x].dp[1]=max(w[x].dp[1],suma+b+c);
    }
    w[x].dp[2]=suma+c+w[x].do_ojca;
    w[x].dp[3]=suma+a+w[x].do_ojca;
}
int32_t main()
{
    cin.tie(0);
    cout.tie(0);
    ios_base::sync_with_stdio(0);
    int n,x,y,z;
    cin>>n;
    w=new wi[n+3];
    for(int i=1;i<n;i++)
    {
        cin>>x>>y>>z;
        w[x].Q.push_back(y);
        w[x].Q.push_back(z);
        w[y].Q.push_back(x);
        w[y].Q.push_back(z);
    }
    dfs(1,0);
    //for(int i=1;i<=n;i++)
        //cout<<i<<": "<<w[i].dp[0]<<" "<<w[i].dp[1]<<" "<<w[i].dp[2]<<" "<<w[i].dp[3]<<"\n";
    //cout<<w[1].dp[0]<<" "<<w[1].dp[1]<<" "<<w[1].dp[2]<<" "<<w[1].dp[3]<<"\n";
    cout<<max(w[1].dp[0],w[1].dp[1]);
    return 0;
}

Compilation message

beads.cpp: In function 'void dfs(long long int, long long int)':
beads.cpp:19:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |     for(int i=0;i<w[x].Q.size();i+=2)
      |                 ~^~~~~~~~~~~~~~
beads.cpp:17:16: warning: variable 'gdzie2' set but not used [-Wunused-but-set-variable]
   17 |     int gdzie1,gdzie2,skad1,skad2;
      |                ^~~~~~
beads.cpp:17:29: warning: variable 'skad2' set but not used [-Wunused-but-set-variable]
   17 |     int gdzie1,gdzie2,skad1,skad2;
      |                             ^~~~~
beads.cpp:62:5: warning: 'skad1' may be used uninitialized in this function [-Wmaybe-uninitialized]
   62 |     if(gdzie1!=skad1)
      |     ^~
beads.cpp:62:5: warning: 'gdzie1' may be used uninitialized in this function [-Wmaybe-uninitialized]

Subtask #1
13.0 / 13.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 1 ms 320 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 316 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 320 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 4 ms 852 KB Output is correct
24 Correct 4 ms 972 KB Output is correct
25 Correct 3 ms 852 KB Output is correct
26 Correct 7 ms 1620 KB Output is correct
27 Correct 5 ms 1612 KB Output is correct
28 Correct 4 ms 1620 KB Output is correct
29 Correct 6 ms 1480 KB Output is correct
30 Correct 5 ms 1552 KB Output is correct
31 Correct 6 ms 2124 KB Output is correct

Subtask #4
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 1 ms 320 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 316 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 320 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 4 ms 852 KB Output is correct
24 Correct 4 ms 972 KB Output is correct
25 Correct 3 ms 852 KB Output is correct
26 Correct 7 ms 1620 KB Output is correct
27 Correct 5 ms 1612 KB Output is correct
28 Correct 4 ms 1620 KB Output is correct
29 Correct 6 ms 1480 KB Output is correct
30 Correct 5 ms 1552 KB Output is correct
31 Correct 6 ms 2124 KB Output is correct
32 Correct 36 ms 6732 KB Output is correct
33 Correct 36 ms 6780 KB Output is correct
34 Correct 39 ms 6768 KB Output is correct
35 Correct 175 ms 26572 KB Output is correct
36 Correct 183 ms 26660 KB Output is correct
37 Correct 176 ms 26620 KB Output is correct
38 Correct 141 ms 25900 KB Output is correct
39 Correct 134 ms 25760 KB Output is correct
40 Correct 119 ms 25780 KB Output is correct
41 Correct 160 ms 32608 KB Output is correct