oj.uz

Submission #785295

# Submission time Handle Problem Language Result Execution time Memory
785295 2023-07-17T08:06:42 Z TakeMe Sprinkler (JOI22_sprinkler) C++14
0 / 100
 294 ms 31036 KB 
/* Quick Note :
 * Jangan Mikir Lama - lama, sampahin dulu aja kalo OI
 * Always Try to reset
*/
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define debug(val) cerr << "The value of " << #val << " is = " << val << '\n';
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
const ld PI = 4*atan((ld)1);
const ll mod = 1e9 + 7;
const ll inf = 922337203685477;
const ll nax = 2e5 + 5;

ll n, q, l;
ll a[nax], isZero[nax], par[nax];
ll mul[nax][5];
vector<vector<ll>> v(nax);

void find_par(ll idx, ll bfr){
	par[idx] = bfr;
	for(auto it : v[idx]){
		if(it != bfr){
			find_par(it, idx);
		}
	}
}

void upd_val(ll x, ll d, ll w){
	if(d < 0 || x == 0) return;
	mul[x][d] *= w;
	mul[x][d] %= l;
	if(d - 1 >= 0){
		mul[x][d-1] *= w;
		mul[x][d-1] %= l;
	}
	upd_val(par[x], d - 1, w);
}



int main(){ 
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
    //freopen("test.in", "r", stdin);
    //freopen("test.out", "w", stdout);
    
    cin >> n >> l;
    for(ll i = 1; i <= n; i++){
		for(ll j = 0; j < 5; j++){
			mul[i][j] = 1;
		}
	}
    for(ll i = 1; i < n; i++){
		ll x, y;
		cin >> x >> y;
		v[x].pb(y);
		v[y].pb(x);
	}
    for(ll i = 1; i <= n; i++){
		cin >> a[i];
	}
	find_par(1, 0);
	cin >> q;
	while(q--){
		ll tp, x, d, w;
		cin >> tp;
		if(tp == 1){
			cin >> x >> d >> w;
			upd_val(x, d, w);
		}
		else{
			cin >> x;
			ll ans = a[x] * mul[x][0] % l;
			if(par[x] == 1){
				ans = (ans * mul[par[x]][1]) % l;
				ans = (ans * mul[par[x]][2]) % l;
			}
			else if(par[x] == 0){
				ans = (ans * mul[x][1]) % l;
				ans = (ans * mul[x][2]) % l;
			}
			else{
				ans = (ans * mul[par[x]][1]) % l;
				//ans = (ans * mul[par[par[x]]][2]) % l;
				ans = (ans * mul[par[par[x]]][2]) % l;
				
			}
			cout << ans << '\n';
		}
	}
}

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 4948 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 235 ms 26828 KB Output is correct
3 Correct 255 ms 23676 KB Output is correct
4 Correct 285 ms 27728 KB Output is correct
5 Correct 294 ms 25252 KB Output is correct
6 Correct 242 ms 25204 KB Output is correct
7 Correct 271 ms 25604 KB Output is correct
8 Correct 223 ms 25684 KB Output is correct
9 Correct 286 ms 31036 KB Output is correct
10 Correct 228 ms 27556 KB Output is correct
11 Incorrect 285 ms 26764 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 235 ms 26828 KB Output is correct
3 Correct 255 ms 23676 KB Output is correct
4 Correct 285 ms 27728 KB Output is correct
5 Correct 294 ms 25252 KB Output is correct
6 Correct 242 ms 25204 KB Output is correct
7 Correct 271 ms 25604 KB Output is correct
8 Correct 223 ms 25684 KB Output is correct
9 Correct 286 ms 31036 KB Output is correct
10 Correct 228 ms 27556 KB Output is correct
11 Incorrect 285 ms 26764 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Incorrect 293 ms 28500 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 4948 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 4948 KB Output isn't correct
2 Halted 0 ms 0 KB -