Submission #857793

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
857793	2023-10-07 01:47:44	NguyenTN091106	Putovanje (COCI20_putovanje)	C++14	110 / 110	92 ms	28520 KiB

putovanje

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 <bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define mp(x,y) make_pair((x),(y))
#define bit(x,i) (((x)>>(i))&1)
#define MASK(i) (1<<(i))
#define randomize mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count())
using namespace std;
const int maxn=2e5+5;
const ll oo=2e18+5;
const int MOD=1e9+7;
const int inf=1e9+7;
void init()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
}
int n,c[2][maxn],pa[maxn][20],depth[maxn];
vector< pair<int,int> > adj[maxn];
void dfs(int u,int pre)
{
    for(int it=0;it<(int)adj[u].size();it++)
    {
        int v=adj[u][it].ff;
        if(v==pre) continue;
        depth[v]=depth[u]+1;
        pa[v][0]=u;
        for(int j=1;j<=18;j++) pa[v][j]=pa[pa[v][j-1]][j-1];
        dfs(v,u);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 20 / 20
• Subtask 2: 25 / 25
• Subtask 3: 65 / 65