oj.uz

답안 #846235

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
846235 2023-09-07T12:45:19 Z JoksimKaktus 가장 긴 여행 (IOI23_longesttrip) C++17
40 / 100
 9 ms 800 KB 
#include "longesttrip.h"
#include <bits/stdc++.h>

using namespace std;

vector<int> longest_trip(int N, int D)
{
    vector <int> v;
    if(D == 3){
        for(int i = 0;i < N;i++){
            v.push_back(i);
        }
    }else if(D == 2){
        int last;
        if(are_connected({0},{1})){
            v.push_back(0);
            v.push_back(1);
            if(are_connected({0},{2})){
                v.insert(v.begin(),2);
                last = 1;
            }else{
                v.push_back(2);
                last = 2;
            }
        }else{
            v.push_back(0);
            v.push_back(2);
            v.push_back(1);
            last = 1;
        }
        for(int i = 3; i < N;i++){
            if(are_connected({last},{i})){
                v.push_back(i);
                last = i;
            }else{
                v.insert(v.begin(),i);
            }
        }
    }else{
        vector <int>v2;
        v.push_back(0);
        int last = 0;
        if(are_connected({0},{1})){
            v.push_back(1);
            last = 1;
        }else{
            v2.push_back(1);
        }
        for(int i = 2;i < N;i++){
            if(are_connected({last},{i})){
                v.push_back(i);
                last = i;
            }else if(are_connected({v[0]},{i})){
                v.insert(v.begin(),i);
            }else{
                v2.push_back(i);
            }
        }
        if(v.size() > v2.size()){
            return v;
        }
        return v2;
    }
    return v;
}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 1 ms 344 KB Incorrect
3 Halted 0 ms 0 KB -

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 4 ms 344 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 5 ms 344 KB Output is correct
5 Correct 4 ms 344 KB Output is correct
6 Correct 6 ms 344 KB Output is correct
7 Correct 6 ms 344 KB Output is correct
8 Correct 4 ms 344 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 4 ms 344 KB Output is correct
11 Correct 5 ms 600 KB Output is correct
12 Correct 5 ms 344 KB Output is correct
13 Correct 5 ms 344 KB Output is correct
14 Correct 5 ms 344 KB Output is correct
15 Correct 7 ms 344 KB Output is correct
16 Correct 6 ms 596 KB Output is correct
17 Correct 5 ms 344 KB Output is correct
18 Correct 5 ms 344 KB Output is correct
19 Correct 5 ms 344 KB Output is correct
20 Correct 6 ms 344 KB Output is correct
21 Correct 5 ms 344 KB Output is correct
22 Correct 5 ms 344 KB Output is correct
23 Correct 6 ms 344 KB Output is correct
24 Correct 5 ms 344 KB Output is correct
25 Correct 9 ms 344 KB Output is correct
26 Correct 6 ms 344 KB Output is correct
27 Correct 5 ms 344 KB Output is correct
28 Correct 7 ms 344 KB Output is correct
29 Correct 6 ms 344 KB Output is correct
30 Correct 5 ms 344 KB Output is correct
31 Correct 7 ms 344 KB Output is correct
32 Correct 6 ms 344 KB Output is correct
33 Correct 5 ms 344 KB Output is correct
34 Correct 4 ms 344 KB Output is correct
35 Correct 5 ms 344 KB Output is correct
36 Correct 4 ms 344 KB Output is correct
37 Correct 5 ms 344 KB Output is correct
38 Correct 7 ms 600 KB Output is correct
39 Correct 5 ms 600 KB Output is correct
40 Correct 6 ms 344 KB Output is correct
41 Correct 6 ms 344 KB Output is correct
42 Correct 7 ms 344 KB Output is correct
43 Correct 6 ms 344 KB Output is correct
44 Correct 6 ms 344 KB Output is correct
45 Correct 7 ms 344 KB Output is correct
46 Correct 6 ms 344 KB Output is correct
47 Correct 7 ms 344 KB Output is correct
48 Correct 5 ms 344 KB Output is correct
49 Correct 7 ms 344 KB Output is correct
50 Correct 4 ms 344 KB Output is correct
51 Correct 6 ms 344 KB Output is correct
52 Correct 6 ms 344 KB Output is correct
53 Correct 4 ms 344 KB Output is correct
54 Correct 4 ms 344 KB Output is correct
55 Correct 5 ms 344 KB Output is correct
56 Correct 4 ms 344 KB Output is correct
57 Correct 6 ms 344 KB Output is correct
58 Correct 6 ms 344 KB Output is correct
59 Correct 6 ms 344 KB Output is correct
60 Correct 9 ms 800 KB Output is correct
61 Correct 7 ms 600 KB Output is correct
62 Correct 6 ms 344 KB Output is correct
63 Correct 6 ms 600 KB Output is correct
64 Correct 7 ms 344 KB Output is correct

Subtask #4
0.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 4 ms 344 KB Output is correct
3 Correct 4 ms 344 KB Output is correct
4 Correct 4 ms 344 KB Output is correct
5 Correct 4 ms 344 KB Output is correct
6 Incorrect 0 ms 344 KB Incorrect
7 Halted 0 ms 0 KB -