oj.uz

Submission #954051

# Submission time Handle Problem Language Result Execution time Memory
954051 2024-03-27T07:13:33 Z Pring Sprinkler (JOI22_sprinkler) C++17
3 / 100
 370 ms 22272 KB 
#include <bits/stdc++.h>
using namespace std;

#ifdef MIKU
string dbmc = "\033[1;38;2;57;197;187m", dbrs = "\033[0m";
#define debug(x...) cout << dbmc << "[" << #x << "]: ", dout(x)
void dout() { cout << dbrs << endl; }
template <typename T, typename ...U>
void dout(T t, U ...u) { cout << t << (sizeof...(u) ? ", " : ""); dout(u...); }
#else
#define debug(...) 39
#endif

#define int long long
#define fs first
#define sc second
#define mp make_pair
#define FOR(i, j, k) for (int i = j, Z = k; i < Z; i++)
typedef pair<int, int> pii;

const int MXN = 200005, MXD = 40;
int n, q, mod, h[MXN];
vector<int> edge[MXN];


namespace SB1 {

    void DFS(int id, int par, int rst, int w) {
        h[id] = h[id] * w % mod;
        if (rst == 0) return;
        for (auto &i : edge[id]) {
            if (i == par) continue;
            DFS(i, id, rst - 1, w);
        }
    }

    void solve() {
        cin >> q;
        while (q--) {
            int t, x, d, w;
            cin >> t;
            if (t == 1) {
                cin >> x >> d >> w;
                DFS(x, 0, d, w);
            } else {
                cin >> x;
                cout << h[x] << '\n';
            }
        }
    }
}

namespace SB4 {
    int p[MXN];
    int d[MXN];

    void DFS(int id, int par) {
        p[id] = par;
        for (auto &i : edge[id]) {
            if (i == par) continue;
            DFS(i, id);
        }
    }

    void modify(int x, int r) {
        int now = x;
        for (int i = r; i >= 0; i--) {
            d[now] = max(d[now], i);
            if (p[now] == 0) return;
            now = p[now];
        }
    }

    bool alive(int x) {
        int now = x;
        FOR(i, 0, 41) {
            if (d[now] > i) return false;
            if (p[now] == 0) return true;
            now = p[now];
        }
        return true;
    }

    void solve() {
        DFS(1, 0);
        fill(d + 1, d + n + 1, -1);
        cin >> q;
        while (q--) {
            int t, x, d, w;
            cin >> t;
            if (t == 1) {
                cin >> x >> d >> w;
                modify(x, d);
            } else {
                cin >> x;
                cout << (alive(x) ? h[x] : 0) << '\n';
            }
        }
    }
}

void miku() {
    int x, y;
    cin >> n >> mod;
    FOR(i, 1, n) {
        cin >> x >> y;
        edge[x].push_back(y);
        edge[y].push_back(x);
    }
    FOR(i, 1, n + 1) cin >> h[i];
    if (n <= 1000) SB1::solve();
    else SB4::solve();
}

int32_t main() {
    cin.tie(0) -> sync_with_stdio(false);
    cin.exceptions(cin.failbit);
    miku();
    return 0;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 2 ms 6488 KB Output is correct
5 Correct 3 ms 6492 KB Output is correct
6 Correct 5 ms 6492 KB Output is correct
7 Correct 5 ms 6692 KB Output is correct
8 Correct 6 ms 6628 KB Output is correct
9 Correct 2 ms 6492 KB Output is correct
10 Correct 2 ms 6492 KB Output is correct
11 Correct 3 ms 6636 KB Output is correct
12 Correct 2 ms 6492 KB Output is correct
13 Correct 2 ms 6580 KB Output is correct
14 Correct 2 ms 6588 KB Output is correct
15 Correct 2 ms 6748 KB Output is correct
16 Correct 2 ms 6492 KB Output is correct
17 Correct 1 ms 6500 KB Output is correct
18 Correct 2 ms 6492 KB Output is correct
19 Correct 1 ms 6620 KB Output is correct
20 Correct 2 ms 6488 KB Output is correct
21 Correct 2 ms 6624 KB Output is correct
22 Correct 2 ms 6492 KB Output is correct
23 Correct 2 ms 6492 KB Output is correct
24 Correct 1 ms 6492 KB Output is correct
25 Correct 2 ms 6624 KB Output is correct
26 Correct 2 ms 6492 KB Output is correct
27 Correct 2 ms 6492 KB Output is correct
28 Correct 2 ms 6492 KB Output is correct

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Incorrect 370 ms 20252 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Incorrect 370 ms 20252 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Incorrect 212 ms 22272 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6492 KB Output is correct
2 Incorrect 228 ms 20412 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 2 ms 6488 KB Output is correct
5 Correct 3 ms 6492 KB Output is correct
6 Correct 5 ms 6492 KB Output is correct
7 Correct 5 ms 6692 KB Output is correct
8 Correct 6 ms 6628 KB Output is correct
9 Correct 2 ms 6492 KB Output is correct
10 Correct 2 ms 6492 KB Output is correct
11 Correct 3 ms 6636 KB Output is correct
12 Correct 2 ms 6492 KB Output is correct
13 Correct 2 ms 6580 KB Output is correct
14 Correct 2 ms 6588 KB Output is correct
15 Correct 2 ms 6748 KB Output is correct
16 Correct 2 ms 6492 KB Output is correct
17 Correct 1 ms 6500 KB Output is correct
18 Correct 2 ms 6492 KB Output is correct
19 Correct 1 ms 6620 KB Output is correct
20 Correct 2 ms 6488 KB Output is correct
21 Correct 2 ms 6624 KB Output is correct
22 Correct 2 ms 6492 KB Output is correct
23 Correct 2 ms 6492 KB Output is correct
24 Correct 1 ms 6492 KB Output is correct
25 Correct 2 ms 6624 KB Output is correct
26 Correct 2 ms 6492 KB Output is correct
27 Correct 2 ms 6492 KB Output is correct
28 Correct 2 ms 6492 KB Output is correct
29 Correct 1 ms 6492 KB Output is correct
30 Incorrect 370 ms 20252 KB Output isn't correct
31 Halted 0 ms 0 KB -