oj.uz

Submission #388121

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

using namespace std;

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

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

void dfs(int x, int p)
{
       if(val[x]!=2)dp[x][ !val[x] ] = MX ;
       for(auto u : adj[x]){
              if(u == p)continue; 
              dfs(u , x) ;
              dp[x][0] += min(dp[u][0] ,dp[u][1] + 1) ; 
              dp[x][1] += min(dp[u][1] ,dp[u][0] + 1) ;
       }
}

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

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

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

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

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 204 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 204 KB Output is correct
13 Correct 0 ms 332 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
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 204 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 204 KB Output is correct
13 Correct 0 ms 332 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 10 ms 332 KB Output is correct
18 Runtime error 1 ms 460 KB Execution killed with signal 11
19 Halted 0 ms 0 KB -

Subtask #3
0 / 62.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 204 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 204 KB Output is correct
13 Correct 0 ms 332 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 10 ms 332 KB Output is correct
18 Runtime error 1 ms 460 KB Execution killed with signal 11
19 Halted 0 ms 0 KB -