Submission #1227523

#TimeUsernameProblemLanguageResultExecution timeMemory
1227523PVM_pvm트리 (IOI24_tree)C++20
0 / 100
51 ms14752 KiB
#include "tree.h" #include<bits/stdc++.h> using namespace std; #define MAXN 200'007 int n; vector<int> p, w; vector<int> v[MAXN]; int brl=0; void init(std::vector<int> P, std::vector<int> W) { p = P; w = W; n = (int)p.size(); for (int q=1;q<n;q++) { v[ p[q] ].push_back(q); } for (int q=0;q<n;q++) { if (v[q].size()==0) brl++; } //cout<<brl<<"\n"; } long long query(int L, int R) { long long ans=0; if (2LL*brl*L<=R) ans=2LL*brl*L; else ans=2LL*brl*L-R; return ans; }
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...