oj.uz

Submission #388129

# Submission time Handle Problem Language Result Execution time Memory
388129 2021-04-10T07:56:12 Z mohamedsobhi777 Cats or Dogs (JOI18_catdog) C++14
38 / 100
 40 ms 3212 KB 
#include <bits/stdc++.h>
#include "catdog.h"

using namespace std;

int x;
const int MX = 1000 + 7;
int val[MX], par[MX];
vector<int> adj[MX];
int dp[MX][2];

void pull(int u)
{
       dp[u][0] = dp[u][1] = 0 ; 
       if (val[u] != 2)
              dp[u][!val[u]] = MX;
       for(auto v : adj[u]){
              if(v == par[u])continue;
              for(int j = 0 ;j <2; ++ j){
                     dp[u][j] += min(dp[v][j] , dp[v][!j] + 1) ; 
              }
       }
}

void dfz(int x, int p)
{
       if (val[x] != 2)
              dp[x][!val[x]] = MX;
       par[x] = p;
       for (auto u : adj[x])
       {
              if (u == p)
                     continue;
              dfz(u, x);
       }
       pull(x) ;
}

void initialize(int N, std::vector<int> A, std::vector<int> B)
{
       x = N;
       for (int i = 0; i + 1 < N; ++i)
       {
              adj[A[i]].push_back(B[i]);
              adj[B[i]].push_back(A[i]);
       }
       fill(val + 1, val + N + 1, 2);
       dfz(1, 1);
}

void touch(int x)
{
       while (x != 1)
       {
              pull(x);
              x = par[x];
       }
       pull(1) ;
}

int solve()
{
       return min(dp[1][0], dp[1][1]);
}

int cat(int v)
{
       val[v] = 0;
       touch(v);
       return solve();
}

int dog(int v)
{
       val[v] = 1;
       touch(v);
       return solve();
}

int neighbor(int v)
{
       val[v] = 2;
       touch(v);
       return solve();
}

Subtask #1
8.0 / 8.0

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

Subtask #2
30.0 / 30.0

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

Subtask #3
0 / 62.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 2 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 5 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Runtime error 40 ms 3212 KB Execution killed with signal 11
34 Halted 0 ms 0 KB -