Submission #1241742

#	Time	Username	Problem	Language	Result	Execution time	Memory
1241742		lrnnz	Sprinkler (JOI22_sprinkler)	C++20	3 / 100	4094 ms	17540 KiB

sprinkler

#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <queue>
#include <random>
using namespace std;

#define all(a) (a).begin(), (a).end()
#define ll long long
#define ld long double
#define ui uint64_t
#define cont(set, element) ((set).find(element) != (set).end())

#define chmin(x, y) (x = min(x, y)) 
#define chmax(x, y) (x = max(x, y))

/********* DEBUG *********/

template <typename T>
void outvec(const vector<T>& Z){
    for (const T& x : Z)
    cout << x << ' ';
    cout << "\n";
}
void printVariable(const any& var) {
    if (!var.has_value()) {
        cout << "null";
        return;
    }

    if (var.type() == typeid(int)) {
        cout << any_cast<int>(var);
    } else if (var.type() == typeid(double)) {
        cout << any_cast<double>(var);
    } else if (var.type() == typeid(float)) {
        cout << any_cast<float>(var);
    } else if (var.type() == typeid(char)) {
        cout << any_cast<char>(var);
    } else if (var.type() == typeid(bool)) {
        cout << (any_cast<bool>(var) ? "true" : "false");
    } else if (var.type() == typeid(string)) {
        cout << any_cast<string>(var);
    } else if (var.type() == typeid(const char*)) {
        cout << any_cast<const char*>(var);
    } else if (var.type() == typeid(long long)) {
        cout << any_cast<long long>(var);
    } else {
        cout << "[unknown type]";
    }
}

template<typename... Args>
void outval(Args... args) {
    vector<any> variables = {args...};
    
    for (size_t i = 0; i < variables.size(); ++i) {
        printVariable(variables[i]);
        if (i != variables.size() - 1) {
            cout << " ";
        }
    }
    cout << "\n";
}

#define sp << " " <<
#define fi first
#define se second

/********* DEBUG *********/

const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll inf = 1e18;

ll n,l;
void dfs(ll nd, vector<ll> &h, vector<vector<ll>> &adj, ll hi, ll val, ll len=0, ll par = -1){
    if (len > hi)
        return;

    h[nd] = (h[nd] * val) % l;
    for (auto &x : adj[nd]){
        if (x == par)
            continue;

        dfs(x, h, adj, hi, val, len+1, nd);
    }
}

void solve(){
    cin >> n >> l;

    vector<vector<ll>> adj(n);
    for (int i = 0; i < n-1; i++){
        ll a,b;
        cin >> a >> b;

        a--; b--;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }

    vector<ll> height(n);
    for (int i = 0; i < n; i++)
        cin >> height[i];

    ll q;
    cin >> q;

    while (q--){
        ll x;
        cin >> x;

        if (x==1){
            ll x,d,w;
            cin >> x >> d >> w;

            x--;
            dfs(x, height, adj, d, w);
        }
        else{
            ll a;
            cin >> a;
            
            outval(height[a-1]);
        }
    }
}

int main() {    
    ios::sync_with_stdio(0);
    cin.tie(0);

    ll t = 1;
    //cin >> t;
    while (t--) {
        solve();
    }
}    

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