oj.uz

답안 #846644

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
846644 2023-09-08T08:11:51 Z ttamx 가장 긴 여행 (IOI23_longesttrip) C++17
100 / 100
 10 ms 860 KB 
#include "longesttrip.h"
#include<bits/stdc++.h>

using namespace std;

int bsearch(vector<int> vec,vector<int> fixed){
    int l=0,r=vec.size()-1;
    while(l<r){
        int m=(l+r)/2;
        vector<int> res;
        for(int i=l;i<=m;i++)res.emplace_back(vec[i]);
        if(are_connected(res,fixed))r=m;
        else l=m+1;
    }
    return l;
}

vector<int> longest_trip(int N, int D){
    vector<int> path[2];
    for(int i=0;i<2;i++)path[i].emplace_back(i);
    bool ok=true;
    for(int i=2;i<N;i++){
        if(are_connected({i},{path[0].back()})){
            path[0].emplace_back(i);
            ok=true;
            continue;
        }
        if(!ok||are_connected({i},{path[1].back()})){
            path[1].emplace_back(i);
            ok=false;
            continue;
        }
        while(!path[1].empty()){
            path[0].emplace_back(path[1].back());
            path[1].pop_back();
        }
        ok=true;
        path[1].emplace_back(i);
    }
    if(path[0].size()<path[1].size())swap(path[0],path[1]);
    if(!are_connected(path[0],path[1]))return path[0];
    if(are_connected({path[0][0]},{path[1][0]})){
        reverse(path[1].begin(),path[1].end());
        auto ans=path[1];
        for(auto x:path[0])ans.emplace_back(x);
        return ans;
    }
    if(are_connected({path[0][0]},{path[1].back()})){
        auto ans=path[1];
        for(auto x:path[0])ans.emplace_back(x);
        return ans;
    }
    if(are_connected({path[0].back()},{path[1][0]})){
        auto ans=path[0];
        for(auto x:path[1])ans.emplace_back(x);
        return ans;
    }
    if(are_connected({path[0].back()},{path[1].back()})){
        auto ans=path[0];
        reverse(path[1].begin(),path[1].end());
        for(auto x:path[1])ans.emplace_back(x);
        return ans;
    }
    int id0=bsearch(path[0],path[1]);
    int id1=bsearch(path[1],{path[0][id0]});
    vector<int> ans;
    for(int i=0;i<path[0].size();i++)ans.emplace_back(path[0][(id0+i+1)%path[0].size()]);
    for(int i=0;i<path[1].size();i++)ans.emplace_back(path[1][(id1+i)%path[1].size()]);
    return ans;
}

Compilation message

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:67:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |     for(int i=0;i<path[0].size();i++)ans.emplace_back(path[0][(id0+i+1)%path[0].size()]);
      |                 ~^~~~~~~~~~~~~~~
longesttrip.cpp:68:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |     for(int i=0;i<path[1].size();i++)ans.emplace_back(path[1][(id1+i)%path[1].size()]);
      |                 ~^~~~~~~~~~~~~~~

Subtask #0
0.0 / 0.0

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

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 6 ms 344 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 7 ms 344 KB Output is correct
5 Correct 5 ms 436 KB Output is correct
6 Correct 9 ms 344 KB Output is correct
7 Correct 6 ms 596 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 5 ms 600 KB Output is correct
11 Correct 5 ms 344 KB Output is correct
12 Correct 5 ms 600 KB Output is correct
13 Correct 5 ms 344 KB Output is correct
14 Correct 8 ms 344 KB Output is correct
15 Correct 7 ms 344 KB Output is correct
16 Correct 8 ms 344 KB Output is correct
17 Correct 7 ms 436 KB Output is correct
18 Correct 6 ms 600 KB Output is correct
19 Correct 6 ms 440 KB Output is correct
20 Correct 6 ms 688 KB Output is correct
21 Correct 6 ms 860 KB Output is correct
22 Correct 5 ms 600 KB Output is correct
23 Correct 6 ms 604 KB Output is correct
24 Correct 6 ms 600 KB Output is correct
25 Correct 6 ms 344 KB Output is correct
26 Correct 9 ms 344 KB Output is correct
27 Correct 6 ms 344 KB Output is correct
28 Correct 6 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 6 ms 344 KB Output is correct
32 Correct 6 ms 344 KB Output is correct
33 Correct 4 ms 344 KB Output is correct
34 Correct 5 ms 344 KB Output is correct
35 Correct 5 ms 344 KB Output is correct
36 Correct 5 ms 608 KB Output is correct
37 Correct 6 ms 600 KB Output is correct
38 Correct 6 ms 436 KB Output is correct
39 Correct 6 ms 600 KB Output is correct
40 Correct 6 ms 344 KB Output is correct
41 Correct 6 ms 600 KB Output is correct
42 Correct 6 ms 600 KB Output is correct
43 Correct 6 ms 344 KB Output is correct
44 Correct 6 ms 600 KB Output is correct
45 Correct 8 ms 344 KB Output is correct
46 Correct 8 ms 344 KB Output is correct
47 Correct 8 ms 344 KB Output is correct
48 Correct 10 ms 344 KB Output is correct
49 Correct 7 ms 344 KB Output is correct
50 Correct 6 ms 344 KB Output is correct
51 Correct 6 ms 684 KB Output is correct
52 Correct 7 ms 344 KB Output is correct
53 Correct 6 ms 600 KB Output is correct
54 Correct 6 ms 344 KB Output is correct
55 Correct 5 ms 344 KB Output is correct
56 Correct 5 ms 600 KB Output is correct
57 Correct 5 ms 600 KB Output is correct
58 Correct 7 ms 340 KB Output is correct
59 Correct 8 ms 696 KB Output is correct
60 Correct 7 ms 436 KB Output is correct
61 Correct 6 ms 416 KB Output is correct
62 Correct 7 ms 600 KB Output is correct
63 Correct 5 ms 604 KB Output is correct
64 Correct 6 ms 344 KB Output is correct

Subtask #4
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 5 ms 344 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 4 ms 344 KB Output is correct
5 Correct 5 ms 344 KB Output is correct
6 Correct 9 ms 344 KB Output is correct
7 Correct 7 ms 344 KB Output is correct
8 Correct 6 ms 344 KB Output is correct
9 Correct 6 ms 852 KB Output is correct
10 Correct 6 ms 600 KB Output is correct
11 Correct 5 ms 436 KB Output is correct
12 Correct 5 ms 440 KB Output is correct
13 Correct 5 ms 344 KB Output is correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 7 ms 344 KB Output is correct
16 Correct 7 ms 344 KB Output is correct
17 Correct 5 ms 600 KB Output is correct
18 Correct 6 ms 600 KB Output is correct
19 Correct 6 ms 444 KB Output is correct
20 Correct 6 ms 856 KB Output is correct
21 Correct 6 ms 344 KB Output is correct
22 Correct 8 ms 344 KB Output is correct
23 Correct 8 ms 344 KB Output is correct
24 Correct 5 ms 344 KB Output is correct
25 Correct 6 ms 344 KB Output is correct
26 Correct 5 ms 344 KB Output is correct
27 Correct 7 ms 344 KB Output is correct
28 Correct 7 ms 344 KB Output is correct
29 Correct 8 ms 344 KB Output is correct
30 Correct 4 ms 344 KB Output is correct
31 Correct 5 ms 344 KB Output is correct
32 Correct 10 ms 344 KB Output is correct
33 Correct 10 ms 344 KB Output is correct
34 Correct 9 ms 596 KB Output is correct
35 Correct 9 ms 344 KB Output is correct
36 Correct 9 ms 344 KB Output is correct
37 Correct 6 ms 344 KB Output is correct
38 Correct 6 ms 436 KB Output is correct
39 Correct 6 ms 344 KB Output is correct
40 Correct 7 ms 344 KB Output is correct
41 Correct 6 ms 344 KB Output is correct
42 Correct 6 ms 344 KB Output is correct
43 Correct 5 ms 860 KB Output is correct
44 Correct 6 ms 440 KB Output is correct
45 Correct 5 ms 440 KB Output is correct
46 Correct 6 ms 444 KB Output is correct
47 Correct 4 ms 608 KB Output is correct
48 Correct 5 ms 344 KB Output is correct
49 Correct 6 ms 344 KB Output is correct
50 Correct 6 ms 344 KB Output is correct
51 Correct 6 ms 344 KB Output is correct
52 Correct 7 ms 344 KB Output is correct
53 Correct 5 ms 600 KB Output is correct
54 Correct 7 ms 600 KB Output is correct
55 Correct 6 ms 344 KB Output is correct
56 Correct 5 ms 600 KB Output is correct
57 Correct 6 ms 600 KB Output is correct
58 Correct 6 ms 344 KB Output is correct
59 Correct 6 ms 852 KB Output is correct
60 Correct 6 ms 600 KB Output is correct
61 Correct 6 ms 344 KB Output is correct
62 Correct 5 ms 344 KB Output is correct
63 Correct 5 ms 600 KB Output is correct
64 Correct 6 ms 344 KB Output is correct
65 Correct 6 ms 604 KB Output is correct
66 Correct 7 ms 440 KB Output is correct
67 Correct 6 ms 436 KB Output is correct
68 Correct 7 ms 344 KB Output is correct
69 Correct 7 ms 596 KB Output is correct
70 Correct 7 ms 344 KB Output is correct
71 Correct 5 ms 344 KB Output is correct
72 Correct 6 ms 600 KB Output is correct
73 Correct 9 ms 604 KB Output is correct
74 Correct 8 ms 440 KB Output is correct
75 Correct 6 ms 344 KB Output is correct
76 Correct 9 ms 596 KB Output is correct
77 Correct 6 ms 344 KB Output is correct
78 Correct 6 ms 600 KB Output is correct
79 Correct 8 ms 600 KB Output is correct
80 Correct 8 ms 344 KB Output is correct
81 Correct 7 ms 608 KB Output is correct
82 Correct 9 ms 600 KB Output is correct