# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1119375 | kiethm07 | Cats or Dogs (JOI18_catdog) | C++11 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define pii pair<int,int>
#define iii pair<int,pii>
#define fi first
#define se second
#define vi vector<int>
#define all(x) x.begin(),x.end()
#define TEXT "a"
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const int inf = 1e9 + 7;
const ld eps = 1e-8;
const double pi = acos(-1);
const int N = 1e5 + 5;
int n;
vector<int> a[N];
int f[N], g[N];
int type[N];
int pa[N];
void dfs(int u,int p){
for (int i = 0; i < a[u].size(); i++){
int v = a[u][i];
if (v == p) continue;
pa[v] = u;
dfs(v,u);
}
}
void brute(int u,int p){
if (type[u] == 0) f[u] = g[u] = 0;
if (type[u] == 1) f[u] = 0, g[u] = inf;
if (type[u] == 2) f[u] = inf, g[u] = 0;
for(int v : a[u]){
if (v == p) continue;
brute(v,p);
if (f[u] != inf) f[u] += min(f[v], g[v] + 1);
if (g[u] != inf) g[u] += min(f[v] + 1, g[v]);
}
}
void initialize(int N,vector<int>& u, vector<int>& v){
n = N;
for (int i = 0; i < n - 1; i++){
a[u[i]].push_back(v[i]);
a[v[i]].push_back(u[i]);
}
dfs(1,-1);
}
int cat(int u){
type[u] = 1;
brute(1,-1);
return min(f[1], g[1]);
}
int dog(int u){
type[u] = 2;
brute(1,-1);
return min(f[1], g[1]);
}
int neighbor(int u){
type[u] = 0;
brute(1,-1);
return min(f[1], g[1]);
}
//
//int main(){
// cin.tie(0) -> sync_with_stdio(0);
// if (fopen(TEXT".inp","r")){
// freopen(TEXT".inp","r",stdin);
// freopen(TEXT".out","w",stdout);
// }
//
// return 0;
//}