제출 #749225

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
749225		GrindMachine	Sprinkler (JOI22_sprinkler)	C++17	100 / 100	1269 ms	102092 KiB

sprinkler

// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

refs:
https://codeforces.com/blog/entry/101003?#comment-897731

*/

int MOD = 1e9 + 7;
const int N = 2e5 + 50 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
const int D = 40 + 5;

vector<ll> adj[N];
vector<ll> par(N);

void dfs(ll u, ll p){
    par[u] = p;
    trav(v, adj[u]){
        if(v == p) conts;
        dfs(v,u);
    }
}

ll mul[N][D];

void solve(int test_case)
{
    ll n; cin >> n >> MOD;
    rep1(i,n-1){
        ll u,v; cin >> u >> v;
        adj[u].pb(v), adj[v].pb(u);
    }

    vector<ll> a(n+5);
    rep1(i,n) cin >> a[i];

    // add 40 extra nodes before root so corner cases need not be handled
    for(int i = n + 1; i <= n + 39; ++i){
        adj[i].pb(i+1);
    }
    adj[n+40].pb(1);

    dfs(n+1,-1);

    rep(i,N){
        rep(j,D){
            mul[i][j] = 1;
        }
    }

    ll q; cin >> q;

    while(q--){
        ll t; cin >> t;
        if(t == 1){
            ll u,d,w; cin >> u >> d >> w;
            vector<ll> order;
            rep(i,d+1){
                order.pb(u);
                u = par[u];
            }

            reverse(all(order));
            mul[order[0]][0] = (mul[order[0]][0] * w) % MOD;

            rep1(j,sz(order)-1){
                ll v = order[j];
                mul[v][j-1] = (mul[v][j-1] * w) % MOD;
                mul[v][j] = (mul[v][j] * w) % MOD;
            }
        }
        else{
            ll u; cin >> u;
            ll ans = a[u];

            for(ll i = 0; i <= 40; ++i, u = par[u]){
                ans = ans * mul[u][i] % MOD;
            }

            cout << ans << endl;
        }

    }
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

sprinkler.cpp: In function 'void solve(int)':
sprinkler.cpp:31:37: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 | #define rep1(i, n) for(int i = 1; i <= n; ++i)
......
  117 |             rep1(j,sz(order)-1){
      |                  ~~~~~~~~~~~~~       
sprinkler.cpp:117:13: note: in expansion of macro 'rep1'
  117 |             rep1(j,sz(order)-1){
      |             ^~~~

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