답안 #1081773

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1081773 2024-08-30T10:22:18 Z ArthuroWich 가장 긴 여행 (IOI23_longesttrip) C++17
40 / 100
17 ms 644 KB
#include "longesttrip.h"
#include<bits/stdc++.h>
using namespace std;
vector<int> longest_trip(int n, int d) {
    vector<int> a, b, ans;
    a = {0};
    b = {1};
    for (int i = 2; i < n; i++) {
        if (are_connected({a.back(), b.back()}, {i})) {
            if (are_connected({a.back()}, {i})) {
                a.push_back(i);
            } else {
                b.push_back(i);
            }
        } else {
            for (int j = b.size()-1; j >= 0; j--) {
                a.push_back(b[j]);
            }
            b = {i};
        }
    }
    if (are_connected(a, b)) {
        if (are_connected({a.front()}, {b.front()})) {
            reverse(a.begin(), a.end());
            for (int j = 0; j < b.size(); j++) {
                a.push_back(b[j]);
            }
            reverse(a.begin(), a.end());
            b.clear();
        } else if (are_connected({a.back()}, {b.front()})) {
            for (int j = 0; j < b.size(); j++) {
                a.push_back(b[j]);
            }
            b.clear();
        } else if (are_connected({a.front()}, {b.back()})) {
            reverse(a.begin(), a.end());
            for (int j = b.size()-1; j >= 0; j--) {
                a.push_back(b[j]);
            }
            reverse(a.begin(), a.end());
            b.clear();
        } else if (are_connected({a.back()}, {b.back()})) {
            for (int j = b.size()-1; j >= 0; j--) {
                a.push_back(b[j]);
            }
            b.clear();
        }
    }
    if (a.size() >= b.size()) {
        ans = a;
    } else {
        ans = b;
    }
    return ans;
}

Compilation message

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:25:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |             for (int j = 0; j < b.size(); j++) {
      |                             ~~^~~~~~~~~~
longesttrip.cpp:31:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |             for (int j = 0; j < b.size(); j++) {
      |                             ~~^~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 3 ms 344 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 344 KB Output is correct
2 Correct 11 ms 344 KB Output is correct
3 Correct 14 ms 344 KB Output is correct
4 Correct 9 ms 356 KB Output is correct
5 Correct 14 ms 344 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 344 KB Output is correct
2 Correct 14 ms 344 KB Output is correct
3 Correct 16 ms 344 KB Output is correct
4 Correct 14 ms 344 KB Output is correct
5 Correct 10 ms 432 KB Output is correct
6 Correct 13 ms 344 KB Output is correct
7 Correct 9 ms 344 KB Output is correct
8 Correct 10 ms 344 KB Output is correct
9 Correct 8 ms 344 KB Output is correct
10 Correct 9 ms 344 KB Output is correct
11 Correct 12 ms 344 KB Output is correct
12 Correct 16 ms 440 KB Output is correct
13 Correct 11 ms 344 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 344 KB Output is correct
2 Correct 12 ms 344 KB Output is correct
3 Correct 12 ms 344 KB Output is correct
4 Correct 14 ms 344 KB Output is correct
5 Correct 14 ms 344 KB Output is correct
6 Correct 9 ms 344 KB Output is correct
7 Correct 9 ms 344 KB Output is correct
8 Correct 12 ms 344 KB Output is correct
9 Correct 14 ms 344 KB Output is correct
10 Correct 13 ms 344 KB Output is correct
11 Correct 9 ms 344 KB Output is correct
12 Correct 10 ms 344 KB Output is correct
13 Correct 9 ms 344 KB Output is correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 9 ms 344 KB Output is correct
16 Correct 12 ms 344 KB Output is correct
17 Correct 10 ms 344 KB Output is correct
18 Correct 9 ms 344 KB Output is correct
19 Correct 15 ms 344 KB Output is correct
20 Correct 14 ms 344 KB Output is correct
21 Correct 13 ms 344 KB Output is correct
22 Correct 10 ms 344 KB Output is correct
23 Correct 10 ms 344 KB Output is correct
24 Correct 9 ms 344 KB Output is correct
25 Correct 11 ms 344 KB Output is correct
26 Correct 7 ms 344 KB Output is correct
27 Correct 9 ms 344 KB Output is correct
28 Correct 9 ms 344 KB Output is correct
29 Correct 8 ms 344 KB Output is correct
30 Correct 13 ms 344 KB Output is correct
31 Correct 10 ms 344 KB Output is correct
32 Correct 10 ms 344 KB Output is correct
33 Correct 14 ms 344 KB Output is correct
34 Correct 13 ms 344 KB Output is correct
35 Correct 14 ms 344 KB Output is correct
36 Correct 14 ms 344 KB Output is correct
37 Correct 15 ms 436 KB Output is correct
38 Correct 11 ms 344 KB Output is correct
39 Correct 11 ms 344 KB Output is correct
40 Correct 13 ms 644 KB Output is correct
41 Correct 10 ms 344 KB Output is correct
42 Correct 11 ms 344 KB Output is correct
43 Correct 13 ms 344 KB Output is correct
44 Correct 10 ms 344 KB Output is correct
45 Correct 16 ms 344 KB Output is correct
46 Correct 16 ms 344 KB Output is correct
47 Correct 15 ms 344 KB Output is correct
48 Correct 16 ms 344 KB Output is correct
49 Correct 13 ms 344 KB Output is correct
50 Correct 9 ms 344 KB Output is correct
51 Correct 17 ms 344 KB Output is correct
52 Correct 14 ms 344 KB Output is correct
53 Correct 10 ms 344 KB Output is correct
54 Correct 10 ms 440 KB Output is correct
55 Correct 10 ms 344 KB Output is correct
56 Correct 13 ms 344 KB Output is correct
57 Correct 13 ms 600 KB Output is correct
58 Correct 12 ms 344 KB Output is correct
59 Correct 10 ms 344 KB Output is correct
60 Correct 13 ms 344 KB Output is correct
61 Correct 13 ms 440 KB Output is correct
62 Correct 13 ms 344 KB Output is correct
63 Correct 10 ms 344 KB Output is correct
64 Correct 13 ms 344 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 344 KB Output is correct
2 Correct 11 ms 344 KB Output is correct
3 Correct 12 ms 344 KB Output is correct
4 Correct 11 ms 344 KB Output is correct
5 Partially correct 14 ms 600 KB Output is partially correct
6 Correct 13 ms 344 KB Output is correct
7 Correct 13 ms 500 KB Output is correct
8 Correct 10 ms 344 KB Output is correct
9 Correct 10 ms 432 KB Output is correct
10 Partially correct 15 ms 344 KB Output is partially correct
11 Partially correct 12 ms 344 KB Output is partially correct
12 Partially correct 10 ms 344 KB Output is partially correct
13 Partially correct 10 ms 344 KB Output is partially correct
14 Correct 7 ms 344 KB Output is correct
15 Correct 11 ms 344 KB Output is correct
16 Incorrect 2 ms 344 KB Incorrect
17 Halted 0 ms 0 KB -