# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
306610 | laoriu | Election Campaign (JOI15_election_campaign) | C++14 | 354 ms | 36088 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#define X first
#define Y second
#define pb push_back
#include<bits/stdc++.h>
using namespace std;
typedef pair < int, int > ii;
typedef pair < ii , int > iii;
using ll = long long;
using ld = long double;
const ll MAX=100003,inf=1e18;
vector < int > pr[MAX];
int par[18][MAX];
int F[18][MAX];
int h[MAX];
int dp[MAX];
int sum[MAX];
void DFS(int v,int trc){
for(int u:pr[v]) if(u!=trc){
par[0][u]=v;
h[u]=h[v]+1;
DFS(u,v);
}
}
int jump(int v,int d){
for(int i= 17;i>=0;i--)if(d&(1<<i))
v=par[i][v];
return v;
}
# | 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... |