Submission #1253324

#	Time	Username	Problem	Language	Result	Execution time	Memory
1253324		thdh__	Sprinkler (JOI22_sprinkler)	C++20	100 / 100	1034 ms	101292 KiB

sprinkler

#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define eb emplace_back
#define pu push
#define ins insert
#define fi first
#define se second
#define all(a) a.begin(),a.end()
#define bruh ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define fu(x,a,b) for (auto x=a;x<=b;x++)
#define fd(x,a,b) for (auto x=a;x>=b;x--)
#define int ll

using namespace std;
//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());

/*
Competitive Programming notes that I need to study & fix my dumbass self:

1. Coding:
- Always be sure to check the memory of arrays (maybe use vectors), for loops
- Always try to maximize the memory if possible, even if you are going for subtasks
- Do not exploit #define int long long, it will kill you

2. Stress: 
- Always try generating big testcases and try if they run

3. Time management:
- Don't overcommit or undercommit, always spend a certain amount of time to think a problem, don't just look at it and say I'm fucked
- Do not spend too much time coding brute-force solutions, they should be easily-codable solutions that don't take up too much time

Time management schedule:
Offline / LAH days (4 problems - 3h):
15' thinking of solution / idea
1. no idea: skip
2. yes idea: continue thinking for <= 15'

+ implementing: <= 20'
+ brute-force: <= 5'
+ test generator: <= 5'

I hate offline because I am dumb
*/

typedef pair<int, int> ii;
const int N = 2e5+5;
const int B = 750;
int mod = 1e9+7;
const int inf = 1e18;
using cd = complex<double>;
const long double PI = acos(-1);
int power(int a,int b) {ll x = 1;if (a >= mod) a%=mod; while (b) {if (b & 1) x = x*a % mod;a = a*a % mod;b>>=1;}return x;} 

int n,q,a[N];
vector<int> adj[N];
int par[N], mul[N][50];

void dfs(int u, int p) 
{
	par[u] = p;
	for (auto v : adj[u]) 
	{
		if (v == p) continue;
		dfs(v, u);
	}
}

void solve()
{
	cin>>n>>mod;
	for (int i = 1; i < n; i++) 
	{
		int u,v; cin>>u>>v;
		adj[u].pb(v); adj[v].pb(u);
	}
	for (int i = 1; i <= n; i++) cin>>a[i];
	dfs(1, 0);
	cin>>q;
	for (int i = 0; i <= n; i++) for (int j = 0; j <= 40; j++) mul[i][j] = 1;
	while (q--) 
	{
		int type, x, d, w;
		cin>>type>>x;
		if (type == 1) 
		{
			cin>>d>>w;
			for (int i = d; i >= 0; i--) 
			{
				mul[x][i] = (mul[x][i] * w) % mod;
				if (x != 1 && i) mul[x][i-1] = (mul[x][i-1] * w) % mod;
				if (x != 1) x = par[x];
			}
		} else 
		{
			int ans = a[x];
			for (int i = 0; i <= 40 && x; i++)
			{
				ans = (ans * mul[x][i]) % mod;
				x = par[x];
			}
			cout<<ans<<endl;
		}
		// for (int i = 0; i <= 1; i++) 
		// {
		// 	for (int j = 0; j <= 5; j++) cout<<mul[i][j]<<" ";
		// 	cout<<endl;
		// }
	}
}

/*
Go through the mistakes you usually make and revise your code, for god's sake...
*/

signed main()
{
	bruh
	//freopen("input.inp","r",stdin);
	//freopen("output.inp","w",stdout);
	int t = 1;
	// cin>>t;
	while (t--)
	{
		solve();
		cout<<"\n";
	}
}

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