# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1128600 | JuanJL | Railway (BOI17_railway) | C++20 | 275 ms | 49400 KiB |
#include <bits/stdc++.h>
#define fst first
#define snd second
#define pb push_back
#define SZ(x) (int)x.size()
#define forn(i,a,b) for(int i = a; i < b; i++)
#define FIN ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
typedef long long ll;
const int MAXN = 100000+5;
ll n,m,k;
ll lvl[MAXN];
ll prnt[MAXN];
vector<ll> cAdj[MAXN];
vector<ll> adj[MAXN];
set<ll> ndSet[MAXN];
ll obj[MAXN]; //Objetivo de conexiones del ministro I
ll aCon[MAXN]; //Conexiones actuales del objetivo i
map<pair<ll,ll>,ll> mp;
void dfs(ll nd,ll p,ll lv){
lvl[nd]=lv;
prnt[nd]=p;
# | 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... |