Submission #674268

#	Time	Username	Problem	Language	Result	Execution time	Memory
674268		tibinyte	Cats or Dogs (JOI18_catdog)	C++14	38 / 100	3064 ms	8484 KiB

catdog

#include <bits/stdc++.h>
#include "catdog.h"
using namespace std;
const int inf = 1e5;
vector<int> a;
vector<vector<int>> g;
vector<vector<int>> dp;
void initialize(int N, vector<int> A, vector<int> B)
{
  g = vector<vector<int>>(N + 1);
  dp = vector<vector<int>>(N + 1, vector<int>(2));
  a = vector<int>(N + 1, 2);
  for (int i = 0; i <= N - 2; ++i)
  {
    g[A[i]].push_back(B[i]);
    g[B[i]].push_back(A[i]);
  }
}
void dfs(int node, int parent)
{
  for (int i = 0; i < 2; ++i)
  {
    dp[node][i] = 0;
  }
  for (auto i : g[node])
  {
    if (i != parent)
    {
      dfs(i, node);
      for (int j = 0; j < 2; ++j)
      {
        dp[node][j] += min(dp[i][j], dp[i][j ^ 1] + 1);
      }
    }
  }
  if (a[node] != 2)
  {
    dp[node][a[node]] = inf;
  }
}
int cat(int v)
{
  a[v] = 0;
  dfs(1, 0);
  return min(dp[1][0], dp[1][1]);
}

int dog(int v)
{
  a[v] = 1;
  dfs(1, 0);
  return min(dp[1][0], dp[1][1]);
}

int neighbor(int v)
{
  a[v] = 2;
  dfs(1, 0);
  return min(dp[1][0], dp[1][1]);
}

• Subtask 1: 8 / 8
• Subtask 2: 30 / 30
• Subtask 3: 0 / 62