oj.uz

답안 #1037947

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1037947 2024-07-29T10:52:13 Z attky 경주 (Race) (IOI11_race) C++17
100 / 100
 976 ms 64880 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
struct Vertice {
    int arrivee, poids;
};
 
struct Path {
    int pos, length, depth;
};
 
int find_centroid(int n, vector<vector<Vertice>> arbre) {
    vector<int> nbFils(n, 1);
    vector<bool> vu(n, false);
    stack<pair<int, int>> pile;
    vector<vector<Vertice>> secondArbre = arbre;
    pile.push({0, -1});
    vu[0] = true;
    while(pile.size() > 0) {
        int pos = pile.top().first, father = pile.top().second;
        if(arbre[pos].size() == 0) {
            pile.pop();
            if(father != -1) {
                nbFils[father] += nbFils[pos];
            }
        }
        else {
            if(!vu[arbre[pos].back().arrivee]) {
                pile.push({arbre[pos].back().arrivee, pos});
            }
            vu[arbre[pos].back().arrivee] = true;
            arbre[pos].pop_back();
        }
    }
    int maxi = n+1, best = -1;
    for(int loop = 0; loop < n; ++loop) {
        int sizeMax = n - nbFils[loop];
        for(int looping = 0; looping < secondArbre[loop].size(); ++looping) {
            if(nbFils[secondArbre[loop][looping].arrivee] > nbFils[loop]) {
                continue;
            }
            sizeMax = max(sizeMax, nbFils[secondArbre[loop][looping].arrivee]);
        }
        if(sizeMax < maxi) {
            maxi = sizeMax;
            best = loop;
        }
    }
    return best;
}
 
vector<int> distMin(1000010, 2e9);
 
int best_path(int n, int k, int h[][2], int l[]) {
    if(n <= 1) {
        return -1;
    }
    vector<vector<Vertice>> graph(n);
    for(int loop = 0; loop < n-1; ++loop) {
        graph[h[loop][0]].push_back({h[loop][1], l[loop]});
        graph[h[loop][1]].push_back({h[loop][0], l[loop]});
    }
    int centroid = find_centroid(n, graph);

    vector<vector<Vertice>> newGraph = graph;
    vector<bool> vu(n, false);
    vu[centroid] = true;
    vector<int> allModif;
    int mini = 2e9;
    for(int loop = 0; loop < newGraph[centroid].size(); ++loop) {
        stack<Path> pile;
        vector<Path> newPath;
        pile.push({graph[centroid][loop].arrivee, graph[centroid][loop].poids, 1});
        newPath.push_back(pile.top());
        vu[graph[centroid][loop].arrivee] = true;
        while(pile.size() > 0) {
            Path enCours = pile.top();
            if(graph[enCours.pos].size() == 0) {
                pile.pop();
            }
            else {
                if(!vu[graph[enCours.pos].back().arrivee]) {
                    pile.push({graph[enCours.pos].back().arrivee, graph[enCours.pos].back().poids + enCours.length, enCours.depth + 1});
                    newPath.push_back(pile.top());
                }
                if(pile.top().length > k) {
                    pile.pop();
                }
                vu[graph[enCours.pos].back().arrivee] = true;
                graph[enCours.pos].pop_back();
            }
        }
        for(int looping = 0; looping < newPath.size(); ++looping) {
            if(k - newPath[looping].length >= 0) {
                distMin[k] = min(distMin[k], distMin[k - newPath[looping].length] + newPath[looping].depth);
            }
        }
        for(int looping = 0; looping < newPath.size(); ++looping) {
            if(newPath[looping].length >= distMin.size()) {
                continue;
            }
            distMin[newPath[looping].length] = min(distMin[newPath[looping].length], newPath[looping].depth);
            allModif.push_back(newPath[looping].length);
        }
    }
    mini = distMin[k];
    for(int loop = 0; loop < allModif.size(); ++loop) {
        if(allModif[loop] >= distMin.size()) {
            continue;
        }
        distMin[allModif[loop]] = 2e9;
    }
    distMin[k] = 2e9;
 
    for(int loop = 0; loop < n; ++loop) {
        vu[loop] = false;
    }
    vector<int> value(n, -1);
    vu[centroid] = true;
    for(int loop = 0; loop < newGraph[centroid].size(); ++loop) {
        stack<int> pile;
        vector<pair<int, Vertice>> vertice;
        int compteur = 1;
        pile.push(newGraph[centroid][loop].arrivee);
        vu[newGraph[centroid][loop].arrivee] = true;
        value[newGraph[centroid][loop].arrivee] = 0;
        while(pile.size() > 0) {
            int enCours = pile.top();
            if(newGraph[enCours].size() == 0) {
                pile.pop();
            }
            else {
                if(!vu[newGraph[enCours].back().arrivee]) {
                    vertice.push_back({value[enCours], {compteur, newGraph[enCours].back().poids}});
                    value[newGraph[enCours].back().arrivee] = compteur;
                    compteur++;
                    pile.push(newGraph[enCours].back().arrivee);
                }
                vu[newGraph[enCours].back().arrivee] = true;
                newGraph[enCours].pop_back();
            }
        }
        int littleH[vertice.size()][2];
        int littleL[vertice.size()];
        for(int loop = 0; loop < vertice.size(); ++loop) {
            littleH[loop][0] = vertice[loop].first;
            littleH[loop][1] = vertice[loop].second.arrivee;
            littleL[loop] = vertice[loop].second.poids;
        }
        int result = best_path(vertice.size() + 1, k, littleH, littleL);
        if(result == -1) {
            result = 2e9;
        }
        mini = min(mini, result);
    }
    if(mini == 2e9) {
        mini = -1;
    }
 
    return mini;
}

Compilation message

race.cpp: In function 'int find_centroid(int, std::vector<std::vector<Vertice> >)':
race.cpp:39:38: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Vertice>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |         for(int looping = 0; looping < secondArbre[loop].size(); ++looping) {
      |                              ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
race.cpp: In function 'int best_path(int, int, int (*)[2], int*)':
race.cpp:71:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Vertice>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   71 |     for(int loop = 0; loop < newGraph[centroid].size(); ++loop) {
      |                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
race.cpp:94:38: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Path>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   94 |         for(int looping = 0; looping < newPath.size(); ++looping) {
      |                              ~~~~~~~~^~~~~~~~~~~~~~~~
race.cpp:99:38: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Path>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   99 |         for(int looping = 0; looping < newPath.size(); ++looping) {
      |                              ~~~~~~~~^~~~~~~~~~~~~~~~
race.cpp:100:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  100 |             if(newPath[looping].length >= distMin.size()) {
race.cpp:108:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  108 |     for(int loop = 0; loop < allModif.size(); ++loop) {
      |                       ~~~~~^~~~~~~~~~~~~~~~~
race.cpp:109:27: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  109 |         if(allModif[loop] >= distMin.size()) {
race.cpp:121:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Vertice>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  121 |     for(int loop = 0; loop < newGraph[centroid].size(); ++loop) {
      |                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
race.cpp:146:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, Vertice> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  146 |         for(int loop = 0; loop < vertice.size(); ++loop) {
      |                           ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 6232 KB Output is correct
2 Correct 2 ms 6232 KB Output is correct
3 Correct 2 ms 6236 KB Output is correct
4 Correct 2 ms 6236 KB Output is correct
5 Correct 2 ms 6236 KB Output is correct
6 Correct 2 ms 6236 KB Output is correct
7 Correct 2 ms 6236 KB Output is correct
8 Correct 2 ms 6236 KB Output is correct
9 Correct 2 ms 6236 KB Output is correct
10 Correct 2 ms 6492 KB Output is correct
11 Correct 2 ms 6232 KB Output is correct
12 Correct 2 ms 6236 KB Output is correct
13 Correct 2 ms 6236 KB Output is correct
14 Correct 2 ms 6236 KB Output is correct
15 Correct 2 ms 6236 KB Output is correct
16 Correct 2 ms 6236 KB Output is correct
17 Correct 2 ms 6236 KB Output is correct
18 Correct 2 ms 6236 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 6232 KB Output is correct
2 Correct 2 ms 6232 KB Output is correct
3 Correct 2 ms 6236 KB Output is correct
4 Correct 2 ms 6236 KB Output is correct
5 Correct 2 ms 6236 KB Output is correct
6 Correct 2 ms 6236 KB Output is correct
7 Correct 2 ms 6236 KB Output is correct
8 Correct 2 ms 6236 KB Output is correct
9 Correct 2 ms 6236 KB Output is correct
10 Correct 2 ms 6492 KB Output is correct
11 Correct 2 ms 6232 KB Output is correct
12 Correct 2 ms 6236 KB Output is correct
13 Correct 2 ms 6236 KB Output is correct
14 Correct 2 ms 6236 KB Output is correct
15 Correct 2 ms 6236 KB Output is correct
16 Correct 2 ms 6236 KB Output is correct
17 Correct 2 ms 6236 KB Output is correct
18 Correct 2 ms 6236 KB Output is correct
19 Correct 2 ms 6236 KB Output is correct
20 Correct 2 ms 6236 KB Output is correct
21 Correct 4 ms 6492 KB Output is correct
22 Correct 4 ms 6492 KB Output is correct
23 Correct 5 ms 6492 KB Output is correct
24 Correct 4 ms 6492 KB Output is correct
25 Correct 5 ms 6696 KB Output is correct
26 Correct 3 ms 6492 KB Output is correct
27 Correct 3 ms 6488 KB Output is correct
28 Correct 4 ms 6492 KB Output is correct
29 Correct 3 ms 6492 KB Output is correct
30 Correct 3 ms 6688 KB Output is correct
31 Correct 3 ms 6572 KB Output is correct
32 Correct 4 ms 6692 KB Output is correct
33 Correct 4 ms 6688 KB Output is correct
34 Correct 5 ms 6492 KB Output is correct
35 Correct 3 ms 6492 KB Output is correct
36 Correct 4 ms 6424 KB Output is correct
37 Correct 5 ms 6492 KB Output is correct
38 Correct 4 ms 6488 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 6232 KB Output is correct
2 Correct 2 ms 6232 KB Output is correct
3 Correct 2 ms 6236 KB Output is correct
4 Correct 2 ms 6236 KB Output is correct
5 Correct 2 ms 6236 KB Output is correct
6 Correct 2 ms 6236 KB Output is correct
7 Correct 2 ms 6236 KB Output is correct
8 Correct 2 ms 6236 KB Output is correct
9 Correct 2 ms 6236 KB Output is correct
10 Correct 2 ms 6492 KB Output is correct
11 Correct 2 ms 6232 KB Output is correct
12 Correct 2 ms 6236 KB Output is correct
13 Correct 2 ms 6236 KB Output is correct
14 Correct 2 ms 6236 KB Output is correct
15 Correct 2 ms 6236 KB Output is correct
16 Correct 2 ms 6236 KB Output is correct
17 Correct 2 ms 6236 KB Output is correct
18 Correct 2 ms 6236 KB Output is correct
19 Correct 362 ms 34040 KB Output is correct
20 Correct 372 ms 34676 KB Output is correct
21 Correct 322 ms 35520 KB Output is correct
22 Correct 311 ms 35444 KB Output is correct
23 Correct 347 ms 32308 KB Output is correct
24 Correct 184 ms 28752 KB Output is correct
25 Correct 373 ms 35388 KB Output is correct
26 Correct 396 ms 36372 KB Output is correct
27 Correct 339 ms 47700 KB Output is correct
28 Correct 741 ms 62628 KB Output is correct
29 Correct 763 ms 62516 KB Output is correct
30 Correct 325 ms 47700 KB Output is correct
31 Correct 360 ms 47696 KB Output is correct
32 Correct 372 ms 47700 KB Output is correct
33 Correct 744 ms 59224 KB Output is correct
34 Correct 668 ms 56556 KB Output is correct

Subtask #4
57.0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 6232 KB Output is correct
2 Correct 2 ms 6232 KB Output is correct
3 Correct 2 ms 6236 KB Output is correct
4 Correct 2 ms 6236 KB Output is correct
5 Correct 2 ms 6236 KB Output is correct
6 Correct 2 ms 6236 KB Output is correct
7 Correct 2 ms 6236 KB Output is correct
8 Correct 2 ms 6236 KB Output is correct
9 Correct 2 ms 6236 KB Output is correct
10 Correct 2 ms 6492 KB Output is correct
11 Correct 2 ms 6232 KB Output is correct
12 Correct 2 ms 6236 KB Output is correct
13 Correct 2 ms 6236 KB Output is correct
14 Correct 2 ms 6236 KB Output is correct
15 Correct 2 ms 6236 KB Output is correct
16 Correct 2 ms 6236 KB Output is correct
17 Correct 2 ms 6236 KB Output is correct
18 Correct 2 ms 6236 KB Output is correct
19 Correct 2 ms 6236 KB Output is correct
20 Correct 2 ms 6236 KB Output is correct
21 Correct 4 ms 6492 KB Output is correct
22 Correct 4 ms 6492 KB Output is correct
23 Correct 5 ms 6492 KB Output is correct
24 Correct 4 ms 6492 KB Output is correct
25 Correct 5 ms 6696 KB Output is correct
26 Correct 3 ms 6492 KB Output is correct
27 Correct 3 ms 6488 KB Output is correct
28 Correct 4 ms 6492 KB Output is correct
29 Correct 3 ms 6492 KB Output is correct
30 Correct 3 ms 6688 KB Output is correct
31 Correct 3 ms 6572 KB Output is correct
32 Correct 4 ms 6692 KB Output is correct
33 Correct 4 ms 6688 KB Output is correct
34 Correct 5 ms 6492 KB Output is correct
35 Correct 3 ms 6492 KB Output is correct
36 Correct 4 ms 6424 KB Output is correct
37 Correct 5 ms 6492 KB Output is correct
38 Correct 4 ms 6488 KB Output is correct
39 Correct 362 ms 34040 KB Output is correct
40 Correct 372 ms 34676 KB Output is correct
41 Correct 322 ms 35520 KB Output is correct
42 Correct 311 ms 35444 KB Output is correct
43 Correct 347 ms 32308 KB Output is correct
44 Correct 184 ms 28752 KB Output is correct
45 Correct 373 ms 35388 KB Output is correct
46 Correct 396 ms 36372 KB Output is correct
47 Correct 339 ms 47700 KB Output is correct
48 Correct 741 ms 62628 KB Output is correct
49 Correct 763 ms 62516 KB Output is correct
50 Correct 325 ms 47700 KB Output is correct
51 Correct 360 ms 47696 KB Output is correct
52 Correct 372 ms 47700 KB Output is correct
53 Correct 744 ms 59224 KB Output is correct
54 Correct 668 ms 56556 KB Output is correct
55 Correct 30 ms 9092 KB Output is correct
56 Correct 28 ms 9088 KB Output is correct
57 Correct 370 ms 33392 KB Output is correct
58 Correct 66 ms 28868 KB Output is correct
59 Correct 378 ms 36212 KB Output is correct
60 Correct 887 ms 64260 KB Output is correct
61 Correct 327 ms 47952 KB Output is correct
62 Correct 421 ms 47740 KB Output is correct
63 Correct 471 ms 47696 KB Output is correct
64 Correct 901 ms 64880 KB Output is correct
65 Correct 665 ms 60004 KB Output is correct
66 Correct 976 ms 62936 KB Output is correct
67 Correct 194 ms 50116 KB Output is correct
68 Correct 409 ms 57184 KB Output is correct
69 Correct 426 ms 58572 KB Output is correct
70 Correct 422 ms 55052 KB Output is correct