oj.uz

답안 #840515

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
840515 2023-08-31T13:15:51 Z jonathanirvings 가장 긴 여행 (IOI23_longesttrip) C++17
60 / 100
 477 ms 592 KB 
#include "longesttrip.h"

#include <bits/stdc++.h>
using namespace std;

vector<int> longest_trip(int N, int D)
{
    vector<int> path = {0};
    vector<bool> inside(N, false);
    inside[0] = true;

    vector<vector<int>> memo(N, vector<int>(N, -1));
    auto is_connected = [&] (int x, int y) {
        if (memo[x][y] >= 0) {
            return memo[x][y];
        }
        memo[x][y] = memo[y][x] = are_connected({x}, {y});
        return memo[x][y];
    };
    while (true) {
        if (path.size() == N) {
            return path;
        }
        bool found = false;
        for (int i = 0; i < N && !found; ++i) {
            if (!inside[i]) {
                if (is_connected(path[0], i)) {
                    path.insert(path.begin(), i);
                    found = true;
                    inside[i] = true;
                    break;
                }
                if (is_connected(path[path.size() - 1], i)) {
                    path.insert(path.end(), i);
                    found = true;
                    inside[i] = true;
                    break;
                }
                for (int j = 0; j < path.size(); ++j) {
                    if (is_connected(path[j], i)) {
                        vector<int> new_path;
                        new_path.insert(new_path.end(), path.begin() + j + 1, path.end());
                        new_path.insert(new_path.end(), path.begin(), path.begin() + j + 1);
                        path = new_path;

                        path.insert(path.end(), i);
                        found = true;
                        inside[i] = true;
                        break;
                    }
                }
            }
        }
        if (!found) {
            if (path.size() >= (N - path.size())) {
                return path;
            }
            path.clear();
            for (int i = 0; i < N; ++i) {
                if (!inside[i]) {
                    path.insert(path.end(), i);
                }
            }
            return path;
        }
    }
}

Compilation message

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:21:25: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   21 |         if (path.size() == N) {
      |             ~~~~~~~~~~~~^~~~
longesttrip.cpp:39:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |                 for (int j = 0; j < path.size(); ++j) {
      |                                 ~~^~~~~~~~~~~~~

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 3 ms 464 KB Output is correct

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 208 KB Output is correct
2 Correct 10 ms 208 KB Output is correct
3 Correct 8 ms 208 KB Output is correct
4 Correct 9 ms 336 KB Output is correct
5 Correct 8 ms 464 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 208 KB Output is correct
2 Correct 6 ms 208 KB Output is correct
3 Correct 7 ms 208 KB Output is correct
4 Correct 7 ms 376 KB Output is correct
5 Correct 8 ms 464 KB Output is correct
6 Correct 9 ms 208 KB Output is correct
7 Correct 7 ms 208 KB Output is correct
8 Correct 8 ms 208 KB Output is correct
9 Correct 6 ms 336 KB Output is correct
10 Correct 6 ms 464 KB Output is correct
11 Correct 8 ms 464 KB Output is correct
12 Correct 7 ms 464 KB Output is correct
13 Correct 7 ms 464 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 208 KB Output is correct
2 Correct 9 ms 208 KB Output is correct
3 Correct 9 ms 208 KB Output is correct
4 Correct 9 ms 336 KB Output is correct
5 Correct 8 ms 464 KB Output is correct
6 Correct 9 ms 208 KB Output is correct
7 Correct 6 ms 208 KB Output is correct
8 Correct 10 ms 208 KB Output is correct
9 Correct 10 ms 336 KB Output is correct
10 Correct 7 ms 464 KB Output is correct
11 Correct 7 ms 464 KB Output is correct
12 Correct 8 ms 464 KB Output is correct
13 Correct 7 ms 464 KB Output is correct
14 Correct 8 ms 208 KB Output is correct
15 Correct 13 ms 208 KB Output is correct
16 Correct 12 ms 208 KB Output is correct
17 Correct 8 ms 208 KB Output is correct
18 Correct 10 ms 208 KB Output is correct
19 Correct 8 ms 336 KB Output is correct
20 Correct 9 ms 336 KB Output is correct
21 Correct 10 ms 568 KB Output is correct
22 Correct 9 ms 564 KB Output is correct
23 Correct 9 ms 568 KB Output is correct
24 Correct 7 ms 464 KB Output is correct
25 Correct 12 ms 208 KB Output is correct
26 Correct 11 ms 208 KB Output is correct
27 Correct 12 ms 208 KB Output is correct
28 Correct 11 ms 208 KB Output is correct
29 Correct 12 ms 208 KB Output is correct
30 Correct 14 ms 208 KB Output is correct
31 Correct 75 ms 208 KB Output is correct
32 Correct 110 ms 208 KB Output is correct
33 Correct 12 ms 336 KB Output is correct
34 Correct 29 ms 336 KB Output is correct
35 Correct 43 ms 336 KB Output is correct
36 Correct 19 ms 464 KB Output is correct
37 Correct 75 ms 464 KB Output is correct
38 Correct 244 ms 464 KB Output is correct
39 Correct 406 ms 464 KB Output is correct
40 Correct 408 ms 464 KB Output is correct
41 Correct 459 ms 464 KB Output is correct
42 Correct 436 ms 464 KB Output is correct
43 Correct 437 ms 464 KB Output is correct
44 Correct 461 ms 464 KB Output is correct
45 Correct 7 ms 208 KB Output is correct
46 Correct 10 ms 208 KB Output is correct
47 Correct 10 ms 208 KB Output is correct
48 Correct 13 ms 208 KB Output is correct
49 Correct 11 ms 208 KB Output is correct
50 Correct 11 ms 208 KB Output is correct
51 Correct 60 ms 208 KB Output is correct
52 Correct 70 ms 208 KB Output is correct
53 Correct 11 ms 336 KB Output is correct
54 Correct 16 ms 336 KB Output is correct
55 Correct 24 ms 336 KB Output is correct
56 Correct 10 ms 464 KB Output is correct
57 Correct 39 ms 464 KB Output is correct
58 Correct 132 ms 464 KB Output is correct
59 Correct 276 ms 464 KB Output is correct
60 Correct 360 ms 544 KB Output is correct
61 Correct 65 ms 464 KB Output is correct
62 Correct 238 ms 464 KB Output is correct
63 Correct 284 ms 592 KB Output is correct
64 Correct 254 ms 464 KB Output is correct

Subtask #4
19.999999998 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 208 KB Output is correct
2 Correct 9 ms 208 KB Output is correct
3 Correct 7 ms 208 KB Output is correct
4 Correct 6 ms 336 KB Output is correct
5 Correct 7 ms 464 KB Output is correct
6 Correct 10 ms 208 KB Output is correct
7 Correct 9 ms 208 KB Output is correct
8 Correct 9 ms 208 KB Output is correct
9 Correct 7 ms 336 KB Output is correct
10 Correct 10 ms 464 KB Output is correct
11 Correct 8 ms 464 KB Output is correct
12 Correct 7 ms 464 KB Output is correct
13 Correct 8 ms 464 KB Output is correct
14 Correct 11 ms 208 KB Output is correct
15 Correct 11 ms 208 KB Output is correct
16 Correct 13 ms 208 KB Output is correct
17 Correct 10 ms 208 KB Output is correct
18 Correct 11 ms 208 KB Output is correct
19 Correct 7 ms 348 KB Output is correct
20 Correct 5 ms 464 KB Output is correct
21 Correct 8 ms 208 KB Output is correct
22 Correct 12 ms 208 KB Output is correct
23 Correct 16 ms 208 KB Output is correct
24 Correct 11 ms 208 KB Output is correct
25 Correct 12 ms 208 KB Output is correct
26 Correct 13 ms 208 KB Output is correct
27 Partially correct 86 ms 208 KB Output is partially correct
28 Partially correct 100 ms 208 KB Output is partially correct
29 Correct 17 ms 336 KB Output is correct
30 Correct 29 ms 336 KB Output is correct
31 Partially correct 45 ms 336 KB Output is partially correct
32 Correct 9 ms 208 KB Output is correct
33 Correct 11 ms 208 KB Output is correct
34 Correct 14 ms 208 KB Output is correct
35 Correct 11 ms 208 KB Output is correct
36 Correct 9 ms 208 KB Output is correct
37 Correct 10 ms 208 KB Output is correct
38 Partially correct 52 ms 208 KB Output is partially correct
39 Partially correct 78 ms 208 KB Output is partially correct
40 Correct 11 ms 348 KB Output is correct
41 Correct 18 ms 336 KB Output is correct
42 Partially correct 25 ms 336 KB Output is partially correct
43 Correct 8 ms 464 KB Output is correct
44 Correct 7 ms 564 KB Output is correct
45 Correct 9 ms 464 KB Output is correct
46 Correct 8 ms 464 KB Output is correct
47 Partially correct 14 ms 464 KB Output is partially correct
48 Partially correct 78 ms 464 KB Output is partially correct
49 Partially correct 243 ms 464 KB Output is partially correct
50 Partially correct 392 ms 464 KB Output is partially correct
51 Partially correct 434 ms 464 KB Output is partially correct
52 Partially correct 477 ms 464 KB Output is partially correct
53 Partially correct 423 ms 464 KB Output is partially correct
54 Partially correct 447 ms 464 KB Output is partially correct
55 Partially correct 464 ms 464 KB Output is partially correct
56 Partially correct 72 ms 464 KB Output is partially correct
57 Partially correct 212 ms 464 KB Output is partially correct
58 Partially correct 391 ms 464 KB Output is partially correct
59 Partially correct 427 ms 464 KB Output is partially correct
60 Partially correct 457 ms 464 KB Output is partially correct
61 Partially correct 424 ms 464 KB Output is partially correct
62 Partially correct 11 ms 564 KB Output is partially correct
63 Partially correct 34 ms 464 KB Output is partially correct
64 Partially correct 136 ms 464 KB Output is partially correct
65 Partially correct 265 ms 464 KB Output is partially correct
66 Partially correct 352 ms 464 KB Output is partially correct
67 Partially correct 87 ms 464 KB Output is partially correct
68 Partially correct 256 ms 464 KB Output is partially correct
69 Partially correct 281 ms 576 KB Output is partially correct
70 Partially correct 267 ms 464 KB Output is partially correct
71 Partially correct 55 ms 464 KB Output is partially correct
72 Partially correct 109 ms 548 KB Output is partially correct
73 Partially correct 145 ms 464 KB Output is partially correct
74 Partially correct 255 ms 464 KB Output is partially correct
75 Partially correct 134 ms 464 KB Output is partially correct
76 Partially correct 227 ms 548 KB Output is partially correct
77 Partially correct 54 ms 464 KB Output is partially correct
78 Partially correct 151 ms 552 KB Output is partially correct
79 Partially correct 113 ms 464 KB Output is partially correct
80 Partially correct 243 ms 464 KB Output is partially correct
81 Partially correct 267 ms 464 KB Output is partially correct
82 Partially correct 170 ms 464 KB Output is partially correct