oj.uz

Submission #228404

# Submission time Handle Problem Language Result Execution time Memory
228404 2020-05-01T00:01:35 Z mohamedsobhi777 Dreaming (IOI13_dreaming) C++14
18 / 100
 1000 ms 13560 KB 
#include<bits/stdc++.h>
#include "dreaming.h"

using namespace std ; 

const int N = 1e5 + 7 ; 

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

int far , dst ; 

int dfs(int x , int p){
    int ret = 0; 
    for(auto u : adj[x]){
        if(u.first==p)continue ; 
        ret = max(ret , dfs(u.first , x) + u.second ) ; 
    }
    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) ; 
    }
    int dfx = dfs(x , x) ; 
    dst = max(dst , dfx) ; 
    mn = min(mn , dfx) ; 
}

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

# Verdict Execution time Memory Grader output
1 Execution timed out 1100 ms 13560 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1100 ms 13560 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1100 ms 13560 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 8564 KB Output is correct
2 Correct 57 ms 9076 KB Output is correct
3 Correct 58 ms 9076 KB Output is correct
4 Correct 55 ms 9076 KB Output is correct
5 Correct 54 ms 8948 KB Output is correct
6 Correct 57 ms 9596 KB Output is correct
7 Correct 59 ms 9208 KB Output is correct
8 Correct 54 ms 8820 KB Output is correct
9 Correct 63 ms 8784 KB Output is correct
10 Correct 55 ms 9212 KB Output is correct
11 Correct 6 ms 2688 KB Output is correct
12 Correct 42 ms 8184 KB Output is correct
13 Correct 43 ms 8184 KB Output is correct
14 Correct 39 ms 8184 KB Output is correct
15 Correct 37 ms 8184 KB Output is correct
16 Correct 39 ms 8184 KB Output is correct
17 Correct 46 ms 8184 KB Output is correct
18 Correct 43 ms 8176 KB Output is correct
19 Correct 44 ms 8184 KB Output is correct
20 Correct 6 ms 2688 KB Output is correct
21 Correct 6 ms 2688 KB Output is correct
22 Correct 7 ms 2816 KB Output is correct
23 Correct 39 ms 8184 KB Output is correct

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1100 ms 13560 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1100 ms 13560 KB Time limit exceeded
2 Halted 0 ms 0 KB -