oj.uz

Submission #240662

# Submission time Handle Problem Language Result Execution time Memory
240662 2020-06-20T13:50:43 Z s_avila_g Dreaming (IOI13_dreaming) C++14
14 / 100
 68 ms 12280 KB 
#include <bits/stdc++.h>
#include "dreaming.h"
#define ff first
#define ss second
using namespace std;
int inf = INT_MAX;
vector<vector<pair<int,int> > > gp;
vector<int> vis, dis,parents;

void dfs(int u, int pes){
    vis[u] = 1;
    dis[u] += pes;
    for(auto it: gp[u]){
        if(vis[it.ff] == 0){
            vis[it.ff] = 1;
            parents[it.ff] = u;
            dfs(it.ff, it.ss + dis[u]);
        }
    }
}

int radius(int u){
    int distan1 = dis[u], distan2 = 0, ans = dis[u];
    while(parents[u] != -1){
        ans = min(ans,max(distan1,distan2));
        int pospar = -1;
        for(int i = 0; i < (int)gp[u].size(); i++){
            if(gp[u][i].ff == parents[u]) pospar = gp[u][i].ss;
        }
        u = parents[u];
        distan1 -= pospar; distan2 += pospar;
    }
    return ans;
}

int fndext(int n){
    int ans = -1, maypes = -1;
    for(int i = 0; i < n; i++){
        if(dis[i] > maypes){
            maypes = dis[i];
            ans = i;
        }
    }
    return ans;
}

int travelTime(int N, int M, int L, int A[], int B[], int T[]) {
    gp.resize(N); vis.resize(N); dis.resize(N); parents.resize(N);
    for(int i = 0; i < N; i++) vis[i] = 0, dis[i] = 0;
    for(int i = 0; i < M; i++){
        gp[A[i]].push_back(make_pair(B[i],T[i]));
        gp[B[i]].push_back(make_pair(A[i],T[i]));
    }
    dfs(0,0);
    int nodext1 = 0, nodext2 = 0, nodext11 = 0, nodext22 = 0;
    nodext1 = fndext(N);
    dis.clear();
    for(int i = 0; i < N; i++) vis[i] = 0, dis[i] = 0;
    parents[nodext1] = -1;
    dfs(nodext1,0);
    nodext2 = fndext(N);
    int diam1 = dis[nodext2], diam2 = 0, radi1 = radius(nodext2), radi2 = 0;
    for(int i = 0; i < N; i++) dis[i] = 0;
    for(int i = 0; i < N; i++){
        if(vis[i] == 0){
            dfs(i,0);
            break;
        }
    }
    nodext11 = fndext(N);
    dis.clear();
    for(int i = 0; i < N; i++) vis[i] = 0, dis[i] = 0;
    parents[nodext11] = -1;
    dfs(nodext11,0);
    nodext22 = fndext(N);
    diam2 = dis[nodext22];
    radi2 = radius(nodext22);
    return max(diam1,max(diam2,radi1 + radi2 + L));
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 12280 KB Output is correct
2 Correct 64 ms 12280 KB Output is correct
3 Correct 41 ms 8312 KB Output is correct
4 Correct 13 ms 2304 KB Output is correct
5 Correct 11 ms 1536 KB Output is correct
6 Correct 18 ms 3072 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 42 ms 5112 KB Output is correct
9 Correct 42 ms 6776 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 57 ms 8568 KB Output is correct
12 Correct 68 ms 10360 KB Output is correct
13 Correct 5 ms 512 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 12280 KB Output is correct
2 Correct 64 ms 12280 KB Output is correct
3 Correct 41 ms 8312 KB Output is correct
4 Correct 13 ms 2304 KB Output is correct
5 Correct 11 ms 1536 KB Output is correct
6 Correct 18 ms 3072 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 42 ms 5112 KB Output is correct
9 Correct 42 ms 6776 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 57 ms 8568 KB Output is correct
12 Correct 68 ms 10360 KB Output is correct
13 Correct 5 ms 512 KB Output is correct
14 Incorrect 5 ms 384 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 12280 KB Output is correct
2 Correct 64 ms 12280 KB Output is correct
3 Correct 41 ms 8312 KB Output is correct
4 Correct 13 ms 2304 KB Output is correct
5 Correct 11 ms 1536 KB Output is correct
6 Correct 18 ms 3072 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 42 ms 5112 KB Output is correct
9 Correct 42 ms 6776 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 57 ms 8568 KB Output is correct
12 Correct 68 ms 10360 KB Output is correct
13 Correct 5 ms 512 KB Output is correct
14 Incorrect 5 ms 384 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

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

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 12280 KB Output is correct
2 Correct 64 ms 12280 KB Output is correct
3 Correct 41 ms 8312 KB Output is correct
4 Correct 13 ms 2304 KB Output is correct
5 Correct 11 ms 1536 KB Output is correct
6 Correct 18 ms 3072 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 42 ms 5112 KB Output is correct
9 Correct 42 ms 6776 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 57 ms 8568 KB Output is correct
12 Correct 68 ms 10360 KB Output is correct
13 Correct 5 ms 512 KB Output is correct
14 Incorrect 5 ms 384 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 12280 KB Output is correct
2 Correct 64 ms 12280 KB Output is correct
3 Correct 41 ms 8312 KB Output is correct
4 Correct 13 ms 2304 KB Output is correct
5 Correct 11 ms 1536 KB Output is correct
6 Correct 18 ms 3072 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 42 ms 5112 KB Output is correct
9 Correct 42 ms 6776 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 57 ms 8568 KB Output is correct
12 Correct 68 ms 10360 KB Output is correct
13 Correct 5 ms 512 KB Output is correct
14 Incorrect 5 ms 384 KB Output isn't correct
15 Halted 0 ms 0 KB -