Submission #1161647

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1161647	2025-03-04 16:16:18	Aviansh	Fun Tour (APIO20_fun)	C++20	26 / 100	54 ms	15548 KiB

fun

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "fun.h"
#include <bits/stdc++.h>
using namespace std;
int f;
void dfs(int st, vector<int>(&g)[], int p, int dep, int d[], bool rem[]){
    d[st]=dep;
    if(d[f]<dep){
        f=st;
    }
    for(int i : g[st]){
        if(i==p||rem[i])
            continue;
        dfs(i,g,st,dep+1,d,rem);
    }
}
int findFarthest(int x, vector<int>(&g)[], bool rem[], int n){
    f=x;
    int d[n];
    fill(d,d+n,0);
    dfs(x,g,-1,0,d,rem);
    return f;
}
vector<int> createFunTour(int n, int q) {
  //  int H = hoursRequired(0, N - 1);
    //int A = attractionsBehind(0, N - 1);
    vector<int>g[n];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 10 / 10
• Subtask 2: 16 / 16
• Subtask 3: 0 / 21
• Subtask 4: 0 / 19
• Subtask 5: 0 / 34