oj.uz

Submission #122625

# Submission time Handle Problem Language Result Execution time Memory
122625 2019-06-28T19:53:15 Z WhipppedCream Cats or Dogs (JOI18_catdog) C++17
38 / 100
 3000 ms 7236 KB 
#include "catdog.h"
#include <bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
using namespace std;
#define X first
#define Y second
#define pb push_back
typedef pair<int, int> ii;
typedef long long ll;

const int maxn = 1e5+5;

vector<int> adj[maxn];
int dp[3][maxn];
int st[maxn];
int n;

void compute(int u = 1, int p = 0)
{
	dp[1][u] = dp[2][u] = 0;
	for(int v : adj[u]) 
	{
		if(v == p) continue;
		compute(v, u);
		dp[1][u] += min(dp[1][v], 1+dp[2][v]);
		dp[2][u] += min(dp[2][v], 1+dp[1][v]);
	}
	if(st[u] == 1) dp[2][u] = 1e9;
	if(st[u] == 2) dp[1][u] = 1e9;
}

void initialize(int N, vector<int> A, vector<int> B)
{
	n = N;
	for(int i = 0; i< n-1; i++)
	{
		adj[A[i]].pb(B[i]);
		adj[B[i]].pb(A[i]);
	}
}

int cat(int u)
{
	st[u] = 1;
	compute();
	return min(dp[1][1], dp[2][1]);
}

int dog(int u)
{
	st[u] = 2;
	compute();
	return min(dp[1][1], dp[2][1]);

}

int neighbor(int u)
{
	st[u] = 0;
	compute();
	return min(dp[1][1], dp[2][1]);

}

Subtask #1
8.0 / 8.0

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

Subtask #2
30.0 / 30.0

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

Subtask #3
0 / 62.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2808 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 4 ms 2676 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 4 ms 2680 KB Output is correct
6 Correct 4 ms 2680 KB Output is correct
7 Correct 3 ms 2680 KB Output is correct
8 Correct 4 ms 2680 KB Output is correct
9 Correct 3 ms 2680 KB Output is correct
10 Correct 4 ms 2680 KB Output is correct
11 Correct 4 ms 2680 KB Output is correct
12 Correct 4 ms 2680 KB Output is correct
13 Correct 4 ms 2680 KB Output is correct
14 Correct 4 ms 2680 KB Output is correct
15 Correct 4 ms 2680 KB Output is correct
16 Correct 4 ms 2680 KB Output is correct
17 Correct 12 ms 2680 KB Output is correct
18 Correct 14 ms 2680 KB Output is correct
19 Correct 9 ms 2808 KB Output is correct
20 Correct 4 ms 2680 KB Output is correct
21 Correct 5 ms 2680 KB Output is correct
22 Correct 5 ms 2680 KB Output is correct
23 Correct 16 ms 2680 KB Output is correct
24 Correct 13 ms 2680 KB Output is correct
25 Correct 8 ms 2680 KB Output is correct
26 Correct 6 ms 2728 KB Output is correct
27 Correct 5 ms 2680 KB Output is correct
28 Correct 7 ms 2936 KB Output is correct
29 Correct 17 ms 2808 KB Output is correct
30 Correct 6 ms 2680 KB Output is correct
31 Correct 5 ms 2680 KB Output is correct
32 Correct 7 ms 2680 KB Output is correct
33 Execution timed out 3064 ms 7236 KB Time limit exceeded
34 Halted 0 ms 0 KB -