oj.uz

Submission #824000

# Submission time Handle Problem Language Result Execution time Memory
824000 2023-08-13T11:19:50 Z tset The Xana coup (BOI21_xanadu) C++14
100 / 100
 102 ms 40756 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long

const int INF = 1e9 + 42;

vector<vector<int> > nxt;
vector<vector<int>> filsDe;
vector<int> pereDe;
vector<vector<vector<int > > > dp;
vector<int > initState;
int occ = 0;

void dfsInit(int nde,int prc )
{   
    pereDe[nde] = prc;
    for(int iV: nxt[nde])
    {
        if(iV != prc)
        {
            filsDe[nde].push_back(iV);
            dfsInit(iV, nde);
        }
    }
}

int fDP(int isParentT, int isMeT, int nde)
{
    if(dp[isParentT][isMeT][nde] != -1)
    {
        return dp[isParentT][isMeT][nde];
    }
    int nbFils = filsDe[nde].size();
    int totT = isParentT + isMeT + initState[nde];
    int ans = INF;
    int sumNoToggle = 0;
    vector<int > diff(nbFils);
    vector<int > diffCumul(nbFils+1);
    for(int iF = 0; iF < nbFils; iF++)
    {
        int costToggled = fDP(isMeT, 1, filsDe[nde][iF]) + 1;
        int costNoToggled = fDP(isMeT, 0, filsDe[nde][iF]);
        sumNoToggle += costNoToggled;
        diff[iF] = costToggled - costNoToggled;
    }
    sort(diff.begin(), diff.end());
    diffCumul[0] = 0;
    for(int i=1; i<= nbFils; i++)
    {
        diffCumul[i] = diffCumul[i-1]+ diff[i-1];
    }

    if(totT %2 == 0)
    {//We need to toggle an even nb of children.
        for(int i = 0; i<= nbFils; i+=2)
        {
            ans = min(ans,  sumNoToggle + diffCumul[i]);
        }
    }
    else
    {
        //We need to toggle an odd nb of children.
        for(int i = 1; i<= nbFils; i+=2)
        {
            ans = min(ans, sumNoToggle + diffCumul[i]);
        }
    }
    if(ans >= INF)
        ans = INF;
    dp[isParentT][isMeT][nde] = ans;
    //printf("%lld\n", occ++);

    return dp[isParentT][isMeT][nde];

}

signed main()
{
    int N;
    scanf("%lld", &N);
    int nbArretes = N-1;
    nxt.resize(N+1);
    filsDe.resize(N+1);
    pereDe.resize(N+1);
    for(int iA = 0; iA < nbArretes; iA++)
    {
        int u, v;
        scanf("%lld%lld", &u, &v);
        nxt[u].push_back(v);
        nxt[v].push_back(u);
    }
    int root = 1;

    dfsInit(root, root);
    initState.resize(N+1);
    for(int iNde = 1; iNde <=N; iNde++)
    {
        scanf("%lld", &initState[iNde]);
    }
    dp.resize(2, vector<vector<int>>(2, vector<int>(N+1, -1)));
    int ans = fDP(0, 0, root);
    ans = min(ans, fDP(0, 1, root) + 1);
    if(ans >= INF)
        printf("impossible\n");
    else 
        printf("%lld", ans);
}

Compilation message

xanadu.cpp: In function 'int main()':
xanadu.cpp:80:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   80 |     scanf("%lld", &N);
      |     ~~~~~^~~~~~~~~~~~
xanadu.cpp:88:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   88 |         scanf("%lld%lld", &u, &v);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~
xanadu.cpp:98:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   98 |         scanf("%lld", &initState[iNde]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 300 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 296 KB Output is correct
5 Correct 0 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 0 ms 300 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 296 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 296 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 296 KB Output is correct
10 Correct 0 ms 296 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 296 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 40588 KB Output is correct
2 Correct 78 ms 39952 KB Output is correct
3 Correct 82 ms 40736 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 40488 KB Output is correct
2 Correct 82 ms 40088 KB Output is correct
3 Correct 90 ms 40756 KB Output is correct
4 Correct 65 ms 16992 KB Output is correct
5 Correct 82 ms 18004 KB Output is correct
6 Correct 75 ms 18252 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 29 ms 6660 KB Output is correct
9 Correct 80 ms 18972 KB Output is correct
10 Correct 77 ms 19260 KB Output is correct
11 Correct 80 ms 19332 KB Output is correct
12 Correct 79 ms 20052 KB Output is correct
13 Correct 81 ms 17728 KB Output is correct
14 Correct 72 ms 18888 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 300 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 296 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 296 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 296 KB Output is correct
10 Correct 0 ms 296 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 296 KB Output is correct
17 Correct 84 ms 40588 KB Output is correct
18 Correct 78 ms 39952 KB Output is correct
19 Correct 82 ms 40736 KB Output is correct
20 Correct 81 ms 40488 KB Output is correct
21 Correct 82 ms 40088 KB Output is correct
22 Correct 90 ms 40756 KB Output is correct
23 Correct 65 ms 16992 KB Output is correct
24 Correct 82 ms 18004 KB Output is correct
25 Correct 75 ms 18252 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 29 ms 6660 KB Output is correct
28 Correct 80 ms 18972 KB Output is correct
29 Correct 77 ms 19260 KB Output is correct
30 Correct 80 ms 19332 KB Output is correct
31 Correct 79 ms 20052 KB Output is correct
32 Correct 81 ms 17728 KB Output is correct
33 Correct 72 ms 18888 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 1 ms 308 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 78 ms 40500 KB Output is correct
46 Correct 75 ms 39984 KB Output is correct
47 Correct 79 ms 40756 KB Output is correct
48 Correct 68 ms 17064 KB Output is correct
49 Correct 81 ms 18636 KB Output is correct
50 Correct 76 ms 19056 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 24 ms 6580 KB Output is correct
53 Correct 80 ms 19020 KB Output is correct
54 Correct 77 ms 19276 KB Output is correct
55 Correct 76 ms 19348 KB Output is correct
56 Correct 78 ms 19932 KB Output is correct
57 Correct 67 ms 17728 KB Output is correct
58 Correct 102 ms 18892 KB Output is correct
59 Correct 23 ms 6520 KB Output is correct
60 Correct 66 ms 17136 KB Output is correct
61 Correct 86 ms 18740 KB Output is correct
62 Correct 80 ms 19108 KB Output is correct
63 Correct 85 ms 19160 KB Output is correct
64 Correct 97 ms 19116 KB Output is correct
65 Correct 63 ms 18508 KB Output is correct
66 Correct 64 ms 18628 KB Output is correct
67 Correct 59 ms 18172 KB Output is correct
68 Correct 59 ms 18248 KB Output is correct
69 Correct 61 ms 18208 KB Output is correct
70 Correct 61 ms 18208 KB Output is correct