oj.uz

Submission #228418

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

using namespace std ; 

const int N = 1e5 + 7 ; 

int mn ; 
int vis[N] ; 
int mxx[N] ; 
int anss[N] ;  

vector<pair<int , int > > adj[N]; 
int node , dst ; 
int ansi , ans2;

int solve1(int x, int p){
    int ret = 0 ; 
    for(auto u : adj[x]){
        if(u.first==p)continue ; 
        int dfx = solve1(u.first , x) + u.second ; 
        ret = max(ret , dfx) ;
    }
    anss[x] = ret ; 
    return mxx[x] = ret ; 
}

void dfs(int x , int p , int h){
    for(auto u : adj[x]){
        if(u.first==p)continue ; 
        dfs(u.first , x , h + u.second) ; 
    }
    /*if( h > dst){
        node = x ; 
        dst = h ; 
        ans2 = max(ans2 , h) ; 
    }*/
    ans2 = max(ans2 , h) ;
}

int dfs1(int x, int p , int dp = 0 ){
    if(vis[x])return 0 ; 
    vis[x] ++ ; 

    anss[x] = max(anss[x] , dp ) ;

    for(auto u: adj[x]){
        if(u.first == p)continue ; 
        dfs1(u.first , x , 0) ; 
    }
    ansi = min(ansi , solve1(x , x)) ; 
    ans2 = max(ans2 , solve1(x , x)) ; 
    return 0 ;
    //ansi = min(ansi , anss[x]) ; 
    for(auto u : adj[x]){
        if(u.first==p)continue ;
        int subdp = 0 ;
        for(auto j : adj[x]){
            if(j.first == p || j == u){
                continue ; 
            }
            subdp = max(subdp , mxx[j.first] + j.second) ; 
        } 
        dfs1(u.first , x , max(dp , subdp) + u.second) ; 
    }
}

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++)ans2 = max(ans2 , solve1(i , i) )  ; 
    for(int i = 1; i <= N ; i++){
        ansi = 2e9 ; 
        if(vis[i])continue ; 
        /*dfs(i , i , 0) ; 
        dst = 0 ; 
        dfs(node , node , 0) ; 
        ans2 = max(ans2 , dst) ; */
        //solve1(i , i ) ; 
        dfs1(i , i) ;
        v.push_back(ansi) ; 
        mul.insert(ansi) ;
    }
    if(v.size() == 1)return ans2 ; 
    else if(v.size() ==2 )return max(v[0] + v[1]  + L , ans2) ; 

    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 , ans2) ; 
}

Compilation message

dreaming.cpp: In function 'int travelTime(int, int, int, int*, int*, int*)':
dreaming.cpp:93:9: warning: unused variable 's' [-Wunused-variable]
     int s = v.size() ; 
         ^

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1096 ms 17144 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 1096 ms 17144 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 1096 ms 17144 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 9332 KB Output is correct
2 Correct 59 ms 9332 KB Output is correct
3 Correct 61 ms 9332 KB Output is correct
4 Correct 56 ms 9204 KB Output is correct
5 Correct 59 ms 9204 KB Output is correct
6 Correct 65 ms 9844 KB Output is correct
7 Correct 61 ms 9588 KB Output is correct
8 Correct 57 ms 9212 KB Output is correct
9 Correct 59 ms 9076 KB Output is correct
10 Correct 62 ms 9588 KB Output is correct
11 Correct 6 ms 2688 KB Output is correct
12 Correct 44 ms 8952 KB Output is correct
13 Correct 44 ms 8952 KB Output is correct
14 Correct 40 ms 8952 KB Output is correct
15 Correct 39 ms 8952 KB Output is correct
16 Correct 40 ms 8952 KB Output is correct
17 Correct 50 ms 9080 KB Output is correct
18 Correct 42 ms 8952 KB Output is correct
19 Correct 45 ms 8952 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 38 ms 8952 KB Output is correct

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1096 ms 17144 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 1096 ms 17144 KB Time limit exceeded
2 Halted 0 ms 0 KB -