Submission #892307

#	Time	Username	Problem	Language	Result	Execution time	Memory
892307		vjudge1	Sprinkler (JOI22_sprinkler)	C++17	0 / 100	4049 ms	26084 KiB

sprinkler

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) x.begin(), x.end()
#define size(x) (int)x.size()

template<class S, class T>
bool chmin(S &a, const T &b) {
    return a > b && (a = b) == b;
}
template<class S, class T>
bool chmax(S &a, const T &b) {
    return a < b && (a = b) == b;
}
const int inf = 1e9 + 7;
const int INF = 1e18 + 7;
const int mod = 998244353;
const int N = 2e5 + 1;

int n, l;
vector<int> g[N];
int h[N], cnt[N];
bool zero[N];

void dfs(int v, int p, int d, int bound, int w) {
    h[v] *= w;
    h[v] %= l;
    if (d == bound) return;
    for (int to : g[v]) {
        if (to != p) {
            dfs(to, v, d + 1, bound, w);
        }
    }
}

signed main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    cin >> n >> l;
    for (int i = 1; i < n; ++i) {
        int a, b;
        cin >> a >> b;
        g[a].push_back(b);
        g[b].push_back(a);
    }
    for (int i = 1; i <= n; ++i) {
        cin >> h[i];
    }
    int q;
    cin >> q;
    while (q--) {
        int t;
        cin >> t;
        if (t == 1) {
            int v, d, w;
            cin >> v >> d >> w;
            if (zero[v]) {
                continue;
            } else if (w == 1) {
                continue;
            } else {
                if (w == 0) {
                    zero[v] = true;
                    dfs(v, -1, 0, d, w);
                } else {
                    if (cnt[v] < 30) {
                        cnt[v]++;
                        dfs(v, -1, 0, d, w);
                    }
                }
            }
        } else {
            int v;
            cin >> v;
            cout << h[v] << '\n';
        }
    }
}

• Subtask 1: 0 / 3
• Subtask 2: 0 / 9
• Subtask 3: 0 / 29
• Subtask 4: 0 / 12
• Subtask 5: 0 / 30
• Subtask 6: 0 / 17