oj.uz

Submission #882035

# Submission time Handle Problem Language Result Execution time Memory
882035 2023-12-02T13:30:51 Z nikd Dreaming (IOI13_dreaming) C++17
0 / 100
 28 ms 13404 KB 
#include <bits/stdc++.h>
#include "dreaming.h"
#define MAXN 100001
using namespace std;

int f;
int max_dis;
int par[MAXN];
int tree[MAXN];
int cont=0;
vector<int> mintree;
bool vis[MAXN]={};
vector<pair<int, int>> adj[MAXN];
int dist[MAXN]={};

void dfs1(int v, int p){
    vis[v]=true;
    for(auto u: adj[v]){
        if(u.first!=p){
            dist[u.first]=dist[v]+u.second;
            if(dist[u.first]>max_dis){
                max_dis=dist[u.first];
                f=u.first;
            }
            dfs1(u.first, v);
        }
    }
}

void dfs2(int v, int p){
    par[v]=p;
    for(auto u: adj[v]){
        if(u.first!=p){
            dist[u.first]=dist[v]+u.second;
            if(dist[u.first]>max_dis){
                max_dis=dist[u.first];
                f=u.first;
            }
            dfs2(u.first, v);
        }
    }
}

int travelTime(int N, int M, int L, int A[], int B[], int T[]){
    for(int i = 0; i<M; i++){
        adj[A[i]].push_back({B[i], T[i]});
        adj[B[i]].push_back({A[i], T[i]});
    }
    for(int i = 0; i<N; i++){
        if(!vis[i]){
            mintree.push_back(INT_MAX);
            max_dis=0;
            f=0;
            dist[i]=0;
            dfs1(i, i);
            int a = f;
            dist[a]=0;
            max_dis=0;
            dfs2(a, a);
            int b = f;
            int d= max_dis/2;
            int last=-1;
            while(dist[b]>d){
                last=b;
                b=par[b];
            }
            if(last==-1){
                mintree[cont]=dist[b];
            }
            else{
                mintree[cont]=min(dist[last], max_dis-dist[b]);
            }
            cont++;
        }
    }
    int maxbest1=0;
    int maxbest2=0;
    int maxbest3=0;
    for(int j: mintree){
        if(j>maxbest1){
            maxbest3=maxbest2;
            maxbest2=maxbest1;
            maxbest1=j;
            
        }
        else if(j>maxbest2){
            maxbest3=maxbest2;
            maxbest2=j;
        }
        else if(j>maxbest3){
            maxbest3=j;
        }
    }
    int sol;
    if(maxbest3!=-1){
        sol =max(maxbest1+L+maxbest2, maxbest2+maxbest3+2*L);
    }
    else sol=maxbest1+L+maxbest2;
    return sol;
    
    
}

Subtask #1
0 / 14.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 23.0

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

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 7328 KB Output is correct
2 Correct 11 ms 7384 KB Output is correct
3 Correct 12 ms 7260 KB Output is correct
4 Correct 11 ms 7260 KB Output is correct
5 Correct 11 ms 7260 KB Output is correct
6 Correct 12 ms 7648 KB Output is correct
7 Correct 14 ms 7392 KB Output is correct
8 Correct 11 ms 7260 KB Output is correct
9 Correct 11 ms 7260 KB Output is correct
10 Correct 12 ms 7384 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 2 ms 5588 KB Output is correct
13 Correct 3 ms 5588 KB Output is correct
14 Correct 2 ms 5592 KB Output is correct
15 Correct 3 ms 5592 KB Output is correct
16 Correct 2 ms 5336 KB Output is correct
17 Correct 2 ms 5332 KB Output is correct
18 Correct 2 ms 5432 KB Output is correct
19 Correct 2 ms 5336 KB Output is correct
20 Incorrect 1 ms 4444 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

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

Subtask #6
0 / 23.0

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