oj.uz

답안 #1108352

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1108352 2024-11-03T22:41:21 Z SteveBro 경주 (Race) (IOI11_race) C++17
21 / 100
 3000 ms 48104 KB 
#include <bits/stdc++.h>

using namespace std;
int mat[200001][2],ll[200001],p;
const int inf=1e9;
struct ura
{
    int t,s;
    bool ok;
}v[200001];
vector < pair<int,int> > g[200001];
int sol;
void dfs(int nod, int n)
{
    bool ok=true;
    v[nod].s=1;
    for(auto x : g[nod])
    {
        if(!v[x.first].ok&&v[nod].t!=x.first)
        {
            v[x.first].t=nod;
            dfs(x.first,n);
            v[nod].s+=v[x.first].s;
            if(v[x.first].s>n/2)
                ok=false;
        }
    }
    if(n-v[nod].s>n/2)
        ok=false;
    if(ok)
        sol=nod;
}
unordered_map <long long,int> maph;
std :: unordered_map <long long,int> :: iterator it;
int rez=inf;
void dfs1(int nod, long long d, int nrm)
{
    it=maph.find(p-d);
    if(it!=maph.end())
        rez=min(rez,(*it).second+nrm);
    for(auto x : g[nod])
    {
        if(!v[x.first].ok&&x.first!=v[nod].t)
        {
            v[x.first].t=nod;
            dfs1(x.first,d+x.second,nrm+1);
        }
    }
}
void dfs2(int nod, long long d, int nrm)
{
    it=maph.find(d);
    if(it==maph.end())
        maph.insert(make_pair(d,nrm));
    else
        maph.at(d)=min(maph.at(d),nrm);
    for(auto x : g[nod])
    {
        if(!v[x.first].ok&&x.first!=v[nod].t)
        {
            v[x.first].t=nod;
            dfs2(x.first,d+x.second,nrm+1);
        }
    }
}
void divide(int nod, int nr)
{
    if(nr==1)
        return;
    maph.clear();
    maph.insert(make_pair(0,0));
    dfs(nod,nr);
    int ctd=sol;
    for(auto x : g[ctd])
    {
        if(!v[x.first].ok)
        {
            v[x.first].t=ctd;
            dfs1(x.first,x.second,1);
            dfs2(x.first,x.second,1);
        }
    }
    v[ctd].ok=true;
    v[v[ctd].t].s=nr-v[ctd].s;
    for(auto x : g[ctd])
    {
        if(!v[x.first].ok)
        {
            v[x.first].t=ctd;
            divide(x.first,v[x.first].s);
        }
    }
}
int best_path(int n,int k,int h[][2],int l[])
{
    int i;
    for(i=0;i<n-1;i++)
    {
        g[h[i][0]].push_back(make_pair(h[i][1],l[i]));
        g[h[i][1]].push_back(make_pair(h[i][0],l[i]));
    }
    p=k;
    v[1].t=n;
    divide(1,n);
    if(rez==inf)
        rez=-1;
    return rez;
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 12624 KB Output is correct
2 Correct 2 ms 12624 KB Output is correct
3 Correct 2 ms 12624 KB Output is correct
4 Correct 2 ms 12624 KB Output is correct
5 Correct 2 ms 12624 KB Output is correct
6 Correct 2 ms 12624 KB Output is correct
7 Correct 2 ms 12624 KB Output is correct
8 Correct 2 ms 12624 KB Output is correct
9 Correct 2 ms 12624 KB Output is correct
10 Correct 2 ms 12624 KB Output is correct
11 Correct 3 ms 12624 KB Output is correct
12 Correct 2 ms 12760 KB Output is correct
13 Correct 2 ms 12624 KB Output is correct
14 Correct 2 ms 12624 KB Output is correct
15 Correct 2 ms 12796 KB Output is correct
16 Correct 2 ms 12760 KB Output is correct
17 Correct 2 ms 12624 KB Output is correct
18 Correct 2 ms 12624 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 12624 KB Output is correct
2 Correct 2 ms 12624 KB Output is correct
3 Correct 2 ms 12624 KB Output is correct
4 Correct 2 ms 12624 KB Output is correct
5 Correct 2 ms 12624 KB Output is correct
6 Correct 2 ms 12624 KB Output is correct
7 Correct 2 ms 12624 KB Output is correct
8 Correct 2 ms 12624 KB Output is correct
9 Correct 2 ms 12624 KB Output is correct
10 Correct 2 ms 12624 KB Output is correct
11 Correct 3 ms 12624 KB Output is correct
12 Correct 2 ms 12760 KB Output is correct
13 Correct 2 ms 12624 KB Output is correct
14 Correct 2 ms 12624 KB Output is correct
15 Correct 2 ms 12796 KB Output is correct
16 Correct 2 ms 12760 KB Output is correct
17 Correct 2 ms 12624 KB Output is correct
18 Correct 2 ms 12624 KB Output is correct
19 Correct 2 ms 12624 KB Output is correct
20 Correct 2 ms 12636 KB Output is correct
21 Correct 2 ms 12624 KB Output is correct
22 Correct 3 ms 12624 KB Output is correct
23 Correct 3 ms 12796 KB Output is correct
24 Correct 3 ms 12692 KB Output is correct
25 Correct 3 ms 12624 KB Output is correct
26 Correct 3 ms 12624 KB Output is correct
27 Correct 2 ms 12820 KB Output is correct
28 Correct 3 ms 12624 KB Output is correct
29 Correct 3 ms 12792 KB Output is correct
30 Correct 3 ms 12852 KB Output is correct
31 Correct 3 ms 12624 KB Output is correct
32 Correct 3 ms 12764 KB Output is correct
33 Correct 3 ms 12988 KB Output is correct
34 Correct 2 ms 12624 KB Output is correct
35 Correct 4 ms 12792 KB Output is correct
36 Correct 3 ms 12624 KB Output is correct
37 Correct 3 ms 12624 KB Output is correct
38 Correct 3 ms 12624 KB Output is correct

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 12624 KB Output is correct
2 Correct 2 ms 12624 KB Output is correct
3 Correct 2 ms 12624 KB Output is correct
4 Correct 2 ms 12624 KB Output is correct
5 Correct 2 ms 12624 KB Output is correct
6 Correct 2 ms 12624 KB Output is correct
7 Correct 2 ms 12624 KB Output is correct
8 Correct 2 ms 12624 KB Output is correct
9 Correct 2 ms 12624 KB Output is correct
10 Correct 2 ms 12624 KB Output is correct
11 Correct 3 ms 12624 KB Output is correct
12 Correct 2 ms 12760 KB Output is correct
13 Correct 2 ms 12624 KB Output is correct
14 Correct 2 ms 12624 KB Output is correct
15 Correct 2 ms 12796 KB Output is correct
16 Correct 2 ms 12760 KB Output is correct
17 Correct 2 ms 12624 KB Output is correct
18 Correct 2 ms 12624 KB Output is correct
19 Correct 112 ms 18504 KB Output is correct
20 Correct 104 ms 18504 KB Output is correct
21 Correct 110 ms 18512 KB Output is correct
22 Correct 82 ms 18512 KB Output is correct
23 Correct 94 ms 18932 KB Output is correct
24 Correct 48 ms 18768 KB Output is correct
25 Correct 209 ms 26696 KB Output is correct
26 Correct 70 ms 27472 KB Output is correct
27 Correct 153 ms 22496 KB Output is correct
28 Execution timed out 3068 ms 48104 KB Time limit exceeded
29 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 12624 KB Output is correct
2 Correct 2 ms 12624 KB Output is correct
3 Correct 2 ms 12624 KB Output is correct
4 Correct 2 ms 12624 KB Output is correct
5 Correct 2 ms 12624 KB Output is correct
6 Correct 2 ms 12624 KB Output is correct
7 Correct 2 ms 12624 KB Output is correct
8 Correct 2 ms 12624 KB Output is correct
9 Correct 2 ms 12624 KB Output is correct
10 Correct 2 ms 12624 KB Output is correct
11 Correct 3 ms 12624 KB Output is correct
12 Correct 2 ms 12760 KB Output is correct
13 Correct 2 ms 12624 KB Output is correct
14 Correct 2 ms 12624 KB Output is correct
15 Correct 2 ms 12796 KB Output is correct
16 Correct 2 ms 12760 KB Output is correct
17 Correct 2 ms 12624 KB Output is correct
18 Correct 2 ms 12624 KB Output is correct
19 Correct 2 ms 12624 KB Output is correct
20 Correct 2 ms 12636 KB Output is correct
21 Correct 2 ms 12624 KB Output is correct
22 Correct 3 ms 12624 KB Output is correct
23 Correct 3 ms 12796 KB Output is correct
24 Correct 3 ms 12692 KB Output is correct
25 Correct 3 ms 12624 KB Output is correct
26 Correct 3 ms 12624 KB Output is correct
27 Correct 2 ms 12820 KB Output is correct
28 Correct 3 ms 12624 KB Output is correct
29 Correct 3 ms 12792 KB Output is correct
30 Correct 3 ms 12852 KB Output is correct
31 Correct 3 ms 12624 KB Output is correct
32 Correct 3 ms 12764 KB Output is correct
33 Correct 3 ms 12988 KB Output is correct
34 Correct 2 ms 12624 KB Output is correct
35 Correct 4 ms 12792 KB Output is correct
36 Correct 3 ms 12624 KB Output is correct
37 Correct 3 ms 12624 KB Output is correct
38 Correct 3 ms 12624 KB Output is correct
39 Correct 112 ms 18504 KB Output is correct
40 Correct 104 ms 18504 KB Output is correct
41 Correct 110 ms 18512 KB Output is correct
42 Correct 82 ms 18512 KB Output is correct
43 Correct 94 ms 18932 KB Output is correct
44 Correct 48 ms 18768 KB Output is correct
45 Correct 209 ms 26696 KB Output is correct
46 Correct 70 ms 27472 KB Output is correct
47 Correct 153 ms 22496 KB Output is correct
48 Execution timed out 3068 ms 48104 KB Time limit exceeded
49 Halted 0 ms 0 KB -