oj.uz

Submission #970291

# Submission time Handle Problem Language Result Execution time Memory
970291 2024-04-26T10:25:02 Z tset Race (IOI11_race) C++14
21 / 100
 370 ms 26888 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 ctr = 0;
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)
        {
            ctr++;
            if(ctr > 50*nbNodes)
                return 1;
            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 2 ms 10328 KB Output is correct
3 Correct 2 ms 10332 KB Output is correct
4 Correct 3 ms 10160 KB Output is correct
5 Correct 3 ms 10116 KB Output is correct
6 Correct 2 ms 10332 KB Output is correct
7 Correct 2 ms 10332 KB Output is correct
8 Correct 2 ms 10240 KB Output is correct
9 Correct 2 ms 10332 KB Output is correct
10 Correct 2 ms 10332 KB Output is correct
11 Correct 3 ms 10332 KB Output is correct
12 Correct 3 ms 10332 KB Output is correct
13 Correct 3 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 10328 KB Output is correct
17 Correct 2 ms 10332 KB Output is correct
18 Correct 2 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 2 ms 10328 KB Output is correct
3 Correct 2 ms 10332 KB Output is correct
4 Correct 3 ms 10160 KB Output is correct
5 Correct 3 ms 10116 KB Output is correct
6 Correct 2 ms 10332 KB Output is correct
7 Correct 2 ms 10332 KB Output is correct
8 Correct 2 ms 10240 KB Output is correct
9 Correct 2 ms 10332 KB Output is correct
10 Correct 2 ms 10332 KB Output is correct
11 Correct 3 ms 10332 KB Output is correct
12 Correct 3 ms 10332 KB Output is correct
13 Correct 3 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 10328 KB Output is correct
17 Correct 2 ms 10332 KB Output is correct
18 Correct 2 ms 10332 KB Output is correct
19 Correct 2 ms 10328 KB Output is correct
20 Correct 2 ms 10332 KB Output is correct
21 Correct 3 ms 10332 KB Output is correct
22 Correct 3 ms 10332 KB Output is correct
23 Correct 3 ms 10328 KB Output is correct
24 Correct 3 ms 10332 KB Output is correct
25 Correct 3 ms 10332 KB Output is correct
26 Correct 3 ms 10584 KB Output is correct
27 Correct 3 ms 10332 KB Output is correct
28 Correct 4 ms 10332 KB Output is correct
29 Correct 4 ms 10332 KB Output is correct
30 Correct 3 ms 10332 KB Output is correct
31 Correct 4 ms 10328 KB Output is correct
32 Correct 3 ms 10332 KB Output is correct
33 Correct 3 ms 10328 KB Output is correct
34 Correct 4 ms 10328 KB Output is correct
35 Correct 3 ms 10332 KB Output is correct
36 Correct 3 ms 10416 KB Output is correct
37 Correct 3 ms 10328 KB Output is correct
38 Correct 3 ms 10332 KB Output is correct

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 10328 KB Output is correct
2 Correct 2 ms 10328 KB Output is correct
3 Correct 2 ms 10332 KB Output is correct
4 Correct 3 ms 10160 KB Output is correct
5 Correct 3 ms 10116 KB Output is correct
6 Correct 2 ms 10332 KB Output is correct
7 Correct 2 ms 10332 KB Output is correct
8 Correct 2 ms 10240 KB Output is correct
9 Correct 2 ms 10332 KB Output is correct
10 Correct 2 ms 10332 KB Output is correct
11 Correct 3 ms 10332 KB Output is correct
12 Correct 3 ms 10332 KB Output is correct
13 Correct 3 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 10328 KB Output is correct
17 Correct 2 ms 10332 KB Output is correct
18 Correct 2 ms 10332 KB Output is correct
19 Correct 92 ms 19068 KB Output is correct
20 Correct 93 ms 19052 KB Output is correct
21 Correct 99 ms 19280 KB Output is correct
22 Correct 102 ms 19664 KB Output is correct
23 Correct 57 ms 19200 KB Output is correct
24 Correct 49 ms 19292 KB Output is correct
25 Correct 89 ms 22704 KB Output is correct
26 Correct 78 ms 26888 KB Output is correct
27 Incorrect 370 ms 25936 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 10328 KB Output is correct
2 Correct 2 ms 10328 KB Output is correct
3 Correct 2 ms 10332 KB Output is correct
4 Correct 3 ms 10160 KB Output is correct
5 Correct 3 ms 10116 KB Output is correct
6 Correct 2 ms 10332 KB Output is correct
7 Correct 2 ms 10332 KB Output is correct
8 Correct 2 ms 10240 KB Output is correct
9 Correct 2 ms 10332 KB Output is correct
10 Correct 2 ms 10332 KB Output is correct
11 Correct 3 ms 10332 KB Output is correct
12 Correct 3 ms 10332 KB Output is correct
13 Correct 3 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 10328 KB Output is correct
17 Correct 2 ms 10332 KB Output is correct
18 Correct 2 ms 10332 KB Output is correct
19 Correct 2 ms 10328 KB Output is correct
20 Correct 2 ms 10332 KB Output is correct
21 Correct 3 ms 10332 KB Output is correct
22 Correct 3 ms 10332 KB Output is correct
23 Correct 3 ms 10328 KB Output is correct
24 Correct 3 ms 10332 KB Output is correct
25 Correct 3 ms 10332 KB Output is correct
26 Correct 3 ms 10584 KB Output is correct
27 Correct 3 ms 10332 KB Output is correct
28 Correct 4 ms 10332 KB Output is correct
29 Correct 4 ms 10332 KB Output is correct
30 Correct 3 ms 10332 KB Output is correct
31 Correct 4 ms 10328 KB Output is correct
32 Correct 3 ms 10332 KB Output is correct
33 Correct 3 ms 10328 KB Output is correct
34 Correct 4 ms 10328 KB Output is correct
35 Correct 3 ms 10332 KB Output is correct
36 Correct 3 ms 10416 KB Output is correct
37 Correct 3 ms 10328 KB Output is correct
38 Correct 3 ms 10332 KB Output is correct
39 Correct 92 ms 19068 KB Output is correct
40 Correct 93 ms 19052 KB Output is correct
41 Correct 99 ms 19280 KB Output is correct
42 Correct 102 ms 19664 KB Output is correct
43 Correct 57 ms 19200 KB Output is correct
44 Correct 49 ms 19292 KB Output is correct
45 Correct 89 ms 22704 KB Output is correct
46 Correct 78 ms 26888 KB Output is correct
47 Incorrect 370 ms 25936 KB Output isn't correct
48 Halted 0 ms 0 KB -