oj.uz

Submission #1021940

# Submission time Handle Problem Language Result Execution time Memory
1021940 2024-07-13T07:59:22 Z amine_aroua Dreaming (IOI13_dreaming) C++17
0 / 100
 1000 ms 11344 KB 
#include "dreaming.h"
#include<bits/stdc++.h>
using namespace std;
vector<vector<pair<int ,int>>> adj;
vector<int> center;
vector<bool> vis;
int mx = 0;
int y = 0;
int z = 0;
void dfs1(int x , int p = -1 , int d = 0)
{
    vis[x] = 1;
    if(mx <= d)
    {
        mx = d;
        y = x;
    }
    for(auto [u , c] : adj[x])
    {
        if(u == p)
            continue;
        dfs1(u , x , d + c);
    }
}
vector<pair<int ,int>> par;
void dfs2(int x , int p = -1 , int d = 0)
{
    if(mx <= d)
    {
        mx = d;
        z = x;
    }
    for(auto [u , c] : adj[x])
    {
        if(u == p)
            continue;
        par[u]= {x , c};
        dfs2(u , x , d + c);
    }
}
int travelTime(int N, int M, int L, int A[], int B[], int T[])
{
    adj.assign(N , {});
    vis.assign(N , 0);
    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])
        {
            y = 0;
            mx = 0;
            dfs1(i);
            mx = 0;
            z = 0;
            par.assign(N , {-1 , -1});
            dfs2(y);
            int sm = 0;
            int mid = z;
            while(par[z].first != -1 && 2 * sm < mx)
            {
                sm += par[z].second;
                mid = par[z].first;
                z = par[z].first;
            }
            center.push_back(mid);
        }
    }
    adj[center[0]].push_back({center[1] ,L});
    adj[center[1]].push_back({center[0] , L});
    y = 0;
    mx = 0;
    vis.assign(N , 0);
    dfs1(0 , -1 , 0);
    mx = 0;
    z = 0;
    dfs2(y);
    return mx;
}

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 11344 KB Output is correct
2 Correct 34 ms 11344 KB Output is correct
3 Correct 21 ms 7516 KB Output is correct
4 Correct 5 ms 1884 KB Output is correct
5 Correct 4 ms 1372 KB Output is correct
6 Correct 9 ms 2676 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 18 ms 4436 KB Output is correct
9 Correct 24 ms 5980 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 32 ms 7700 KB Output is correct
12 Correct 38 ms 9564 KB Output is correct
13 Incorrect 1 ms 348 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

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

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 11344 KB Output is correct
2 Correct 34 ms 11344 KB Output is correct
3 Correct 21 ms 7516 KB Output is correct
4 Correct 5 ms 1884 KB Output is correct
5 Correct 4 ms 1372 KB Output is correct
6 Correct 9 ms 2676 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 18 ms 4436 KB Output is correct
9 Correct 24 ms 5980 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 32 ms 7700 KB Output is correct
12 Correct 38 ms 9564 KB Output is correct
13 Incorrect 1 ms 348 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1038 ms 5720 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

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

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 11344 KB Output is correct
2 Correct 34 ms 11344 KB Output is correct
3 Correct 21 ms 7516 KB Output is correct
4 Correct 5 ms 1884 KB Output is correct
5 Correct 4 ms 1372 KB Output is correct
6 Correct 9 ms 2676 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 18 ms 4436 KB Output is correct
9 Correct 24 ms 5980 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 32 ms 7700 KB Output is correct
12 Correct 38 ms 9564 KB Output is correct
13 Incorrect 1 ms 348 KB Output isn't correct
14 Halted 0 ms 0 KB -