# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1161003 | hainam2k9 | Factories (JOI14_factories) | C++20 | 8089 ms | 87856 KiB |
#include "factories.h"
#include <bits/stdc++.h>
#define tt cin.tie(0), cout.tie(0), ios_base::sync_with_stdio(0)
#define fo freopen((NAME+".INP").c_str(), "r", stdin), freopen((NAME+".OUT").c_str(), "w", stdout)
#define ll long long
#define ull unsigned long long
#define i128 __int128
#define db long double
#define sz(a) ((int)(a).size())
#define pb emplace_back
#define pf emplace_front
#define pob pop_back
#define pof pop_front
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define ins emplace
#define mp make_pair
using namespace std;
const int MOD = 1e9+7, MAXN = 5e5+5;
const string NAME = "";
int n,par[MAXN][20],depth[MAXN];
ll dist[MAXN];
vector<pair<int,int>> adj[MAXN];
void dfsInit(int u){
for(pair<int,int>& v : adj[u])
if(v.fi!=par[u][0]){
dist[v.fi]=dist[u]+v.se, par[v.fi][0]=u, depth[v.fi]=depth[u]+1;
for(int i = 1; i<20; ++i)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |