oj.uz

Submission #56455

# Submission time Handle Problem Language Result Execution time Memory
56455 2018-07-11T11:44:31 Z Bodo171 Race (IOI11_race) C++14
9 / 100
 416 ms 78216 KB 
#include "race.h"
#include <vector>
#include <map>
#include <iostream>
using namespace std;
const int nmax=200005;
map<long long,int> m[nmax];
vector< pair<int,int> > v[nmax];
long long k;
long long L[nmax];
int rr[nmax],l[nmax],r[nmax],lev[nmax],w[nmax],p[nmax];
int mn,nr,paths,n,i;
void ver(int path,long long A,long long LCA,int lca,int x)
{
    //A+X-2*LCA=K
    //X=K-A+2*LCA
    if(m[path][k-A+2*LCA]&&m[path][k-A+2*LCA]+x-2*lca<mn)
        mn=m[path][k-A+2*LCA]+x-2*lca;
}
void baga(int path,long long A,int x)
{
    if((!m[path][A])||m[path][A]>x)
        m[path][A]=x;
}
void dfs(int x)
{
    int son=n+1,nod=0;
    rr[++nr]=x;l[x]=nr;w[x]=1;
    for(int i=0;i<v[x].size();i++)
        if(!w[v[x][i].first])
    {
        nod=v[x][i].first;
        lev[nod]=lev[x]+1;L[nod]=1LL*L[x]+v[x][i].second;
        dfs(nod);
        w[x]+=w[nod];
        if(w[nod]>w[son]) son=nod;
    }
    r[x]=nr;
    p[x]=p[son];
    if(son==n+1) p[x]=++paths;
    for(int i=0;i<v[x].size();i++)
        if(w[v[x][i].first]<=w[x]&&son!=v[x][i].first)
    {
        nod=v[x][i].first;
        for(int j=l[nod];j<=r[nod];j++)
        {
            ver(p[x],L[rr[j]],L[x],lev[x],lev[rr[j]]);
        }
        for(int j=l[nod];j<=r[nod];j++)
        {
            baga(p[x],L[rr[j]],lev[rr[j]]);
        }
    }
    ver(p[x],L[x],L[x],lev[x],lev[x]);
    baga(p[x],L[x],l[x]);
}
int best_path(int N, int K, int H[][2], int L[])
{
  n=N,k=K;
  for(i=0;i<n-1;i++)
  {
      v[H[i][0]].push_back({H[i][1],L[i]});
      v[H[i][1]].push_back({H[i][0],L[i]});
  }
  lev[0]=1;mn=n+1;
  dfs(0);
  if(mn==n+1) mn=-1;
  return mn;
}

Compilation message

race.cpp: In function 'void dfs(int)':
race.cpp:29:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<v[x].size();i++)
                 ~^~~~~~~~~~~~
race.cpp:41:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<v[x].size();i++)
                 ~^~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 14456 KB Output is correct
2 Correct 16 ms 14636 KB Output is correct
3 Correct 17 ms 14636 KB Output is correct
4 Correct 17 ms 14636 KB Output is correct
5 Correct 16 ms 14704 KB Output is correct
6 Correct 16 ms 14704 KB Output is correct
7 Correct 14 ms 14704 KB Output is correct
8 Correct 18 ms 14704 KB Output is correct
9 Correct 17 ms 14704 KB Output is correct
10 Correct 15 ms 14704 KB Output is correct
11 Correct 14 ms 14704 KB Output is correct
12 Correct 17 ms 14704 KB Output is correct
13 Correct 16 ms 14704 KB Output is correct
14 Correct 16 ms 14704 KB Output is correct
15 Correct 13 ms 14704 KB Output is correct
16 Correct 15 ms 14704 KB Output is correct
17 Correct 16 ms 14828 KB Output is correct
18 Correct 14 ms 14828 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 14456 KB Output is correct
2 Correct 16 ms 14636 KB Output is correct
3 Correct 17 ms 14636 KB Output is correct
4 Correct 17 ms 14636 KB Output is correct
5 Correct 16 ms 14704 KB Output is correct
6 Correct 16 ms 14704 KB Output is correct
7 Correct 14 ms 14704 KB Output is correct
8 Correct 18 ms 14704 KB Output is correct
9 Correct 17 ms 14704 KB Output is correct
10 Correct 15 ms 14704 KB Output is correct
11 Correct 14 ms 14704 KB Output is correct
12 Correct 17 ms 14704 KB Output is correct
13 Correct 16 ms 14704 KB Output is correct
14 Correct 16 ms 14704 KB Output is correct
15 Correct 13 ms 14704 KB Output is correct
16 Correct 15 ms 14704 KB Output is correct
17 Correct 16 ms 14828 KB Output is correct
18 Correct 14 ms 14828 KB Output is correct
19 Correct 14 ms 14828 KB Output is correct
20 Correct 15 ms 14828 KB Output is correct
21 Correct 16 ms 15084 KB Output is correct
22 Correct 20 ms 15356 KB Output is correct
23 Incorrect 17 ms 15356 KB Output isn't correct
24 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 14456 KB Output is correct
2 Correct 16 ms 14636 KB Output is correct
3 Correct 17 ms 14636 KB Output is correct
4 Correct 17 ms 14636 KB Output is correct
5 Correct 16 ms 14704 KB Output is correct
6 Correct 16 ms 14704 KB Output is correct
7 Correct 14 ms 14704 KB Output is correct
8 Correct 18 ms 14704 KB Output is correct
9 Correct 17 ms 14704 KB Output is correct
10 Correct 15 ms 14704 KB Output is correct
11 Correct 14 ms 14704 KB Output is correct
12 Correct 17 ms 14704 KB Output is correct
13 Correct 16 ms 14704 KB Output is correct
14 Correct 16 ms 14704 KB Output is correct
15 Correct 13 ms 14704 KB Output is correct
16 Correct 15 ms 14704 KB Output is correct
17 Correct 16 ms 14828 KB Output is correct
18 Correct 14 ms 14828 KB Output is correct
19 Correct 321 ms 44904 KB Output is correct
20 Correct 277 ms 46332 KB Output is correct
21 Correct 298 ms 48148 KB Output is correct
22 Correct 301 ms 49320 KB Output is correct
23 Correct 416 ms 78216 KB Output is correct
24 Correct 342 ms 78216 KB Output is correct
25 Incorrect 197 ms 78216 KB Output isn't correct
26 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 14456 KB Output is correct
2 Correct 16 ms 14636 KB Output is correct
3 Correct 17 ms 14636 KB Output is correct
4 Correct 17 ms 14636 KB Output is correct
5 Correct 16 ms 14704 KB Output is correct
6 Correct 16 ms 14704 KB Output is correct
7 Correct 14 ms 14704 KB Output is correct
8 Correct 18 ms 14704 KB Output is correct
9 Correct 17 ms 14704 KB Output is correct
10 Correct 15 ms 14704 KB Output is correct
11 Correct 14 ms 14704 KB Output is correct
12 Correct 17 ms 14704 KB Output is correct
13 Correct 16 ms 14704 KB Output is correct
14 Correct 16 ms 14704 KB Output is correct
15 Correct 13 ms 14704 KB Output is correct
16 Correct 15 ms 14704 KB Output is correct
17 Correct 16 ms 14828 KB Output is correct
18 Correct 14 ms 14828 KB Output is correct
19 Correct 14 ms 14828 KB Output is correct
20 Correct 15 ms 14828 KB Output is correct
21 Correct 16 ms 15084 KB Output is correct
22 Correct 20 ms 15356 KB Output is correct
23 Incorrect 17 ms 15356 KB Output isn't correct
24 Halted 0 ms 0 KB -