oj.uz

Submission #884060

# Submission time Handle Problem Language Result Execution time Memory
884060 2023-12-06T15:14:50 Z vjudge1 Cats or Dogs (JOI18_catdog) C++17
38 / 100
 3000 ms 16636 KB 
#include "catdog.h"
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops")

using namespace std;


template<typename Node>
struct AINT {
    vector<Node> aint;
    int n;
    Node ID;
    void init(int _n, Node id) {
        ID = id;
        n = _n;
        aint.resize(n * 2 + 5, ID);

    }

    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 + 1, cl, mid);
        upd(p, x, node + (mid - cl + 1) * 2, mid + 1, cr);
        aint[node] = aint[node + 1] + aint[node + (mid - cl + 1) * 2];
//        cerr << cl << ' ' << cr << " :: \t" << aint[node].mat[0][0] << ' ' << aint[node].mat[1][1] << '\n'
    }
    Node query(int l, int r, int node, int cl, int cr) {
        if(r < cl || cr < l) return ID;
        if(l <= cl && cr <= r) return aint[node];
        int mid = cl + cr >> 1;
        push(node, (mid - cl + 1) * 2);
        return query(l, r, node + 1, cl, mid) + query(l, r, node + (mid - cl + 1) * 2, 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); }


    void push(int node, int L) {;}
};

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() { for(int i = 0; i < 2; i++) for(int j = 0; j < 2; j++) mat[i][j] = inf; }
        Mat operator +(const Mat& x) const {
            Mat rez;

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

            return rez;
        }
    };

    AINT<Mat> aint;

    struct SimpleDir {
        int red, blue;
        SimpleDir(int a = 0, int b = 0): red(a), blue(b) {;}
        SimpleDir operator +=(SimpleDir& x) { return *this = SimpleDir(red + min(x.red, x.blue + 1), blue + min(x.blue, x.red + 1)); }
        SimpleDir operator -=(SimpleDir& x) { return *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;
        curr.mat[0][0] = overson[node].red;
        return curr;
    }

    Mat blue(int node) {
        Mat curr;
        curr.mat[1][1] = overson[node].blue;
        return curr;
    }

    Mat gol(int node) {
        Mat curr;
        curr.mat[0][0] = overson[node].red;
        curr.mat[1][1] = overson[node].blue;
        return curr;
    }

    void init(int node, int f) {
        aint.upd(nodepoz(node), gol(node));
        for(auto x : g[node])
            if(x != f)
                init(x, node);
        return;
    }

    void init(int n) {
        Mat ok;
        ok.mat[0][0] = 0;
        ok.mat[1][1] = 0;
        aint.init(n, ok);
//        init(0, 0);
    }

    int upd(int node) {
        int father = pch[node];
        aint.upd(nodepoz(node), color[node] == 0? gol(node) : color[node] == 1? red(node) : blue(node));

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

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

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

        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[--v] = 1;
  return Tree::upd(v);
}

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

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

Compilation message

catdog.cpp: In function 'void initialize(int, std::vector<int>, std::vector<int>)':
catdog.cpp:180:16: warning: statement has no effect [-Wunused-value]
  180 |     Tree::pch[0];
      |     ~~~~~~~~~~~^
catdog.cpp: In instantiation of 'void AINT<Node>::upd(int, Node, int, int, int) [with Node = Tree::Mat]':
catdog.cpp:38:34:   required from 'void AINT<Node>::upd(int, Node) [with Node = Tree::Mat]'
catdog.cpp:140:42:   required from here
catdog.cpp:23:22: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   23 |         int mid = cl + cr >> 1;
      |                   ~~~^~~~
catdog.cpp: In instantiation of 'Node AINT<Node>::query(int, int, int, int, int) [with Node = Tree::Mat]':
catdog.cpp:39:44:   required from 'Node AINT<Node>::query(int, int) [with Node = Tree::Mat]'
catdog.cpp:159:75:   required from here
catdog.cpp:33:22: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   33 |         int mid = cl + cr >> 1;
      |                   ~~~^~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6748 KB Output is correct
2 Correct 1 ms 6912 KB Output is correct
3 Correct 2 ms 6792 KB Output is correct
4 Correct 2 ms 6748 KB Output is correct
5 Correct 2 ms 6748 KB Output is correct
6 Correct 1 ms 6748 KB Output is correct
7 Correct 2 ms 6836 KB Output is correct
8 Correct 1 ms 6748 KB Output is correct
9 Correct 2 ms 6748 KB Output is correct
10 Correct 2 ms 6748 KB Output is correct
11 Correct 1 ms 6748 KB Output is correct
12 Correct 1 ms 6748 KB Output is correct
13 Correct 2 ms 6748 KB Output is correct
14 Correct 2 ms 6748 KB Output is correct
15 Correct 1 ms 6748 KB Output is correct
16 Correct 2 ms 6748 KB Output is correct
17 Correct 4 ms 7004 KB Output is correct
18 Correct 3 ms 6916 KB Output is correct
19 Correct 3 ms 7004 KB Output is correct
20 Correct 2 ms 6748 KB Output is correct
21 Correct 2 ms 6832 KB Output is correct
22 Correct 2 ms 6748 KB Output is correct
23 Correct 4 ms 7000 KB Output is correct
24 Correct 4 ms 7004 KB Output is correct
25 Correct 3 ms 6748 KB Output is correct
26 Correct 2 ms 6744 KB Output is correct
27 Correct 3 ms 6744 KB Output is correct
28 Correct 3 ms 7004 KB Output is correct
29 Correct 3 ms 7004 KB Output is correct
30 Correct 2 ms 6744 KB Output is correct
31 Correct 2 ms 7004 KB Output is correct
32 Correct 2 ms 6748 KB Output is correct

Subtask #3
0 / 62.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6748 KB Output is correct
2 Correct 1 ms 6912 KB Output is correct
3 Correct 2 ms 6792 KB Output is correct
4 Correct 2 ms 6748 KB Output is correct
5 Correct 2 ms 6748 KB Output is correct
6 Correct 1 ms 6748 KB Output is correct
7 Correct 2 ms 6836 KB Output is correct
8 Correct 1 ms 6748 KB Output is correct
9 Correct 2 ms 6748 KB Output is correct
10 Correct 2 ms 6748 KB Output is correct
11 Correct 1 ms 6748 KB Output is correct
12 Correct 1 ms 6748 KB Output is correct
13 Correct 2 ms 6748 KB Output is correct
14 Correct 2 ms 6748 KB Output is correct
15 Correct 1 ms 6748 KB Output is correct
16 Correct 2 ms 6748 KB Output is correct
17 Correct 4 ms 7004 KB Output is correct
18 Correct 3 ms 6916 KB Output is correct
19 Correct 3 ms 7004 KB Output is correct
20 Correct 2 ms 6748 KB Output is correct
21 Correct 2 ms 6832 KB Output is correct
22 Correct 2 ms 6748 KB Output is correct
23 Correct 4 ms 7000 KB Output is correct
24 Correct 4 ms 7004 KB Output is correct
25 Correct 3 ms 6748 KB Output is correct
26 Correct 2 ms 6744 KB Output is correct
27 Correct 3 ms 6744 KB Output is correct
28 Correct 3 ms 7004 KB Output is correct
29 Correct 3 ms 7004 KB Output is correct
30 Correct 2 ms 6744 KB Output is correct
31 Correct 2 ms 7004 KB Output is correct
32 Correct 2 ms 6748 KB Output is correct
33 Correct 1323 ms 11776 KB Output is correct
34 Correct 312 ms 12116 KB Output is correct
35 Correct 785 ms 10656 KB Output is correct
36 Correct 2244 ms 15064 KB Output is correct
37 Correct 14 ms 9304 KB Output is correct
38 Correct 2628 ms 15868 KB Output is correct
39 Correct 2574 ms 15876 KB Output is correct
40 Correct 2753 ms 15892 KB Output is correct
41 Correct 2957 ms 15884 KB Output is correct
42 Correct 2053 ms 15888 KB Output is correct
43 Correct 1830 ms 15880 KB Output is correct
44 Correct 1542 ms 15728 KB Output is correct
45 Correct 2029 ms 15888 KB Output is correct
46 Correct 2053 ms 15876 KB Output is correct
47 Correct 2506 ms 15876 KB Output is correct
48 Correct 90 ms 13464 KB Output is correct
49 Correct 100 ms 16636 KB Output is correct
50 Correct 40 ms 9164 KB Output is correct
51 Correct 41 ms 10712 KB Output is correct
52 Correct 23 ms 8908 KB Output is correct
53 Correct 1000 ms 16212 KB Output is correct
54 Correct 679 ms 11228 KB Output is correct
55 Correct 1738 ms 14756 KB Output is correct
56 Correct 1218 ms 12208 KB Output is correct
57 Correct 1360 ms 16172 KB Output is correct
58 Correct 17 ms 10708 KB Output is correct
59 Correct 37 ms 10424 KB Output is correct
60 Correct 82 ms 15572 KB Output is correct
61 Correct 89 ms 16072 KB Output is correct
62 Correct 55 ms 14032 KB Output is correct
63 Execution timed out 3092 ms 14416 KB Time limit exceeded
64 Halted 0 ms 0 KB -