#include<bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef int ll;
typedef long double ld;
typedef pair<ll,ll> pll;
const ll MOD=1e9+7;
const ll MOD2=998244353;
const ll N=4e5+5;
const ll K=350;
const ld pi=acos(-1);
const long long INF=(1LL<<28);
#define SQ(i) ((i)*(i))
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define setp setprecision
#define lwb lower_bound
#define SZ(_a) (ll)_a.size()
long long dp[N][3],col[N];
vector<ll> v[N];
void DFS(ll nd,ll pa){
dp[nd][1]=dp[nd][2]=0;
for(auto i:v[nd]){
if(i==pa)continue;
DFS(i,nd);
dp[nd][1]+=min(dp[i][1],dp[i][2]+1);
dp[nd][2]+=min(dp[i][2],dp[i][1]+1);
}
if(col[nd]){dp[nd][3-col[nd]]=INF;}
}
void initialize(ll n,vector<ll> a,vector<ll> b){
REP(i,n-1)v[a[i]].pb(b[i]),v[b[i]].pb(a[i]);
}
ll cat(ll id){
col[id]=1;
DFS(1,0);
return min(dp[1][1],dp[1][2]);
}
ll dog(ll id){
col[id]=2;
DFS(1,0);
return min(dp[1][1],dp[1][2]);
}
ll neighbor(ll id){
col[id]=0;
DFS(1,0);
return min(dp[1][1],dp[1][2]);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
7 ms |
9708 KB |
Output is correct |
2 |
Correct |
7 ms |
9708 KB |
Output is correct |
3 |
Correct |
7 ms |
9708 KB |
Output is correct |
4 |
Correct |
7 ms |
9708 KB |
Output is correct |
5 |
Correct |
7 ms |
9708 KB |
Output is correct |
6 |
Correct |
7 ms |
9708 KB |
Output is correct |
7 |
Correct |
7 ms |
9708 KB |
Output is correct |
8 |
Correct |
7 ms |
9708 KB |
Output is correct |
9 |
Correct |
7 ms |
9708 KB |
Output is correct |
10 |
Correct |
7 ms |
9708 KB |
Output is correct |
11 |
Correct |
7 ms |
9708 KB |
Output is correct |
12 |
Correct |
7 ms |
9708 KB |
Output is correct |
13 |
Correct |
7 ms |
9708 KB |
Output is correct |
14 |
Correct |
7 ms |
9728 KB |
Output is correct |
15 |
Correct |
7 ms |
9708 KB |
Output is correct |
16 |
Correct |
7 ms |
9708 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
7 ms |
9708 KB |
Output is correct |
2 |
Correct |
7 ms |
9708 KB |
Output is correct |
3 |
Correct |
7 ms |
9708 KB |
Output is correct |
4 |
Correct |
7 ms |
9708 KB |
Output is correct |
5 |
Correct |
7 ms |
9708 KB |
Output is correct |
6 |
Correct |
7 ms |
9708 KB |
Output is correct |
7 |
Correct |
7 ms |
9708 KB |
Output is correct |
8 |
Correct |
7 ms |
9708 KB |
Output is correct |
9 |
Correct |
7 ms |
9708 KB |
Output is correct |
10 |
Correct |
7 ms |
9708 KB |
Output is correct |
11 |
Correct |
7 ms |
9708 KB |
Output is correct |
12 |
Correct |
7 ms |
9708 KB |
Output is correct |
13 |
Correct |
7 ms |
9708 KB |
Output is correct |
14 |
Correct |
7 ms |
9728 KB |
Output is correct |
15 |
Correct |
7 ms |
9708 KB |
Output is correct |
16 |
Correct |
7 ms |
9708 KB |
Output is correct |
17 |
Correct |
17 ms |
9836 KB |
Output is correct |
18 |
Correct |
19 ms |
9836 KB |
Output is correct |
19 |
Correct |
14 ms |
9836 KB |
Output is correct |
20 |
Correct |
7 ms |
9708 KB |
Output is correct |
21 |
Correct |
9 ms |
9708 KB |
Output is correct |
22 |
Correct |
9 ms |
9728 KB |
Output is correct |
23 |
Correct |
22 ms |
9836 KB |
Output is correct |
24 |
Correct |
19 ms |
9836 KB |
Output is correct |
25 |
Correct |
13 ms |
9708 KB |
Output is correct |
26 |
Correct |
10 ms |
9708 KB |
Output is correct |
27 |
Correct |
8 ms |
9708 KB |
Output is correct |
28 |
Correct |
9 ms |
9836 KB |
Output is correct |
29 |
Correct |
21 ms |
9836 KB |
Output is correct |
30 |
Correct |
9 ms |
9708 KB |
Output is correct |
31 |
Correct |
8 ms |
9836 KB |
Output is correct |
32 |
Correct |
10 ms |
9708 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
7 ms |
9708 KB |
Output is correct |
2 |
Correct |
7 ms |
9708 KB |
Output is correct |
3 |
Correct |
7 ms |
9708 KB |
Output is correct |
4 |
Correct |
7 ms |
9708 KB |
Output is correct |
5 |
Correct |
7 ms |
9708 KB |
Output is correct |
6 |
Correct |
7 ms |
9708 KB |
Output is correct |
7 |
Correct |
7 ms |
9708 KB |
Output is correct |
8 |
Correct |
7 ms |
9708 KB |
Output is correct |
9 |
Correct |
7 ms |
9708 KB |
Output is correct |
10 |
Correct |
7 ms |
9708 KB |
Output is correct |
11 |
Correct |
7 ms |
9708 KB |
Output is correct |
12 |
Correct |
7 ms |
9708 KB |
Output is correct |
13 |
Correct |
7 ms |
9708 KB |
Output is correct |
14 |
Correct |
7 ms |
9728 KB |
Output is correct |
15 |
Correct |
7 ms |
9708 KB |
Output is correct |
16 |
Correct |
7 ms |
9708 KB |
Output is correct |
17 |
Correct |
17 ms |
9836 KB |
Output is correct |
18 |
Correct |
19 ms |
9836 KB |
Output is correct |
19 |
Correct |
14 ms |
9836 KB |
Output is correct |
20 |
Correct |
7 ms |
9708 KB |
Output is correct |
21 |
Correct |
9 ms |
9708 KB |
Output is correct |
22 |
Correct |
9 ms |
9728 KB |
Output is correct |
23 |
Correct |
22 ms |
9836 KB |
Output is correct |
24 |
Correct |
19 ms |
9836 KB |
Output is correct |
25 |
Correct |
13 ms |
9708 KB |
Output is correct |
26 |
Correct |
10 ms |
9708 KB |
Output is correct |
27 |
Correct |
8 ms |
9708 KB |
Output is correct |
28 |
Correct |
9 ms |
9836 KB |
Output is correct |
29 |
Correct |
21 ms |
9836 KB |
Output is correct |
30 |
Correct |
9 ms |
9708 KB |
Output is correct |
31 |
Correct |
8 ms |
9836 KB |
Output is correct |
32 |
Correct |
10 ms |
9708 KB |
Output is correct |
33 |
Execution timed out |
3077 ms |
15416 KB |
Time limit exceeded |
34 |
Halted |
0 ms |
0 KB |
- |