oj.uz

Submission #970294

# Submission time Handle Problem Language Result Execution time Memory
970294 2024-04-26T10:26:28 Z tset Race (IOI11_race) C++14
43 / 100
 3000 ms 41424 KB 
#include "race.h"
#include<bits/stdc++.h>

using namespace std;

const int INF = 1e9+42;

#define pii pair<int, int>

int nbNodes, requestedSum;
vector<vector<pii>> voisinDe;
vector<int> profSubtree;
vector<bool> interdit;

int lenSubTree;

int dfs(int nde, int ansc)
{
    int ans = 1;
    for(pii iV : voisinDe[nde])
    {
        if(!interdit[iV.first] && iV.first != ansc)
        {
            ans += dfs(iV.first, nde);
        }
    }
    profSubtree[nde] = ans;
    return ans;
}
int getCentroid(int nde, int ansc)
{
    for(pii iV : voisinDe[nde])
    {
        if(!interdit[iV.first] && iV.first!= ansc)
        {
            if(profSubtree[iV.first] > (lenSubTree)/2)
            {
                return getCentroid(iV.first, nde);
            }
        }
    }
    return nde;
}

vector<pii> minDistToLen;
vector<pii> toUpd;//sum, len;

int timer;

int findLenghts(int nde, int ansc, int sum, int len)
{
    int ans = INF;
    if(sum > requestedSum)
        return INF;
    if(sum == requestedSum)
        return len;
    toUpd.push_back({sum, len});

    int sumRemain = requestedSum - sum;
    if(minDistToLen[sumRemain].first == timer)
        ans = len + minDistToLen[sumRemain].second;
    for(pii iV : voisinDe[nde])
    {
        if(!interdit[iV.first] && iV.first != ansc)
        {
            ans = min(ans, findLenghts(iV.first, nde, sum + iV.second, len+1));
        }
    }
    return ans;
}
int findMinPath(int nde)
{
    //printf("[centroid : %d]", nde);
    int ans = INF;
    for(pii iV : voisinDe[nde])
    {
        toUpd.clear();
        ans = min(findLenghts(iV.first, nde, iV.second, 1), ans);
        for(pii updAct : toUpd)
        {
            minDistToLen[updAct.first] = min(minDistToLen[updAct.first], {timer ,updAct.second});
        }
    }
    return ans;
} 

int best_path(int N, int K, int H[][2], int L[])
{
    nbNodes = N;
    requestedSum = K;
    profSubtree.resize(nbNodes);
    timer = 2*nbNodes;
    interdit.assign(nbNodes,  false);
    voisinDe.resize(nbNodes);
    minDistToLen.assign(1000042, {INF, INF});
    for(int i =0; i< nbNodes-1; i++)
    {
        voisinDe[H[i][0]].push_back({H[i][1], L[i]});
        voisinDe[H[i][1]].push_back({H[i][0], L[i]});
    }
    deque<int> process;
    lenSubTree = dfs(0, -1);
    int centroid = getCentroid(0, -1);
    process.push_back(centroid);
    int ansMin = INF;
    while (!process.empty())
    {
        int ndeToProcess = process.front();
        process.pop_front();
        interdit[ndeToProcess] = true;
        int ansAct=findMinPath(ndeToProcess);
        ansMin = min(ansMin, ansAct);
        timer--;
        for(pii iV : voisinDe[ndeToProcess])
        {
            if(!interdit[iV.first])
            {
                
                lenSubTree = dfs(iV.first, -1);
                centroid = getCentroid(iV.first, -1);
                process.push_back(centroid);
            }
        }
    }
    if(ansMin == INF)
        return -1;
    return ansMin;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 10328 KB Output is correct
2 Correct 3 ms 10332 KB Output is correct
3 Correct 3 ms 10332 KB Output is correct
4 Correct 3 ms 10332 KB Output is correct
5 Correct 3 ms 10332 KB Output is correct
6 Correct 2 ms 10332 KB Output is correct
7 Correct 3 ms 10332 KB Output is correct
8 Correct 3 ms 10332 KB Output is correct
9 Correct 2 ms 10332 KB Output is correct
10 Correct 4 ms 10228 KB Output is correct
11 Correct 3 ms 10332 KB Output is correct
12 Correct 2 ms 10332 KB Output is correct
13 Correct 2 ms 10332 KB Output is correct
14 Correct 3 ms 10332 KB Output is correct
15 Correct 2 ms 10332 KB Output is correct
16 Correct 3 ms 10144 KB Output is correct
17 Correct 3 ms 10332 KB Output is correct
18 Correct 3 ms 10332 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 10328 KB Output is correct
2 Correct 3 ms 10332 KB Output is correct
3 Correct 3 ms 10332 KB Output is correct
4 Correct 3 ms 10332 KB Output is correct
5 Correct 3 ms 10332 KB Output is correct
6 Correct 2 ms 10332 KB Output is correct
7 Correct 3 ms 10332 KB Output is correct
8 Correct 3 ms 10332 KB Output is correct
9 Correct 2 ms 10332 KB Output is correct
10 Correct 4 ms 10228 KB Output is correct
11 Correct 3 ms 10332 KB Output is correct
12 Correct 2 ms 10332 KB Output is correct
13 Correct 2 ms 10332 KB Output is correct
14 Correct 3 ms 10332 KB Output is correct
15 Correct 2 ms 10332 KB Output is correct
16 Correct 3 ms 10144 KB Output is correct
17 Correct 3 ms 10332 KB Output is correct
18 Correct 3 ms 10332 KB Output is correct
19 Correct 5 ms 10332 KB Output is correct
20 Correct 3 ms 10584 KB Output is correct
21 Correct 3 ms 10176 KB Output is correct
22 Correct 3 ms 10176 KB Output is correct
23 Correct 4 ms 10328 KB Output is correct
24 Correct 5 ms 10332 KB Output is correct
25 Correct 8 ms 10332 KB Output is correct
26 Correct 3 ms 10356 KB Output is correct
27 Correct 3 ms 10332 KB Output is correct
28 Correct 4 ms 10172 KB Output is correct
29 Correct 4 ms 10332 KB Output is correct
30 Correct 3 ms 10180 KB Output is correct
31 Correct 4 ms 10328 KB Output is correct
32 Correct 4 ms 10332 KB Output is correct
33 Correct 4 ms 10332 KB Output is correct
34 Correct 4 ms 10328 KB Output is correct
35 Correct 3 ms 10332 KB Output is correct
36 Correct 5 ms 10332 KB Output is correct
37 Correct 3 ms 10328 KB Output is correct
38 Correct 3 ms 10584 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 10328 KB Output is correct
2 Correct 3 ms 10332 KB Output is correct
3 Correct 3 ms 10332 KB Output is correct
4 Correct 3 ms 10332 KB Output is correct
5 Correct 3 ms 10332 KB Output is correct
6 Correct 2 ms 10332 KB Output is correct
7 Correct 3 ms 10332 KB Output is correct
8 Correct 3 ms 10332 KB Output is correct
9 Correct 2 ms 10332 KB Output is correct
10 Correct 4 ms 10228 KB Output is correct
11 Correct 3 ms 10332 KB Output is correct
12 Correct 2 ms 10332 KB Output is correct
13 Correct 2 ms 10332 KB Output is correct
14 Correct 3 ms 10332 KB Output is correct
15 Correct 2 ms 10332 KB Output is correct
16 Correct 3 ms 10144 KB Output is correct
17 Correct 3 ms 10332 KB Output is correct
18 Correct 3 ms 10332 KB Output is correct
19 Correct 106 ms 19124 KB Output is correct
20 Correct 108 ms 19868 KB Output is correct
21 Correct 116 ms 20008 KB Output is correct
22 Correct 128 ms 20772 KB Output is correct
23 Correct 62 ms 20508 KB Output is correct
24 Correct 48 ms 20488 KB Output is correct
25 Correct 100 ms 23468 KB Output is correct
26 Correct 83 ms 27400 KB Output is correct
27 Correct 469 ms 27196 KB Output is correct
28 Correct 264 ms 41424 KB Output is correct
29 Correct 250 ms 40296 KB Output is correct
30 Correct 448 ms 27308 KB Output is correct
31 Correct 397 ms 27316 KB Output is correct
32 Correct 504 ms 27388 KB Output is correct
33 Correct 179 ms 26032 KB Output is correct
34 Correct 134 ms 26324 KB Output is correct

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 10328 KB Output is correct
2 Correct 3 ms 10332 KB Output is correct
3 Correct 3 ms 10332 KB Output is correct
4 Correct 3 ms 10332 KB Output is correct
5 Correct 3 ms 10332 KB Output is correct
6 Correct 2 ms 10332 KB Output is correct
7 Correct 3 ms 10332 KB Output is correct
8 Correct 3 ms 10332 KB Output is correct
9 Correct 2 ms 10332 KB Output is correct
10 Correct 4 ms 10228 KB Output is correct
11 Correct 3 ms 10332 KB Output is correct
12 Correct 2 ms 10332 KB Output is correct
13 Correct 2 ms 10332 KB Output is correct
14 Correct 3 ms 10332 KB Output is correct
15 Correct 2 ms 10332 KB Output is correct
16 Correct 3 ms 10144 KB Output is correct
17 Correct 3 ms 10332 KB Output is correct
18 Correct 3 ms 10332 KB Output is correct
19 Correct 5 ms 10332 KB Output is correct
20 Correct 3 ms 10584 KB Output is correct
21 Correct 3 ms 10176 KB Output is correct
22 Correct 3 ms 10176 KB Output is correct
23 Correct 4 ms 10328 KB Output is correct
24 Correct 5 ms 10332 KB Output is correct
25 Correct 8 ms 10332 KB Output is correct
26 Correct 3 ms 10356 KB Output is correct
27 Correct 3 ms 10332 KB Output is correct
28 Correct 4 ms 10172 KB Output is correct
29 Correct 4 ms 10332 KB Output is correct
30 Correct 3 ms 10180 KB Output is correct
31 Correct 4 ms 10328 KB Output is correct
32 Correct 4 ms 10332 KB Output is correct
33 Correct 4 ms 10332 KB Output is correct
34 Correct 4 ms 10328 KB Output is correct
35 Correct 3 ms 10332 KB Output is correct
36 Correct 5 ms 10332 KB Output is correct
37 Correct 3 ms 10328 KB Output is correct
38 Correct 3 ms 10584 KB Output is correct
39 Correct 106 ms 19124 KB Output is correct
40 Correct 108 ms 19868 KB Output is correct
41 Correct 116 ms 20008 KB Output is correct
42 Correct 128 ms 20772 KB Output is correct
43 Correct 62 ms 20508 KB Output is correct
44 Correct 48 ms 20488 KB Output is correct
45 Correct 100 ms 23468 KB Output is correct
46 Correct 83 ms 27400 KB Output is correct
47 Correct 469 ms 27196 KB Output is correct
48 Correct 264 ms 41424 KB Output is correct
49 Correct 250 ms 40296 KB Output is correct
50 Correct 448 ms 27308 KB Output is correct
51 Correct 397 ms 27316 KB Output is correct
52 Correct 504 ms 27388 KB Output is correct
53 Correct 179 ms 26032 KB Output is correct
54 Correct 134 ms 26324 KB Output is correct
55 Correct 14 ms 10960 KB Output is correct
56 Correct 11 ms 11100 KB Output is correct
57 Correct 71 ms 19916 KB Output is correct
58 Execution timed out 3061 ms 21960 KB Time limit exceeded
59 Halted 0 ms 0 KB -