제출 #588800

#제출 시각아이디문제언어결과실행 시간메모리
588800Red_InsideSprinkler (JOI22_sprinkler)C++17
3 / 100
4088 ms36168 KiB
// #include <bits/stdc++.h> #define ll long long #define f first #define s second #define pb push_back #define mp make_pair #define o cout<<"BUG"<<endl; #define FOR(i, j, n) for(int j = i; j < n; ++j) #define forn(i, j, n) for(int j = i; j <= n; ++j) #define nfor(i, j, n) for(int j = n; j >= i; --j) #define sortv(vv) sort(vv.begin(), vv.end()) #define all(v) v.begin(), v.end() #define ld long double #define ull unsigned long long using namespace std; const int maxn=1e6+10,LOG=17, mod=1e9+7; int block = 320, timer = 0; const ld EPS = 1e-18; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); #define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0); #define bt(i) (1 << (i)) #define int ll const ll inf=1e9+10; #define y1 yy #define prev pre #define pii pair <int, int> int n, q, L, h[maxn]; vector <int> edge[maxn]; void dfs(int v, int d, ll w, int pred = -1) { h[v] = h[v] * w % L; if(d == 0) return; for(auto to : edge[v]) { if(to == pred) continue; dfs(to, d + 1, w, v); } } main() { IOS cin >> n >> L; forn(1, i, n - 1) { int l, r; cin >> l >> r; edge[l].pb(r); edge[r].pb(l); } forn(1, i, n) cin >> h[i]; cin >> q; forn(1, i, q) { int ty; cin >> ty; if(ty == 1) { int x, d, w; cin >> x >> d >> w; dfs(x, -d, w); } else { int x; cin >> x; cout << h[x] << "\n"; } } }

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

sprinkler.cpp:46:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   46 | main()
      | ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...