이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
int val[45][200005];
int up[200005], H[200005], n, mod, q;
vector <int> adj[200005];
void dfs(int x, int par){
up[x] = par;
for(auto i : adj[x])if(i != par)dfs(i, x);
}
void solve(){
cin >> n >> mod;
up[1] = -1;
for(int i = 1; i < n; i++){
int a, b; cin >> a >> b;
adj[a].push_back(b); adj[b].push_back(a);
}
dfs(1, -1);
for(int i = 0; i <= 42; i++)for(int j = 1; j <= n; j++)val[i][j] = 1;
for(int i = 1; i <= n; i++)cin >> H[i];
cin >> q;
while(q--){
int t; cin >> t;
if(t == 1){
int a, b, c; cin >> a >> b >> c;
int cur = a;
while(cur != -1 && b >= 0){
val[b][cur] *= c;
val[b][cur] %= mod;
b--;
cur = up[cur];
}
}
else{
int x; cin >> x;
int ans = H[x], cur = x;
for(int i = 0; i <= 40; i++){
ans *= val[i][cur]; ans %= mod;
ans *= val[i + 1][cur]; ans %= mod;
if(cur == 1){
for(int j = i + 2; j <= 40; j++)ans *= val[j][cur], ans %= mod;
break;
}
cur = up[cur];
}
cout << ans << '\n';
}
}
}
main(){
ios::sync_with_stdio(0);cin.tie(0);
int tc = 1;
//cin >> tc;
for(int tc1=1;tc1<=tc;tc1++){
// cout << "Case #" << tc1 << ": ";
solve();
}
}
컴파일 시 표준 에러 (stderr) 메시지
sprinkler.cpp:63:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
63 | main(){
| ^~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |