oj.uz

Submission #1108353

# Submission time Handle Problem Language Result Execution time Memory
1108353 2024-11-03T22:49:48 Z SteveBro Race (IOI11_race) C++17
43 / 100
 3000 ms 44476 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)
{
    if(d<=p)
    {
        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)
{
    if(d<=p)
    {
        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

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12624 KB Output is correct
2 Correct 2 ms 12772 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 12792 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 2 ms 12752 KB Output is correct
12 Correct 2 ms 12624 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 12624 KB Output is correct
16 Correct 2 ms 12624 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

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12624 KB Output is correct
2 Correct 2 ms 12772 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 12792 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 2 ms 12752 KB Output is correct
12 Correct 2 ms 12624 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 12624 KB Output is correct
16 Correct 2 ms 12624 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 12624 KB Output is correct
21 Correct 2 ms 12624 KB Output is correct
22 Correct 2 ms 12876 KB Output is correct
23 Correct 2 ms 12624 KB Output is correct
24 Correct 2 ms 12624 KB Output is correct
25 Correct 2 ms 12624 KB Output is correct
26 Correct 2 ms 12624 KB Output is correct
27 Correct 2 ms 12624 KB Output is correct
28 Correct 2 ms 12624 KB Output is correct
29 Correct 3 ms 12624 KB Output is correct
30 Correct 3 ms 12792 KB Output is correct
31 Correct 3 ms 12624 KB Output is correct
32 Correct 3 ms 12624 KB Output is correct
33 Correct 3 ms 12640 KB Output is correct
34 Correct 3 ms 12804 KB Output is correct
35 Correct 3 ms 12624 KB Output is correct
36 Correct 3 ms 12624 KB Output is correct
37 Correct 3 ms 12636 KB Output is correct
38 Correct 3 ms 12624 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12624 KB Output is correct
2 Correct 2 ms 12772 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 12792 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 2 ms 12752 KB Output is correct
12 Correct 2 ms 12624 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 12624 KB Output is correct
16 Correct 2 ms 12624 KB Output is correct
17 Correct 2 ms 12624 KB Output is correct
18 Correct 2 ms 12624 KB Output is correct
19 Correct 86 ms 18504 KB Output is correct
20 Correct 83 ms 18524 KB Output is correct
21 Correct 97 ms 18512 KB Output is correct
22 Correct 82 ms 18712 KB Output is correct
23 Correct 63 ms 18680 KB Output is correct
24 Correct 39 ms 18760 KB Output is correct
25 Correct 83 ms 26448 KB Output is correct
26 Correct 73 ms 27452 KB Output is correct
27 Correct 96 ms 22492 KB Output is correct
28 Correct 144 ms 38476 KB Output is correct
29 Correct 141 ms 35400 KB Output is correct
30 Correct 110 ms 25416 KB Output is correct
31 Correct 105 ms 25416 KB Output is correct
32 Correct 113 ms 25400 KB Output is correct
33 Correct 137 ms 24336 KB Output is correct
34 Correct 108 ms 25228 KB Output is correct

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12624 KB Output is correct
2 Correct 2 ms 12772 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 12792 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 2 ms 12752 KB Output is correct
12 Correct 2 ms 12624 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 12624 KB Output is correct
16 Correct 2 ms 12624 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 12624 KB Output is correct
21 Correct 2 ms 12624 KB Output is correct
22 Correct 2 ms 12876 KB Output is correct
23 Correct 2 ms 12624 KB Output is correct
24 Correct 2 ms 12624 KB Output is correct
25 Correct 2 ms 12624 KB Output is correct
26 Correct 2 ms 12624 KB Output is correct
27 Correct 2 ms 12624 KB Output is correct
28 Correct 2 ms 12624 KB Output is correct
29 Correct 3 ms 12624 KB Output is correct
30 Correct 3 ms 12792 KB Output is correct
31 Correct 3 ms 12624 KB Output is correct
32 Correct 3 ms 12624 KB Output is correct
33 Correct 3 ms 12640 KB Output is correct
34 Correct 3 ms 12804 KB Output is correct
35 Correct 3 ms 12624 KB Output is correct
36 Correct 3 ms 12624 KB Output is correct
37 Correct 3 ms 12636 KB Output is correct
38 Correct 3 ms 12624 KB Output is correct
39 Correct 86 ms 18504 KB Output is correct
40 Correct 83 ms 18524 KB Output is correct
41 Correct 97 ms 18512 KB Output is correct
42 Correct 82 ms 18712 KB Output is correct
43 Correct 63 ms 18680 KB Output is correct
44 Correct 39 ms 18760 KB Output is correct
45 Correct 83 ms 26448 KB Output is correct
46 Correct 73 ms 27452 KB Output is correct
47 Correct 96 ms 22492 KB Output is correct
48 Correct 144 ms 38476 KB Output is correct
49 Correct 141 ms 35400 KB Output is correct
50 Correct 110 ms 25416 KB Output is correct
51 Correct 105 ms 25416 KB Output is correct
52 Correct 113 ms 25400 KB Output is correct
53 Correct 137 ms 24336 KB Output is correct
54 Correct 108 ms 25228 KB Output is correct
55 Correct 12 ms 13392 KB Output is correct
56 Correct 9 ms 13136 KB Output is correct
57 Correct 62 ms 20048 KB Output is correct
58 Correct 30 ms 19928 KB Output is correct
59 Correct 880 ms 31692 KB Output is correct
60 Execution timed out 3065 ms 44476 KB Time limit exceeded
61 Halted 0 ms 0 KB -