oj.uz

Submission #415061

# Submission time Handle Problem Language Result Execution time Memory
415061 2021-05-31T13:31:54 Z Emin2004 Dreaming (IOI13_dreaming) C++14
0 / 100
 48 ms 11368 KB 
#include "dreaming.h"
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pb push_back
#define pii pair<int, int>
#define F first
#define S second

const int N = 100005;

int used[N];
int dis[N];
vector <pii> v[N];

void DFS(int node){
    used[node] = 1;
    dis[node] = 0;
    for(pii i : v[node]){
        if(!used[i.F]){
            used[i.F] = 1;
            DFS(i.F);
            dis[node] += i.S + dis[i.F];
        }
    }
}

int getans(int node, int sum){
    used[node] = 0;
    int res = sum - dis[node];
    for(pii i : v[node]){
        if(used[i.F]){
            res = max(res, dis[i.F] + i.S);
        }
    }
    for(pii i : v[node]){
        if(used[i.F]){
            used[i.F] = 0;
            res = min(res, getans(i.F, sum));
        }
    }
    return res;
}

int travelTime(int n, int m, int l, int a[], int b[], int t[]) {
   // return n;
    for(int i = 0; i < m; i++){
        v[a[i]].pb({b[i], t[i]});
        v[b[i]].pb({a[i], t[i]});
    }
    for(int i = 0; i < n; i++){
        if(!used[i]) {
            DFS(i);
        }
    }
    int mx1 = 0, mx2 = 0;
    for(int i = 0; i < n; i++){
        if(used[i] != 0){
            int cur = getans(i, dis[i]);
            if(cur >= mx1) {
                mx2 = mx1;
                mx1 = cur;
            }
            else if(cur > mx2) mx2 = cur;
        }
    }
    return mx1 + mx2 + l;
}

Subtask #1
0 / 14.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 23.0

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

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 5596 KB Output is correct
2 Incorrect 22 ms 5664 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

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

Subtask #6
0 / 23.0

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