| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 892506 | 2023-12-25T12:45:57 Z | vjudge1 | Sprinkler (JOI22_sprinkler) | C++17 | 194 ms | 200020 KB |
#include <bits/stdc++.h>
#define ll long long
#define str string
#define ins insert
#define ld long double
#define pb push_back
#define pf push_front
#define pof pop_front()
#define pob pop_back()
#define lb lower_bound
#define ub upper_bound
#define endl "\n"
#define fr first
#define sc second
#define mpa make_pair
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define sz size()
#define bc back()
#define ar array
#define vll vector<ll>
using namespace std;/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;*/
template <class _T>
bool chmin(_T &x, const _T &y){
if(x>y){
x=y;
return true;
}
return false;
}
template <class _T>
bool chmax(_T &x, const _T &y){
bool flag=false;
if (x<y){
x=y;flag|=true;
}
return flag;
}
//#define ordered_set tree<ll, null_type,less_equal<ll>, rb_tree_tag,tree_order_statistics_node_update>
void fre(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}
void start(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
const ll inf=2e18+7;
const ll mod=1e9+7;
const ll N=2e5+7;
const ld eps=1e-9;
vector<vll> g(N);
ll h[N];
ll i;
ll n,k,p[N];
ll val[N][50];
void dfs(ll v,ll p,ll w,ll d,ll r){
h[v]*=w;
h[v]%=k;
if(d==r)return;
for(auto i : g[v]){
if(i==p)continue;
dfs(i,v,w,d+1,r);
}
}
void dfs2(ll v){
for(auto i : g[v]){
if(i==p[v])continue;
p[i]=v;
dfs2(i);
}
}
void solve(){
ll i,j,q;
ll a,b,c;
cin>>n>>k;
for(i=0;i<=n;i++){
for(j=0;j<=45;j++)val[i][j]=1;
}
for(i=1;i<n;i++){
cin>>a>>b;
g[a].pb(b);
g[b].pb(a);
}
for(i=1;i<=n;i++)cin>>h[i];
dfs2(1);
cin>>q;
ll t;
for(i=0;i<q;i++){
cin>>t;
if(t==1){
cin>>a>>b>>c;
while(p[a]){
val[a][b]*=c;
val[a][b-1]*=c;
val[a][b]%=k;
val[a][b-1]%=k;
a=p[a];
b--;
}
while(b){
val[a][b]*=c;
val[a][b]%=k;
b--;
}
val[a][0]*=c;
val[a][0]%=k;
}else{
cin>>a;
ll ans=h[a]*val[a][0]%k;
for(j=1;j<=40;j++){
a=p[a];
if(a==0)break;
ans*=val[a][j];
ans%=k;
}
cout<<ans<<endl;
}
}
}
signed main(){
start();
ll t=1;
//cin>>t;
while(t--) solve();
return 0;
}
/*
1
7
1 2
2 3
3 4
4 5
3 6
6 7
2
4 1
5 7
*/
Compilation message
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 3 ms | 7004 KB | Output is correct |
| 2 | Runtime error | 9 ms | 14172 KB | Execution killed with signal 11 |
| 3 | Halted | 0 ms | 0 KB | - |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Runtime error | 9 ms | 14172 KB | Execution killed with signal 11 |
| 2 | Halted | 0 ms | 0 KB | - |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Runtime error | 9 ms | 14172 KB | Execution killed with signal 11 |
| 2 | Halted | 0 ms | 0 KB | - |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Runtime error | 9 ms | 14168 KB | Execution killed with signal 11 |
| 2 | Halted | 0 ms | 0 KB | - |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 2 ms | 7004 KB | Output is correct |
| 2 | Runtime error | 194 ms | 200020 KB | Execution killed with signal 11 |
| 3 | Halted | 0 ms | 0 KB | - |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 3 ms | 7004 KB | Output is correct |
| 2 | Runtime error | 9 ms | 14172 KB | Execution killed with signal 11 |
| 3 | Halted | 0 ms | 0 KB | - |