oj.uz

Submission #728865

# Submission time Handle Problem Language Result Execution time Memory
728865 2023-04-23T07:57:18 Z Rasoul006 Dreaming (IOI13_dreaming) C++17
0 / 100
 56 ms 15232 KB 
#include "dreaming.h"

#include <bits/stdc++.h>

#define endl "\n"

#define F first

#define S second

#define pb push_back

#define all(x) x.begin() , x.end()

typedef long long ll;

using namespace std;

const int N = 1e5+5;

const long long oo = 1e18 ;

vector <pair <ll,ll>> v[N] ;

vector <pair < ll , pair <ll , ll > > > vec ;

ll n , m , ans , best , mx , dis[N] , len ;

bool vis[N] ;

pair <ll,ll> dfs (ll u , ll p)
{
    vis[u] = true ;

    pair <ll,ll> ret = {0 , u} ;

    for (auto it : v[u])
    {
        if (it.F == p) continue ;

        pair <ll,ll> p = dfs(it.F , u) ;

        p.F += it.S ;

        ret = max(ret , p) ;
    }

    best = min(best , max(len - ret.F , ret.F) ) ;

    return ret ;
}

pair <ll, pair <ll,ll>> get (ll p)
{
    ll p1 , p2 ;
    p1 = dfs(p , p).S ;
    p2 = dfs(p1 , p1).S ;
    len = dfs(p1 , p1).F ;

    best = oo ;

    dfs(p1 , p1) ;

    return {best , {p1,p2}} ;
}
int travelTime(int N, int M, int L, int A[], int B[], int T[])
{
    n = N ; m = M ;

    for (int i = 0 ; i<m ; i++)
    {
        v[B[i]].pb({A[i] , T[i]});
        v[A[i]].pb({B[i] , T[i]});
    }

    for (int i = 0 ; i<n ; i++)
    {
        if (!vis[i])
        {
            vec.pb(get(i)) ;
            break ;
        }
    }

    while (vec.size() < 3)
        vec.pb({-oo , {-oo , -oo}}) ;

    sort (all(vec)); reverse(all(vec));

    ll bans = dfs(vec[0].S.F , 0).F ;

    return max({ bans , vec[0].F + vec[1].F + L , vec[1].F + vec[2].F + L + L}) ;
}

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 15232 KB Output is correct
2 Correct 56 ms 15116 KB Output is correct
3 Correct 33 ms 10884 KB Output is correct
4 Correct 7 ms 4424 KB Output is correct
5 Incorrect 6 ms 3668 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2596 KB Output is correct
3 Incorrect 2 ms 2644 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 15232 KB Output is correct
2 Correct 56 ms 15116 KB Output is correct
3 Correct 33 ms 10884 KB Output is correct
4 Correct 7 ms 4424 KB Output is correct
5 Incorrect 6 ms 3668 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 15 ms 4940 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2596 KB Output is correct
3 Incorrect 2 ms 2644 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 15232 KB Output is correct
2 Correct 56 ms 15116 KB Output is correct
3 Correct 33 ms 10884 KB Output is correct
4 Correct 7 ms 4424 KB Output is correct
5 Incorrect 6 ms 3668 KB Output isn't correct
6 Halted 0 ms 0 KB -