oj.uz

Submission #102384

# Submission time Handle Problem Language Result Execution time Memory
102384 2019-03-24T15:03:35 Z MohamedAhmed0 Dreaming (IOI13_dreaming) C++14
0 / 100
 74 ms 7800 KB 
#include "dreaming.h"
#include <bits/stdc++.h>

using namespace std;

const int MAX = 1e5 + 5 ;
vector< vector< pair<int , int> > >adj(MAX) ;
int vis[MAX] , parent[MAX] , Distance[MAX];

int now , dist = 0 ;

void bfs(int node)
{
    now = node , dist = 0 ;
    queue< pair<int , pair<int , int> > >q ;
    q.push({node , {0 , -1}}) ;
    Distance[node] = 0 ;
    parent[node] = node ;
    while(!q.empty())
    {
        pair<int , pair<int , int> >p = q.front() ;
        q.pop() ;
        int cur = p.first , d = p.second.first , par = p.second.second ;
        vis[cur] = 1 ;
        parent[cur] = par ;
        if(d > dist)
            now = cur , dist = d ;
        for(auto &child : adj[cur])
        {
            if(child.first == par)
                continue;
            Distance[child.first] = child.second ;
            q.push({child.first , {d + child.second , cur}}) ;
        }
    }
    return ;
}

int travelTime(int n , int m , int l , int A[] , int B[] , int T[] )
{
    memset(parent , -1 , sizeof(parent)) ;
    for(int i = 0 ; i < m ; ++i)
    {
        int x = A[i] , y = B[i] , c = T[i] ;
        adj[x].push_back({y , c}) ;
        adj[y].push_back({x , c}) ;
    }
    vector<int>v ;
    //loop on every Tree
    for(int i = 0 ; i < n ; ++i)
    {
        if(vis[i] == 1)
            continue ;
        //found new Tree
        bfs(i) ;
        int x = now ;
        bfs(now) ;
        int sum = 0 , cur = now;
        for(int j = 0 ; j < n ; ++j)
        {
            sum += Distance[cur] ;
            if(sum >= dist / 2)
                break;
            cur = parent[cur] ;
        }
        int a = max(sum , dist - sum) ;
        sum -= Distance[cur] ;
        a = min(a , max(sum , dist - sum)) ;
        v.push_back(a) ;
    }
    sort(v.rbegin() , v.rend()) ;
    int ans = 2e9 ;
    if(v.size() >= 2)
        ans = min(ans , v[0] + l + v[1]) ;
    if(v.size() >= 3)
        ans = min(ans , v[1] + v[2] + 2 * l) ;
    return ans ;
}

/*int main()
{
    int n , m , l ;
    cin>>n>>m>>l ;
    int a[m] , b[m] , t[m] ;
    for(int i = 0 ; i < m ; ++i)
        cin>>a[i]>>b[i]>>t[i] ;
    cout<<travelTime(n , m , l , a , b , t)<<"\n" ;
    return  0 ;
}*/

Compilation message

dreaming.cpp: In function 'int travelTime(int, int, int, int*, int*, int*)':
dreaming.cpp:56:13: warning: unused variable 'x' [-Wunused-variable]
         int x = now ;
             ^

Subtask #1
0 / 14.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 23.0

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

Subtask #4
0 / 18.0

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

Subtask #5
0 / 12.0

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

Subtask #6
0 / 23.0

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