제출 #957438

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
957438	2024-04-03 17:13:58	Haidara314	경주 (Race) (IOI11_race)	C++17	100 / 100	320 ms	78672 KiB

race

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 "race.h"
#include <bits/stdc++.h>
#define ll long long
#define F first
#define S second
using namespace std;
int ans=1e9;
int k;
vector<pair<int,int>>adj[200005];
ll dep[200005];
int dis[200005];
map<ll,int> dfs(int u,int p)
{
    map<ll,int>y;
    y[dep[u]]=dis[u];
    for(auto x:adj[u])
    {
        if(x.F!=p)
        {
            dep[x.F]=dep[u]+x.S;
            dis[x.F]=dis[u]+1;
            map<ll,int>j=dfs(x.F,u);
            if(j.size()>=y.size())
                swap(j,y);
            for(auto f:j)
            {
                if(f.F-dep[u]<=k&&y.count(k-f.F+2*dep[u]))
                {
                    ans=min(ans,y[k-f.F+2*dep[u]]+f.S-2*dis[u]);
                }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 9 / 9
• Subtask 2: 12 / 12
• Subtask 3: 22 / 22
• Subtask 4: 57 / 57