# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1133820 | Math4Life2020 | Road Closures (APIO21_roads) | C++20 | 927 ms | 32628 KiB |
#include "roads.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long; using pii = pair<ll,ll>;
mt19937 gen;
const ll Nm = 1e5+5; ll N;
const ll K = 200; //sqrt(N)
ll ans[Nm];
vector<pii> adj[Nm];
vector<ll> fadj[Nm];
ll deg[Nm];
pii radj[Nm]; //{number, cost}
vector<ll> itpl; //inverse topological sort
ll dp0[Nm]; //no path up
ll dp1[Nm]; //path up
ll qsel(ll nv, vector<ll> v0) { //quickselect bottom nv elements
if (nv==0) {
return 0;
}
vector<ll> v1,v2; ll neq=0; //bottom, top, # equal
ll s1=0,s2=0;
ll x = v0[gen()%(v0.size())];
for (ll y: v0) {
if (y<x) {
v1.push_back(y);
s1+=y;
# | 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... |