# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
728856 | Rasoul006 | Dreaming (IOI13_dreaming) | C++17 | 73 ms | 37052 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 "dreaming.h"
#include <bits/stdc++.h>
#define endl "\n"
#define F first
#define S second
#define pb push_back
typedef long long ll;
using namespace std;
const int N = 1e6+5;
const long long oo = 1e18 ;
vector <pair <ll,ll>> v[N] ;
ll n , m , ans , best , mx , dis[N] , dis2[N] ;
bool vis[N] ;
void dfs (ll u , ll p , ll cost)
{
dis[u] = cost ;
vis[u] = true ;
Compilation message (stderr)
# | 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... |