oj.uz

Submission #894185

# Submission time Handle Problem Language Result Execution time Memory
894185 2023-12-28T02:28:44 Z box Cats or Dogs (JOI18_catdog) C++17
38 / 100
 157 ms 20444 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define ar array
#define sz(v) int(std::size(v))
using i64 = long long;
 
const int MAXN = 1e5;
const int INF = 1e6;
 
int N;
vector<int> adj[MAXN];
bool has[MAXN][2];
int root[MAXN], depth[MAXN], child[MAXN], parent[MAXN], sz[MAXN];
ar<i64, 2> light[MAXN];
 
using info = ar<ar<int, 2>, 2>;
 
info operator+(const info one, const info two) {
    info me;
    for (int x : {0,1}) for (int y : {0,1})
        me[x][y] = min(INF,
            min(min(one[x][0] + two[0][y], one[x][1] + two[1][y]),
            1 + min(one[x][0] + two[1][y], one[x][1] + two[0][y])));
    // cout << "ONE " << one[0][0] << ' ' << one[0][1] << ' ' << one[1][0] << ' ' << one[1][1] << endl;
    // cout << "TWO " << two[0][0] << ' ' << two[0][1] << ' ' << two[1][0] << ' ' << two[1][1] << endl;
    // cout << "ME " << me[0][0] << ' ' << me[0][1] << ' ' << me[1][0] << ' ' << me[1][1] << endl;
    return me;
}
 
struct segt {
    int l, r;
    segt *lc, *rc;
    info x;
    segt(int l, int r) : l(l), r(r) {
        if (l < r) {
            int m = (l + r) / 2;
            lc = new segt(l, m);
            rc = new segt(m + 1, r);
            x = lc->x + rc->x;
        } else x[1][0] = x[0][1] = INF;
    }
    void upd(int i, const ar<int, 2> &v) {
        if (l == r) x[0][0] = v[0], x[1][1] = v[1];
        else {
            i <= lc->r ? lc->upd(i, v) : rc->upd(i, v);
            x = lc->x + rc->x;
        }
        // cout << l << " " << r << endl;
        // cout << "GOT " << x[0][0] << ' ' << x[0][1] << ' ' << x[1][0] << ' ' << x[1][1] << endl;
    }
    ar<int, 2> pack() {
        return {min(x[0][0], x[0][1]), min(x[1][0], x[1][1])};
    }
} *tree[MAXN];
 
int dfs_sz(int i) {
    int s = 1, x = 0;
    child[i] = -1;
    for (int j : adj[i]) if (parent[i] != j) {
        depth[j] = depth[i] + 1;
        parent[j] = i;
        int y = dfs_sz(j);
        if (y > x) {
            x = y;
            child[i] = j;
        }
        s += y;
    }
    return s;
}
 
void dfs_hvy(int r, int i) {
    // cout << "GOT " << i+1 << " => " << r+1 << endl;
    ++sz[root[i] = r];
    if (~child[i]) dfs_hvy(r, child[i]);
    for (int j : adj[i]) if (parent[i] != j && child[i] != j) dfs_hvy(j, j);
}
 
void initialize(int N, vector<int> A, vector<int> B) {
    for (int h = 0; h < N - 1; h++) {
        auto [i, j] = make_pair(A[h], B[h]);
        i--, j--;
        adj[i].push_back(j);
        adj[j].push_back(i);
    }
    parent[0] = -1;
    dfs_sz(0);
    dfs_hvy(0, 0);
    for (int i = 0; i < N; i++) if (sz[i]) {
        tree[i] = new segt(0, sz[i] - 1);
        // cout << "at root " << i+1 << ", got size " << sz[i] << endl;
    }
}
 
int pul(int i) {
    while (~i) {
        int r = root[i];
        int p = parent[r];
        if (~p) {
            auto v = tree[r]->pack();
            light[p][0] -= min(v[0], v[1] + 1), light[p][1] -= min(v[0] + 1, v[1]);
        }
        tree[r]->upd(depth[i] - depth[r], {int(min(light[i][0], i64(INF))), int(min(light[i][1], i64(INF)))});
        if (~p) {
            auto v = tree[r]->pack();
            light[p][0] += min(v[0], v[1] + 1), light[p][1] += min(v[0] + 1, v[1]);
        }
        i = p;
    }
    auto v = tree[0]->pack();
    return min(v[0], v[1]);
}
 
int cat(int i) {
    i--;
    has[i][0] = 1;
    light[i][0] += INF;
    return pul(i);
}
 
int dog(int i) {
    i--;
    has[i][1] = 1;
    light[i][1] += INF;
    return pul(i);
}
 
int neighbor(int i) {
    i--;
    if (has[i][0]) light[i][0] -= INF, has[i][0] = 0;
    if (has[i][1]) light[i][1] -= INF, has[i][1] = 0;
    return pul(i);
}
 
#ifdef LOCAL
 
int main() {
    int N;
    cin >> N;
    vector<int> A(N-1, 0), B(N-1, 0);
    for (int i = 0; i < N-1; i++) cin >> A[i] >> B[i];
    initialize(N, A, B);
    int Q;
    cin >> Q;
    while (Q--) {
        int t, i;
        cin >> t >> i;
        cout << (t == 1 ? cat : t == 2 ? dog : neighbor)(i) << '\n';
        // for (int i = 0; i < N; i++) cout << light[i][0] << ' ' << light[i][1] << '\n';
        // cout << endl;
    }
}
 
#endif

Subtask #1
8.0 / 8.0

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

Subtask #2
30.0 / 30.0

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

Subtask #3
0 / 62.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 7004 KB Output is correct
2 Correct 1 ms 7004 KB Output is correct
3 Correct 1 ms 7004 KB Output is correct
4 Correct 1 ms 7004 KB Output is correct
5 Correct 2 ms 7004 KB Output is correct
6 Correct 1 ms 7004 KB Output is correct
7 Correct 1 ms 7004 KB Output is correct
8 Correct 1 ms 7004 KB Output is correct
9 Correct 1 ms 7000 KB Output is correct
10 Correct 1 ms 7004 KB Output is correct
11 Correct 1 ms 7004 KB Output is correct
12 Correct 1 ms 7004 KB Output is correct
13 Correct 1 ms 7004 KB Output is correct
14 Correct 1 ms 7004 KB Output is correct
15 Correct 1 ms 7004 KB Output is correct
16 Correct 1 ms 7004 KB Output is correct
17 Correct 2 ms 7004 KB Output is correct
18 Correct 2 ms 7004 KB Output is correct
19 Correct 2 ms 7016 KB Output is correct
20 Correct 2 ms 7000 KB Output is correct
21 Correct 1 ms 7004 KB Output is correct
22 Correct 2 ms 7004 KB Output is correct
23 Correct 2 ms 7004 KB Output is correct
24 Correct 2 ms 7004 KB Output is correct
25 Correct 2 ms 7004 KB Output is correct
26 Correct 1 ms 7004 KB Output is correct
27 Correct 2 ms 7004 KB Output is correct
28 Correct 2 ms 7260 KB Output is correct
29 Correct 2 ms 7300 KB Output is correct
30 Correct 1 ms 7004 KB Output is correct
31 Correct 2 ms 7004 KB Output is correct
32 Correct 1 ms 7004 KB Output is correct
33 Correct 89 ms 14164 KB Output is correct
34 Correct 40 ms 15184 KB Output is correct
35 Correct 80 ms 12224 KB Output is correct
36 Correct 143 ms 18976 KB Output is correct
37 Correct 12 ms 10840 KB Output is correct
38 Correct 139 ms 20304 KB Output is correct
39 Correct 157 ms 20444 KB Output is correct
40 Correct 138 ms 20284 KB Output is correct
41 Correct 138 ms 20288 KB Output is correct
42 Correct 134 ms 20304 KB Output is correct
43 Correct 140 ms 20388 KB Output is correct
44 Correct 135 ms 20288 KB Output is correct
45 Correct 132 ms 20304 KB Output is correct
46 Correct 136 ms 20424 KB Output is correct
47 Correct 133 ms 20432 KB Output is correct
48 Correct 39 ms 14744 KB Output is correct
49 Correct 45 ms 16636 KB Output is correct
50 Incorrect 15 ms 9308 KB Output isn't correct
51 Halted 0 ms 0 KB -