oj.uz

Submission #978331

# Submission time Handle Problem Language Result Execution time Memory
978331 2024-05-09T06:25:20 Z simona1230 Race (IOI11_race) C++17
21 / 100
 3000 ms 60536 KB 
#include <bits/stdc++.h>
#include "race.h"
using namespace std;

int n,k;
vector<int> v[200001];
vector<int> w[200001];
map<int,int> mp[200001];
int sz[200001];
int used[200001];
int ans;

void dfs(int i,int p)
{
    for(int j=0;j<v[i].size();j++)
    {
        int nb=v[i][j],wg=w[i][j];
        if(nb==p||used[nb])continue;

        dfs(nb,i);
        //cout<<nb<<" --- "<<wg<<endl;
        for(auto it=mp[nb].begin();it!=mp[nb].end();it++)
        {
            int vl=it->first+wg;
            int cnt=it->second+1;
            if(mp[i].find(k-vl)!=mp[i].end())
            {
                //if(mp[i][k-vl]+cnt<30)cout<<i<<" - "<<k-vl<<" - "<<vl<<" "<<mp[i][k-vl]+cnt<<" "<<mp[i][k-vl]<<" "<<cnt<<endl;
                ans=min(ans,mp[i][k-vl]+cnt);
            }
        }
        if(mp[i].find(k-wg)!=mp[i].end())
            ans=min(ans,mp[i][k-wg]+1);
        for(auto it=mp[nb].begin();it!=mp[nb].end();it++)
        {
            int vl=it->first+wg;
            int cnt=it->second+1;
            if(vl==k)
            {
                //cout<<cnt<<endl;
                ans=min(ans,cnt);
            }
            mp[i][vl]=min(mp[i][vl],cnt);
            if(mp[i][vl]==0)mp[i][vl]=cnt;
            //cout<<i<<"->"<<vl<<" "<<mp[i][vl]<<" "<<it->first<<" "<<it->second<<endl;
        }

        mp[i][wg]=1;
        if(wg==k)ans=1;
        mp[nb].clear();
    }
    //for(auto it=mp[i].begin();it!=mp[i].end();it++)
    //    cout<<i<<" * "<<it->first<<" * "<<it->second<<endl;
}


void calc(int i,int p)
{
    //cout<<i<<endl;
    sz[i]=1;
    for(int j=0;j<v[i].size();j++)
    {
        int nb=v[i][j];
        if(nb==p||used[nb])continue;

        calc(nb,i);
        sz[i]+=sz[nb];
    }
}

int centroid(int i,int p)
{
    //cout<<"in "<<i<<endl;
    for(int j=0;j<v[i].size();j++)
    {
        int nb=v[i][j];
        if(nb==p||used[nb])continue;
        if(sz[nb]>n/2)return centroid(nb,i);
    }
    return i;
}

void solve(int i)
{
    //cout<<i<<endl;
    calc(i,n);
    int c=centroid(i,n);
    ///cout<<"* "<<c<<endl;

    dfs(c,n);
    used[c]=1;
    for(int j=0;j<v[c].size();j++)
    {
        int nb=v[c][j];
        if(!used[nb])solve(nb);
    }
}

int best_path(int N, int K, int H[][2], int L[])
{
    n=N;
    k=K;
    ans=n;
    for(int i=0;i<n-1;i++)
    {
        v[H[i][0]].push_back(H[i][1]);
        v[H[i][1]].push_back(H[i][0]);
        w[H[i][0]].push_back(L[i]);
        w[H[i][1]].push_back(L[i]);
        //cout<<H[i][0]<<" "<<H[i][1]<<endl;
    }

    /*for(int i=0;i<n;i++)
    {
        cout<<i<<" ";
        for(int j=0;j<v[i].size();j++)
            cout<<v[i][j]<<"/"<<w[i][j]<<" ";
        cout<<endl;
    }*/

    solve(0);
    if(ans==n)ans=-1;
    return ans;
}

Compilation message

race.cpp: In function 'void dfs(int, int)':
race.cpp:15:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |     for(int j=0;j<v[i].size();j++)
      |                 ~^~~~~~~~~~~~
race.cpp: In function 'void calc(int, int)':
race.cpp:61:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |     for(int j=0;j<v[i].size();j++)
      |                 ~^~~~~~~~~~~~
race.cpp: In function 'int centroid(int, int)':
race.cpp:74:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |     for(int j=0;j<v[i].size();j++)
      |                 ~^~~~~~~~~~~~
race.cpp: In function 'void solve(int)':
race.cpp:92:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   92 |     for(int j=0;j<v[c].size();j++)
      |                 ~^~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 19292 KB Output is correct
2 Correct 12 ms 19264 KB Output is correct
3 Correct 12 ms 19292 KB Output is correct
4 Correct 9 ms 19036 KB Output is correct
5 Correct 12 ms 19292 KB Output is correct
6 Correct 10 ms 19292 KB Output is correct
7 Correct 12 ms 19292 KB Output is correct
8 Correct 11 ms 19292 KB Output is correct
9 Correct 12 ms 19264 KB Output is correct
10 Correct 12 ms 19292 KB Output is correct
11 Correct 11 ms 19292 KB Output is correct
12 Correct 11 ms 19304 KB Output is correct
13 Correct 11 ms 19292 KB Output is correct
14 Correct 13 ms 19288 KB Output is correct
15 Correct 11 ms 19156 KB Output is correct
16 Correct 11 ms 19292 KB Output is correct
17 Correct 10 ms 19316 KB Output is correct
18 Correct 11 ms 19304 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 19292 KB Output is correct
2 Correct 12 ms 19264 KB Output is correct
3 Correct 12 ms 19292 KB Output is correct
4 Correct 9 ms 19036 KB Output is correct
5 Correct 12 ms 19292 KB Output is correct
6 Correct 10 ms 19292 KB Output is correct
7 Correct 12 ms 19292 KB Output is correct
8 Correct 11 ms 19292 KB Output is correct
9 Correct 12 ms 19264 KB Output is correct
10 Correct 12 ms 19292 KB Output is correct
11 Correct 11 ms 19292 KB Output is correct
12 Correct 11 ms 19304 KB Output is correct
13 Correct 11 ms 19292 KB Output is correct
14 Correct 13 ms 19288 KB Output is correct
15 Correct 11 ms 19156 KB Output is correct
16 Correct 11 ms 19292 KB Output is correct
17 Correct 10 ms 19316 KB Output is correct
18 Correct 11 ms 19304 KB Output is correct
19 Correct 9 ms 19032 KB Output is correct
20 Correct 9 ms 19036 KB Output is correct
21 Correct 12 ms 19548 KB Output is correct
22 Correct 24 ms 19920 KB Output is correct
23 Correct 27 ms 20064 KB Output is correct
24 Correct 15 ms 19548 KB Output is correct
25 Correct 14 ms 19512 KB Output is correct
26 Correct 12 ms 19548 KB Output is correct
27 Correct 10 ms 19292 KB Output is correct
28 Correct 13 ms 19548 KB Output is correct
29 Correct 12 ms 19544 KB Output is correct
30 Correct 13 ms 19744 KB Output is correct
31 Correct 12 ms 19780 KB Output is correct
32 Correct 13 ms 19544 KB Output is correct
33 Correct 21 ms 19804 KB Output is correct
34 Correct 289 ms 22616 KB Output is correct
35 Correct 381 ms 23100 KB Output is correct
36 Correct 538 ms 23776 KB Output is correct
37 Correct 423 ms 23196 KB Output is correct
38 Correct 150 ms 21576 KB Output is correct

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 19292 KB Output is correct
2 Correct 12 ms 19264 KB Output is correct
3 Correct 12 ms 19292 KB Output is correct
4 Correct 9 ms 19036 KB Output is correct
5 Correct 12 ms 19292 KB Output is correct
6 Correct 10 ms 19292 KB Output is correct
7 Correct 12 ms 19292 KB Output is correct
8 Correct 11 ms 19292 KB Output is correct
9 Correct 12 ms 19264 KB Output is correct
10 Correct 12 ms 19292 KB Output is correct
11 Correct 11 ms 19292 KB Output is correct
12 Correct 11 ms 19304 KB Output is correct
13 Correct 11 ms 19292 KB Output is correct
14 Correct 13 ms 19288 KB Output is correct
15 Correct 11 ms 19156 KB Output is correct
16 Correct 11 ms 19292 KB Output is correct
17 Correct 10 ms 19316 KB Output is correct
18 Correct 11 ms 19304 KB Output is correct
19 Correct 1766 ms 55248 KB Output is correct
20 Correct 1673 ms 56384 KB Output is correct
21 Correct 1127 ms 50120 KB Output is correct
22 Correct 501 ms 43860 KB Output is correct
23 Correct 1135 ms 60536 KB Output is correct
24 Correct 267 ms 39168 KB Output is correct
25 Execution timed out 3059 ms 35972 KB Time limit exceeded
26 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 19292 KB Output is correct
2 Correct 12 ms 19264 KB Output is correct
3 Correct 12 ms 19292 KB Output is correct
4 Correct 9 ms 19036 KB Output is correct
5 Correct 12 ms 19292 KB Output is correct
6 Correct 10 ms 19292 KB Output is correct
7 Correct 12 ms 19292 KB Output is correct
8 Correct 11 ms 19292 KB Output is correct
9 Correct 12 ms 19264 KB Output is correct
10 Correct 12 ms 19292 KB Output is correct
11 Correct 11 ms 19292 KB Output is correct
12 Correct 11 ms 19304 KB Output is correct
13 Correct 11 ms 19292 KB Output is correct
14 Correct 13 ms 19288 KB Output is correct
15 Correct 11 ms 19156 KB Output is correct
16 Correct 11 ms 19292 KB Output is correct
17 Correct 10 ms 19316 KB Output is correct
18 Correct 11 ms 19304 KB Output is correct
19 Correct 9 ms 19032 KB Output is correct
20 Correct 9 ms 19036 KB Output is correct
21 Correct 12 ms 19548 KB Output is correct
22 Correct 24 ms 19920 KB Output is correct
23 Correct 27 ms 20064 KB Output is correct
24 Correct 15 ms 19548 KB Output is correct
25 Correct 14 ms 19512 KB Output is correct
26 Correct 12 ms 19548 KB Output is correct
27 Correct 10 ms 19292 KB Output is correct
28 Correct 13 ms 19548 KB Output is correct
29 Correct 12 ms 19544 KB Output is correct
30 Correct 13 ms 19744 KB Output is correct
31 Correct 12 ms 19780 KB Output is correct
32 Correct 13 ms 19544 KB Output is correct
33 Correct 21 ms 19804 KB Output is correct
34 Correct 289 ms 22616 KB Output is correct
35 Correct 381 ms 23100 KB Output is correct
36 Correct 538 ms 23776 KB Output is correct
37 Correct 423 ms 23196 KB Output is correct
38 Correct 150 ms 21576 KB Output is correct
39 Correct 1766 ms 55248 KB Output is correct
40 Correct 1673 ms 56384 KB Output is correct
41 Correct 1127 ms 50120 KB Output is correct
42 Correct 501 ms 43860 KB Output is correct
43 Correct 1135 ms 60536 KB Output is correct
44 Correct 267 ms 39168 KB Output is correct
45 Execution timed out 3059 ms 35972 KB Time limit exceeded
46 Halted 0 ms 0 KB -