oj.uz

Submission #884118

# Submission time Handle Problem Language Result Execution time Memory
884118 2023-12-06T16:00:13 Z vjudge1 Cats or Dogs (JOI18_catdog) C++17
38 / 100
 3000 ms 19024 KB 
#include "catdog.h"
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")

using namespace std;

const int nmax = 1e5 + 5;
const int inf = 1e6 + 5;

namespace Tree {
    vector<int> g[nmax];

    int area[nmax];
    int pch[nmax], lastpoz[nmax], p[nmax];
    int pin[nmax], pout[nmax], inp = 1;

    int nodepoz(int node) { return pin[node];}

    namespace Init {
        void preinit(int node, int f) {
            p[node] = f;
            area[node] = 1;
            for(auto x : g[node]) {
                if(x == f) continue;
                preinit(x, node);
                area[node] += area[x];
            }
            return;
        }

        void init(int node, int f) {
            lastpoz[pch[node]] = inp;
            pin[node] = inp++;
            int mx = -1;
            for(auto x : g[node]) {
                if(x == f) continue;
                mx = mx == -1 || area[mx] < area[x]? x : mx;
            }
            if(mx == -1) {pout[node] = inp - 1; return; }
            pch[mx] = pch[node];
            init(mx, node);

            for(auto x : g[node]) {
               if(x == f || x == mx) continue;
               pch[x] = x;
               init(x, node);
            }
        }
    }

    struct Mat {
        int mat[2][2];
        Mat() { mat[0][0] = mat[1][1] = 0; mat[0][1] = mat[1][0] = inf; }
        Mat(int a, int b) { mat[0][0] = a; mat[1][1] = b; mat[0][1] = mat[1][0] = inf; }
        Mat operator +(const Mat& x) const {
            if(mat[0][0] == 0 && mat[1][1] == 0 && mat[0][1] == inf && mat[1][0] == inf) return x;
            if(x.mat[0][0] == 0 && x.mat[1][1] == 0 && x.mat[0][1] == inf && x.mat[1][0] == inf) return *this;
//            if(x == ok) return *this;
            Mat rez;
            rez.mat[0][0] = rez.mat[1][1] = inf;

            for(int L = 0; L < 2; L++) {
                for(int M1 = 0; M1 < 2; M1++) {
                    for(int M2 = 0; M2 < 2; M2++) {
                        for(int R = 0; R < 2; R++) {
                            rez.mat[L][R] = min(rez.mat[L][R], mat[L][M1] + x.mat[M2][R] + (M1 ^ M2));
                        }
                    }
                }
            }

            return rez;
        }
    };

    #define Node Mat
    namespace aint {
        Node aint[nmax * 4];
        int n;
        void init(int _n) {
            n = _n;
//            aint.resize(n * 2 + 2);

        }

        void push(int node, int L) {;}
        void upd(int p, Node x, int node, int cl, int cr) {
            if(p < cl || cr < p) return;
            if(cl == cr) { aint[node] = x; return; }
            int mid = cl + cr >> 1;
            push(node, (mid - cl + 1) * 2);
            upd(p, x, node * 2, cl, mid);
            upd(p, x, node * 2 + 1, mid + 1, cr);
            aint[node] = aint[node * 2] + aint[node * 2 + 1];
        }
        Node query(int l, int r, int node, int cl, int cr) {
            if(r < cl || cr < l) return Node();
            if(l <= cl && cr <= r) return aint[node];
            int mid = cl + cr >> 1;
            push(node, (mid - cl + 1) * 2);
            return query(l, r, node * 2, cl, mid) + query(l, r, node * 2 + 1, mid + 1, cr);
        }

        void upd(int p, Node x) { upd(p, x, 1, 1, n); }
        Node query(int l, int r) { return query(l, r, 1, 1, n); }


    };
    #undef Node



    struct SimpleDir {
        int red, blue;
        SimpleDir(int a = 0, int b = 0): red(a), blue(b) {;}
        void operator +=(const SimpleDir& x) {  *this = SimpleDir(red + min(x.red, x.blue + 1), blue + min(x.blue, x.red + 1)); }
        void operator -=(const SimpleDir& x) {  *this = SimpleDir(red - min(x.red, x.blue + 1), blue - min(x.blue, x.red + 1)); }
    };

    SimpleDir overson[nmax], mine[nmax];

    int color[nmax];

    Mat red(int node) {
        Mat curr(overson[node].red, inf);
        return curr;
    }

    Mat blue(int node) {
        Mat curr(inf, overson[node].blue);
        return curr;
    }

    Mat gol(int node) {
        Mat curr(overson[node].red, overson[node].blue);
        return curr;
    }


    void init(int n) {
        aint::init(n);
//        init(0, 0);
    }

    int upd(int node) {
        int P = pin[node], K = pin[pch[node]];
        int father = pch[node];
        if(color[P] == 0)
            aint::upd(P, gol(P));
        else if(color[P] == 1)
            aint::upd(P, red(P));
        else
            aint::upd(P, blue(P));

        if(father == 0) { auto R = aint::query(K, lastpoz[father]); return min({R.mat[0][0],R.mat[0][1],R.mat[1][0],R.mat[1][1]});}

        overson[pin[p[father]]] -= mine[K];
        auto R = aint::query(K, lastpoz[father]);
        mine[K] = SimpleDir(min(R.mat[0][0], R.mat[0][1]), min(R.mat[1][0], R.mat[1][1]));
        if(color[K] == 1) mine[K].blue = inf;
        else if(color[K] == 2) mine[K].red = inf;

        overson[pin[p[father]]] += mine[K];

        return upd(p[node]);
    }
}

void initialize(int n, std::vector<int> A, std::vector<int> B) {
    for(int i = 0; i < n - 1; i++) {
        Tree::g[--A[i]].emplace_back(--B[i]);
        Tree::g[B[i]].emplace_back(A[i]);
    }

    Tree::Init::preinit(0, 0);
    Tree::pch[0];
    Tree::Init::init(0, 0);

    Tree::init(n);

    return;
}

int cat(int v) {
    Tree::color[Tree::pin[--v]] = 1;
  return Tree::upd(v);
}

int dog(int v) {
    Tree::color[Tree::pin[--v]] = 2;
  return Tree::upd(v);
}

int neighbor(int v) {
    Tree::color[Tree::pin[--v]] = 0;
  return Tree::upd(v);
}

Compilation message

catdog.cpp: In function 'void Tree::aint::upd(int, Tree::Mat, int, int, int)':
catdog.cpp:90:26: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   90 |             int mid = cl + cr >> 1;
      |                       ~~~^~~~
catdog.cpp: In function 'Tree::Mat Tree::aint::query(int, int, int, int, int)':
catdog.cpp:99:26: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   99 |             int mid = cl + cr >> 1;
      |                       ~~~^~~~
catdog.cpp: In function 'void initialize(int, std::vector<int>, std::vector<int>)':
catdog.cpp:176:16: warning: statement has no effect [-Wunused-value]
  176 |     Tree::pch[0];
      |     ~~~~~~~~~~~^

Subtask #1
8.0 / 8.0

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

Subtask #2
30.0 / 30.0

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

Subtask #3
0 / 62.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 13148 KB Output is correct
2 Correct 3 ms 13148 KB Output is correct
3 Correct 3 ms 13148 KB Output is correct
4 Correct 3 ms 13148 KB Output is correct
5 Correct 3 ms 13148 KB Output is correct
6 Correct 3 ms 13148 KB Output is correct
7 Correct 3 ms 13148 KB Output is correct
8 Correct 3 ms 13148 KB Output is correct
9 Correct 3 ms 13144 KB Output is correct
10 Correct 3 ms 13148 KB Output is correct
11 Correct 3 ms 13148 KB Output is correct
12 Correct 3 ms 13148 KB Output is correct
13 Correct 3 ms 13148 KB Output is correct
14 Correct 3 ms 13144 KB Output is correct
15 Correct 3 ms 13148 KB Output is correct
16 Correct 3 ms 13148 KB Output is correct
17 Correct 5 ms 13148 KB Output is correct
18 Correct 5 ms 13232 KB Output is correct
19 Correct 4 ms 13144 KB Output is correct
20 Correct 3 ms 13144 KB Output is correct
21 Correct 4 ms 13148 KB Output is correct
22 Correct 4 ms 13148 KB Output is correct
23 Correct 6 ms 13148 KB Output is correct
24 Correct 5 ms 13168 KB Output is correct
25 Correct 4 ms 13144 KB Output is correct
26 Correct 3 ms 13148 KB Output is correct
27 Correct 5 ms 13148 KB Output is correct
28 Correct 5 ms 13144 KB Output is correct
29 Correct 4 ms 13148 KB Output is correct
30 Correct 3 ms 13144 KB Output is correct
31 Correct 3 ms 13148 KB Output is correct
32 Correct 3 ms 13148 KB Output is correct
33 Correct 1331 ms 16444 KB Output is correct
34 Correct 303 ms 16208 KB Output is correct
35 Correct 782 ms 15880 KB Output is correct
36 Correct 2309 ms 18528 KB Output is correct
37 Correct 14 ms 14624 KB Output is correct
38 Correct 2671 ms 19012 KB Output is correct
39 Correct 2667 ms 19000 KB Output is correct
40 Correct 2850 ms 19012 KB Output is correct
41 Correct 2977 ms 19020 KB Output is correct
42 Correct 2028 ms 19016 KB Output is correct
43 Correct 1882 ms 19004 KB Output is correct
44 Correct 1590 ms 19020 KB Output is correct
45 Correct 2100 ms 19024 KB Output is correct
46 Correct 2101 ms 19008 KB Output is correct
47 Correct 2456 ms 18996 KB Output is correct
48 Correct 98 ms 17564 KB Output is correct
49 Correct 121 ms 18340 KB Output is correct
50 Correct 40 ms 14424 KB Output is correct
51 Correct 41 ms 15216 KB Output is correct
52 Correct 18 ms 14300 KB Output is correct
53 Correct 982 ms 18168 KB Output is correct
54 Correct 623 ms 15572 KB Output is correct
55 Correct 1623 ms 17408 KB Output is correct
56 Correct 1138 ms 16280 KB Output is correct
57 Correct 1160 ms 18000 KB Output is correct
58 Correct 17 ms 15316 KB Output is correct
59 Correct 38 ms 15192 KB Output is correct
60 Correct 82 ms 17884 KB Output is correct
61 Correct 92 ms 17980 KB Output is correct
62 Correct 53 ms 16848 KB Output is correct
63 Execution timed out 3080 ms 18268 KB Time limit exceeded
64 Halted 0 ms 0 KB -