oj.uz

Submission #468487

# Submission time Handle Problem Language Result Execution time Memory
468487 2021-08-28T13:47:35 Z kderylo The Xana coup (BOI21_xanadu) C++17
100 / 100
 124 ms 27072 KB 
#include <iostream>
#include <vector>
#include <set>
using namespace std;
const int stala=1e5+10;
vector<int>wektor[stala];
set<int>s;
int pom[stala];
int dp[stala][2][2][2]; //poprzednie obecny ojciec
bool o[stala][2][2][2];
int wierzcholek,war,war2,suma,ile_zapalonych;
void dfs(int k,int p)
{
    for(int i=0; i<(int)wektor[k].size(); i++)
    {
        if(wektor[k][i]!=p)
        {
            dfs(wektor[k][i],k);
        }
    }
    for(int i=0; i<=1; i++)
    {
        for(int j=0; j<=1; j++)
        {
            for(int z=0; z<=1; z++)
            {
                suma=0;
                ile_zapalonych=0;
                bool xyz=true;
                if((i+j+z)%2!=pom[k])
                {
                    continue;
                }
                for(int a=0; a<(int)wektor[k].size(); a++)
                {
                    war=1e9;
                    war2=1e9;
                    if(wektor[k][a]!=p)
                    {
                        wierzcholek=wektor[k][a];
                        if(o[wierzcholek][0][0][j]==1)
                        {
                            war=min(war,dp[wierzcholek][0][0][j]);
                        }
                        if(o[wierzcholek][1][0][j]==1)
                        {
                            war=min(war,dp[wierzcholek][1][0][j]);
                        }
                        if(o[wierzcholek][0][1][j]==1)
                        {
                            war2=min(war2,dp[wierzcholek][0][1][j]);
                        }
                        if(o[wierzcholek][1][1][j]==1)
                        {
                            war2=min(war2,dp[wierzcholek][1][1][j]);
                        }
                        if(war==1e9&&war2==1e9)
                        {
                            xyz=false;
                        }
                        else if(war!=1e9&&war2==1e9)
                        {
                            suma+=war;
                        }
                        else if(war==1e9&&war2!=1e9)
                        {
                            ile_zapalonych++;
                            suma+=war2;
                        }
                        else
                        {
                            suma+=war;
                            s.insert(war2-war);
                        }
                    }
                }
                if(xyz==false)
                {
                    s.clear();
                    continue;
                }
                xyz=false;
                dp[k][i][j][z]=1e9;
                if(ile_zapalonych%2==i)
                {
                    xyz=true;
                    dp[k][i][j][z]=min(dp[k][i][j][z],suma);
                }
                while(!s.empty())
                {
                    suma+=*(s.begin());
                    s.erase(s.begin());
                    ile_zapalonych++;
                    if(ile_zapalonych%2==i)
                    {
                        xyz=true;
                        dp[k][i][j][z]=min(dp[k][i][j][z],suma);
                    }
                }
                if(xyz==true)
                {
                    o[k][i][j][z]=1;
                    dp[k][i][j][z]+=j;
                }
            }
        }
    }
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int ile;
    cin>>ile;
    for(int i=1; i<=ile-1; i++)
    {
        int a,b;
        cin>>a>>b;
        wektor[a].push_back(b);
        wektor[b].push_back(a);
    }
    for(int i=1; i<=ile; i++)
    {
        cin>>pom[i];
    }
    dfs(1,0);
    int res=1e9;
    for(int i=0;i<=1;i++)
    {
        for(int j=0;j<=1;j++)
        {
            if(o[1][i][j][0]==1)
            {
                res=min(res,dp[1][i][j][0]);
            }
        }
    }
    if(res==1e9)
    {
        cout<<"impossible";
    }
    else
    {
        cout<<res;
    }

    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2600 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2600 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 2 ms 2636 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 2 ms 2636 KB Output is correct
9 Correct 2 ms 2636 KB Output is correct
10 Correct 2 ms 2636 KB Output is correct
11 Correct 2 ms 2636 KB Output is correct
12 Correct 2 ms 2636 KB Output is correct
13 Correct 2 ms 2668 KB Output is correct
14 Correct 2 ms 2636 KB Output is correct
15 Correct 3 ms 2636 KB Output is correct
16 Correct 2 ms 2636 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 82 ms 26928 KB Output is correct
2 Correct 81 ms 26564 KB Output is correct
3 Correct 87 ms 27028 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 82 ms 26948 KB Output is correct
2 Correct 83 ms 26668 KB Output is correct
3 Correct 84 ms 27072 KB Output is correct
4 Correct 85 ms 10408 KB Output is correct
5 Correct 104 ms 11264 KB Output is correct
6 Correct 107 ms 11336 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 28 ms 5616 KB Output is correct
9 Correct 91 ms 11376 KB Output is correct
10 Correct 94 ms 11580 KB Output is correct
11 Correct 106 ms 12472 KB Output is correct
12 Correct 99 ms 12816 KB Output is correct
13 Correct 80 ms 10864 KB Output is correct
14 Correct 94 ms 11364 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2600 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 2 ms 2636 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 2 ms 2636 KB Output is correct
9 Correct 2 ms 2636 KB Output is correct
10 Correct 2 ms 2636 KB Output is correct
11 Correct 2 ms 2636 KB Output is correct
12 Correct 2 ms 2636 KB Output is correct
13 Correct 2 ms 2668 KB Output is correct
14 Correct 2 ms 2636 KB Output is correct
15 Correct 3 ms 2636 KB Output is correct
16 Correct 2 ms 2636 KB Output is correct
17 Correct 82 ms 26928 KB Output is correct
18 Correct 81 ms 26564 KB Output is correct
19 Correct 87 ms 27028 KB Output is correct
20 Correct 82 ms 26948 KB Output is correct
21 Correct 83 ms 26668 KB Output is correct
22 Correct 84 ms 27072 KB Output is correct
23 Correct 85 ms 10408 KB Output is correct
24 Correct 104 ms 11264 KB Output is correct
25 Correct 107 ms 11336 KB Output is correct
26 Correct 2 ms 2636 KB Output is correct
27 Correct 28 ms 5616 KB Output is correct
28 Correct 91 ms 11376 KB Output is correct
29 Correct 94 ms 11580 KB Output is correct
30 Correct 106 ms 12472 KB Output is correct
31 Correct 99 ms 12816 KB Output is correct
32 Correct 80 ms 10864 KB Output is correct
33 Correct 94 ms 11364 KB Output is correct
34 Correct 2 ms 2636 KB Output is correct
35 Correct 2 ms 2636 KB Output is correct
36 Correct 2 ms 2636 KB Output is correct
37 Correct 2 ms 2636 KB Output is correct
38 Correct 3 ms 2636 KB Output is correct
39 Correct 2 ms 2636 KB Output is correct
40 Correct 2 ms 2636 KB Output is correct
41 Correct 2 ms 2636 KB Output is correct
42 Correct 2 ms 2672 KB Output is correct
43 Correct 2 ms 2636 KB Output is correct
44 Correct 2 ms 2588 KB Output is correct
45 Correct 107 ms 26956 KB Output is correct
46 Correct 113 ms 26668 KB Output is correct
47 Correct 86 ms 27060 KB Output is correct
48 Correct 82 ms 10608 KB Output is correct
49 Correct 98 ms 11172 KB Output is correct
50 Correct 95 ms 11516 KB Output is correct
51 Correct 2 ms 2636 KB Output is correct
52 Correct 25 ms 5616 KB Output is correct
53 Correct 89 ms 11364 KB Output is correct
54 Correct 102 ms 11680 KB Output is correct
55 Correct 88 ms 12444 KB Output is correct
56 Correct 97 ms 12888 KB Output is correct
57 Correct 73 ms 10808 KB Output is correct
58 Correct 81 ms 11436 KB Output is correct
59 Correct 36 ms 5632 KB Output is correct
60 Correct 84 ms 10684 KB Output is correct
61 Correct 91 ms 11384 KB Output is correct
62 Correct 124 ms 11476 KB Output is correct
63 Correct 102 ms 11596 KB Output is correct
64 Correct 100 ms 11460 KB Output is correct
65 Correct 84 ms 11972 KB Output is correct
66 Correct 75 ms 11892 KB Output is correct
67 Correct 68 ms 11832 KB Output is correct
68 Correct 68 ms 11720 KB Output is correct
69 Correct 71 ms 11780 KB Output is correct
70 Correct 69 ms 11844 KB Output is correct