# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
927444 | AlphaMale06 | Election Campaign (JOI15_election_campaign) | C++17 | 141 ms | 27476 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.
#include <bits/stdc++.h>
using namespace std;
struct path{
int a, b, c;
};
#define pb push_back
#define F first
#define S second
const int N = 1e5+3;
vector<int> adj[N];
int tin[N], tout[N], h[N];
vector<path> pth[N];
int p[N][18];
int timer=1;
int dp[N][2];
int f[2*N];
void dfs(int v, int par){
h[v]=h[par]+1;
tin[v]=timer++;
p[v][0]=par;
for(int i=1; i<18; i++){
p[v][i]=p[p[v][i-1]][i-1];
}
for(int to : adj[v]){
if(to!=par){
# | 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... |