oj.uz

Submission #746524

# Submission time Handle Problem Language Result Execution time Memory
746524 2023-05-22T16:20:59 Z GrindMachine Cats or Dogs (JOI18_catdog) C++17
38 / 100
 3000 ms 8808 KB 
// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "catdog.h"

vector<ll> adj[N];
vector<ll> a(N); // 0 = none, 1 = cat, 2 = dog

void initialize(int n, std::vector<int> A, std::vector<int> B) {
    rep(i,n){
        ll u = A[i], v = B[i];
        adj[u].pb(v), adj[v].pb(u);
    }
}

ll dp[N][3];

void dfs(int u, int p){
    rep(j,3) dp[u][j] = 0;

    if(a[u] == 0){

    }
    else if(a[u] == 1){
        dp[u][0] = dp[u][2] = inf2;
    }
    else{
        dp[u][0] = dp[u][1] = inf2;
    }

    trav(v,adj[u]){
        if(v == p) conts;
        dfs(v, u);

        if(a[u] == 0){
            dp[u][0] += min({dp[v][0], dp[v][1] + 1, dp[v][2] + 1});
        }

        if(a[u] != 2){
            dp[u][1] += min({dp[v][0], dp[v][1], dp[v][2] + 1});
        }

        if(a[u] != 1){
            dp[u][2] += min({dp[v][0], dp[v][1] + 1, dp[v][2]});
        }
    }
}

ll get_ans(){
    dfs(1, -1);
    ll mn = inf2;
    rep(j,3) amin(mn, dp[1][j]);
    return mn;
}

int cat(int v) {
    a[v] = 1;
    return get_ans();
}

int dog(int v) {
    a[v] = 2;
    return get_ans();
}

int neighbor(int v) {
    a[v] = 0;
    return get_ans();
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3412 KB Output is correct
2 Correct 2 ms 3412 KB Output is correct
3 Correct 2 ms 3452 KB Output is correct
4 Correct 2 ms 3412 KB Output is correct
5 Correct 2 ms 3412 KB Output is correct
6 Correct 2 ms 3412 KB Output is correct
7 Correct 2 ms 3412 KB Output is correct
8 Correct 2 ms 3412 KB Output is correct
9 Correct 2 ms 3532 KB Output is correct
10 Correct 2 ms 3456 KB Output is correct
11 Correct 2 ms 3412 KB Output is correct
12 Correct 2 ms 3412 KB Output is correct
13 Correct 2 ms 3456 KB Output is correct
14 Correct 2 ms 3448 KB Output is correct
15 Correct 2 ms 3412 KB Output is correct
16 Correct 2 ms 3456 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3412 KB Output is correct
2 Correct 2 ms 3412 KB Output is correct
3 Correct 2 ms 3452 KB Output is correct
4 Correct 2 ms 3412 KB Output is correct
5 Correct 2 ms 3412 KB Output is correct
6 Correct 2 ms 3412 KB Output is correct
7 Correct 2 ms 3412 KB Output is correct
8 Correct 2 ms 3412 KB Output is correct
9 Correct 2 ms 3532 KB Output is correct
10 Correct 2 ms 3456 KB Output is correct
11 Correct 2 ms 3412 KB Output is correct
12 Correct 2 ms 3412 KB Output is correct
13 Correct 2 ms 3456 KB Output is correct
14 Correct 2 ms 3448 KB Output is correct
15 Correct 2 ms 3412 KB Output is correct
16 Correct 2 ms 3456 KB Output is correct
17 Correct 11 ms 3524 KB Output is correct
18 Correct 14 ms 3412 KB Output is correct
19 Correct 8 ms 3412 KB Output is correct
20 Correct 2 ms 3412 KB Output is correct
21 Correct 4 ms 3412 KB Output is correct
22 Correct 5 ms 3412 KB Output is correct
23 Correct 16 ms 3536 KB Output is correct
24 Correct 15 ms 3412 KB Output is correct
25 Correct 8 ms 3412 KB Output is correct
26 Correct 6 ms 3412 KB Output is correct
27 Correct 4 ms 3412 KB Output is correct
28 Correct 7 ms 3540 KB Output is correct
29 Correct 19 ms 3580 KB Output is correct
30 Correct 4 ms 3412 KB Output is correct
31 Correct 3 ms 3412 KB Output is correct
32 Correct 5 ms 3412 KB Output is correct

Subtask #3
0 / 62.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3412 KB Output is correct
2 Correct 2 ms 3412 KB Output is correct
3 Correct 2 ms 3452 KB Output is correct
4 Correct 2 ms 3412 KB Output is correct
5 Correct 2 ms 3412 KB Output is correct
6 Correct 2 ms 3412 KB Output is correct
7 Correct 2 ms 3412 KB Output is correct
8 Correct 2 ms 3412 KB Output is correct
9 Correct 2 ms 3532 KB Output is correct
10 Correct 2 ms 3456 KB Output is correct
11 Correct 2 ms 3412 KB Output is correct
12 Correct 2 ms 3412 KB Output is correct
13 Correct 2 ms 3456 KB Output is correct
14 Correct 2 ms 3448 KB Output is correct
15 Correct 2 ms 3412 KB Output is correct
16 Correct 2 ms 3456 KB Output is correct
17 Correct 11 ms 3524 KB Output is correct
18 Correct 14 ms 3412 KB Output is correct
19 Correct 8 ms 3412 KB Output is correct
20 Correct 2 ms 3412 KB Output is correct
21 Correct 4 ms 3412 KB Output is correct
22 Correct 5 ms 3412 KB Output is correct
23 Correct 16 ms 3536 KB Output is correct
24 Correct 15 ms 3412 KB Output is correct
25 Correct 8 ms 3412 KB Output is correct
26 Correct 6 ms 3412 KB Output is correct
27 Correct 4 ms 3412 KB Output is correct
28 Correct 7 ms 3540 KB Output is correct
29 Correct 19 ms 3580 KB Output is correct
30 Correct 4 ms 3412 KB Output is correct
31 Correct 3 ms 3412 KB Output is correct
32 Correct 5 ms 3412 KB Output is correct
33 Execution timed out 3077 ms 8808 KB Time limit exceeded
34 Halted 0 ms 0 KB -