oj.uz

Submission #1003372

# Submission time Handle Problem Language Result Execution time Memory
1003372 2024-06-20T09:22:11 Z vjudge1 Crocodile's Underground City (IOI11_crocodile) C++17
0 / 100
 0 ms 344 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f first
#define s second
#define pf push_front
#define pb push_back
#define pi pair<int,int>
#define vi vector<int>

const int MAX = 2001;
vi g[MAX];
ll ans = 0;
void dfs(int from , int p, ll dis){
    if(g[from].size()==1) ans = max(ans,dis);
    for(int to : g[from]){
        if(to==p)continue;
        dfs(to,from,dis+1);
    }
    
}

int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]){
     
     
     for(int i = 0; i< M; i++){
        int a = R[i][0];
        int b = R[i][1];
        g[a].pb(b);
        g[b].pb(a);
     }
     dfs(0,-1,0);
     return ans;
     
     
}

Subtask #1
0 / 46.0

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

Subtask #2
0 / 43.0

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

Subtask #3
0 / 11.0

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