oj.uz

Submission #360247

# Submission time Handle Problem Language Result Execution time Memory
360247 2021-01-27T23:46:32 Z sumit_kk10 Traffic (IOI10_traffic) C++14
0 / 100
 2 ms 2688 KB 
#include "traffic.h"
 
#include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
using namespace std;
const int N = 100000 + 5;
const int MOD = 1e9 + 7;
vector<int> graph[N];
int dis[N];
bool vis[N];
 
void dfs(int source, int p[]){
    vis[source] = 1;
    dis[source] = p[source];
    for(auto k : graph[source]){
        if(!vis[k]) {
            dfs(k, p);
            dis[source] += dis[k];
        }
    }
}
 
int LocateCentre(int n, int p[], int S[], int D[]){
    for(int i = 0; i < n - 1; ++i){
        graph[S[i]].push_back(D[i]);
        graph[D[i]].push_back(S[i]);
    }
    int mn = INT_MAX;
    for(int i = 0; i < n; ++i){
        dfs(i, p);
        int mx = 0;
        for(auto k : graph[i])
            mx = max(mx, dis[k]);
        mn = min(mn, mx);
        for(int j = 0; j < n; ++j)
            vis[j] = 0;
    }
    return mn;
}

Subtask #1
0 / 25.0

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

Subtask #2
0 / 25.0

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

Subtask #3
0 / 25.0

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

Subtask #4
0 / 25.0

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