oj.uz

답안 #228400

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
228400 2020-04-30T23:31:28 Z mohamedsobhi777 꿈 (IOI13_dreaming) C++14
0 / 100
 51 ms 6648 KB 
#include<bits/stdc++.h>
#include "dreaming.h"

using namespace std ; 

const int N = 1e5 + 7 ; 

int n , m , L ; 
int mn ; 
int vis[N] ; 
vector<pair<int , int > > adj[N]; 

int far , dst ; 

int dfs(int x , int p , int l){
    int ret = 0; 
    for(auto u : adj[x]){
        if(u.first==p)continue ; 
        ret = max(ret , dfs(u.first , x , l+1) + u.second ) ; 
    }
    dst = max(dst , l) ; 
    return ret ;
}

int dfs1(int x, int p){
    if(vis[x]++)return 0 ;
    for(auto u : adj[x]){
        if(u.first==p)continue ; 
        dfs1(u.first , x) ; 
    }
    mn = min(mn , dfs(x , x , 0)) ; 
}

int pre[N] , suf[N] ; 

int travelTime(int N, int M, int L, int A[], int B[], int T[]) {
    for(int i  =0 ; i< M ;i++){
        adj[A[i] +1 ].push_back({B[i]+1 , T[i]}) ;
        adj[B[i]+1].push_back({A[i]+1 , T[i]}) ;
    }
    vector<int> v; 
    multiset<int> mul ; 
    for(int i = 1; i <= n ; i++){
        mn = 2e9 ; 
        if(vis[i])continue ;    
        dfs1(i , i) ;
        v.push_back(mn) ; 
        mul.insert(mn) ;
    }
    if(v.size() == 1)return dst ; 
    else if(v.size() ==2 )return max(v[0] + v[1]  + L , dst) ; 

    int s = v.size() ; 
    int ans = 2e9 ; 

    for(auto u : v){
        mul.erase(mul.find(u)) ; 
        int mx1 = -1 , mx2 = -1 ; 
        auto e = mul.end() ;
        e-- ; mx1 = *e ; 
        e-- ; mx2 = *e ;
        int now = max(u + mx1 + L , mx1 + mx2 + L + L ) ; 
        ans = min(ans , now ) ;
        mul.insert(u) ; 
    }   
    return max(ans , dst) ; 
}

Compilation message

dreaming.cpp: In function 'int travelTime(int, int, int, int*, int*, int*)':
dreaming.cpp:53:9: warning: unused variable 's' [-Wunused-variable]
     int s = v.size() ; 
         ^
dreaming.cpp: In function 'int dfs1(int, int)':
dreaming.cpp:32:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 51 ms 6648 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 51 ms 6648 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 51 ms 6648 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 22 ms 4992 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 51 ms 6648 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 51 ms 6648 KB Output isn't correct
2 Halted 0 ms 0 KB -