# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1126723 | czauderna | Road Closures (APIO21_roads) | C++20 | 243 ms | 41540 KiB |
#include "roads.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define st first
#define nd second
#define pb push_back
const int NN = 1e5+3;
const ll INF = 1e16;
vector<int> inp[NN], Vdeg[NN], grf[NN];
int pre[NN], cnt, par[NN], idx[NN];
bool odw[NN];
ll Dp[NN][2], C[NN];
// dla solva WTH OMG OMG
// CHINESE FISHERMAN NEVER GIVE UP!!!
vector<pair<ll, int>> trees[NN];
int base[NN];
// dla n^2 log
vector<ll> tmpX, tmpY;
bool comp(int a, int b){
return (int)inp[a].size() > (int)inp[b].size();
}
void set_pre(int v, int p){
pre[v]=cnt; cnt++; par[v]=p;
for(auto w:inp[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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |