oj.uz

답안 #1074233

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1074233 2024-08-25T08:57:45 Z anango 가장 긴 여행 (IOI23_longesttrip) C++17
85 / 100
 12 ms 692 KB 
#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;

int n;
bool are_connected_valid(vector<int> S, vector<int> T) {
    sort(S.begin(), S.end());
    sort(T.begin(), T.end());
    //assert(S.size()>0);
    //assert(T.size()>0);
    if (S.size()==0 || T.size()==0) {
        return 0;
    }
    return are_connected(S,T);
}

vector<int> longest_trip(int N, int D) {
    n=N;
    deque<int> path1;
    deque<int> path2;
    path1.push_back(0);
    path2.push_back(1);
    for (int i=2; i<n; i++) {
        if (are_connected_valid({path1.back()},{i})) {
            path1.push_back(i);
        }
        else if (are_connected_valid({path2.back()},{i})) {
            path2.push_back(i);
        }
        else {
            //path1's end is connected to path2's end
            while (path2.size()) {
                path1.push_back(path2.back());
                path2.pop_back();
            }
            path2={i};
        }
    }
    vector<int> grp1(path1.begin(), path1.end());
    vector<int> grp2(path2.begin(), path2.end());
    //cout << "JAMBLOAT" <<  " " << grp1.size() <<" " << grp2.size() << endl;
    if (grp1.size()<grp2.size()) {
        swap(grp1,grp2);
    }
    if (grp1.size()==0 || grp2.size()==0 || !are_connected_valid(grp1,grp2)) {
        return grp1;
    }
    vector<int> end1 = {grp1.front(), grp1.back()};
    vector<int> end2 = {grp2.front(), grp2.back()};
    end1.erase(unique(end1.begin(), end1.end()),end1.end());
    end2.erase(unique(end2.begin(), end2.end()),end2.end());
    if (are_connected_valid(end1,end2)) {
        if (are_connected_valid({grp1.front()},{grp2.front()})) {
            vector<int> con;
            for (auto i:grp1) {
                con.push_back(i);
            }
            reverse(con.begin(), con.end());
            for (auto i:grp2) {
                con.push_back(i);
            }
            return con; //length n
        }
        if (are_connected_valid({grp1.front()},{grp2.back()})) {
            vector<int> con;
            for (auto i:grp1) {
                con.push_back(i);
            }
            reverse(con.begin(), con.end());
            reverse(grp2.begin(), grp2.end());
            for (auto i:grp2) {
                con.push_back(i);
            }
            return con; //length n
        }
        if (are_connected_valid({grp1.back()},{grp2.front()})) {
            vector<int> con;
            for (auto i:grp1) {
                con.push_back(i);
            }
            for (auto i:grp2) {
                con.push_back(i);
            }
            return con; //length n
        }
        if (are_connected_valid({grp1.back()},{grp2.back()})) {
            vector<int> con;
            for (auto i:grp1) {
                con.push_back(i);
            }
            reverse(grp2.begin(), grp2.end());
            for (auto i:grp2) {
                con.push_back(i);
            }
            return con; //length n
        }
    }

    int l = 1;
    int r = grp1.size();
    while (l<r) {
        int m = (l+r)/2;
        vector<int> part(grp1.begin(), grp1.begin()+m);
        if (are_connected_valid(part,grp2)) {
            r=m;
        }
        else {
            l=m+1;
        }
    }
    int x1 = l;
    x1--;
    l = 1;
    r = grp2.size();
    while (l<r) {
        int m = (l+r)/2;
        vector<int> part(grp2.begin(), grp2.begin()+m);
        if (are_connected_valid({grp1[x1]},part)) {
            r=m;
        }
        else {
            l=m+1;
        }
    }
    int x2 = l;
    x2--;
    assert(are_connected_valid({grp1[x1]},{grp2[x2]}));
    vector<int> ans;
    for (int i=x1+1; i<grp1.size(); i++) {
        ans.push_back(grp1[i]);
    }
    for (int i=0; i<=x1; i++) {
        ans.push_back(grp1[i]);
    }
    for (int i=x2; i<grp2.size(); i++) {
        ans.push_back(grp2[i]);
    } 
    for (int i=0; i<x2; i++) {
        ans.push_back(grp2[i]);
    }
    assert(ans.size()==n && grp1.size()+grp2.size()==n);
    for (int i=0; i<n-1; i++) {
        if (ans[i]!=grp1[x1]) continue;
        //assert(ans[i+1]==grp2[x2]);
        //assert(are_connected_valid({ans[i]},{ans[i+1]}));
    }
    return ans;
}

Compilation message

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:129:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  129 |     for (int i=x1+1; i<grp1.size(); i++) {
      |                      ~^~~~~~~~~~~~
longesttrip.cpp:135:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  135 |     for (int i=x2; i<grp2.size(); i++) {
      |                    ~^~~~~~~~~~~~
In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from longesttrip.cpp:2:
longesttrip.cpp:141:22: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  141 |     assert(ans.size()==n && grp1.size()+grp2.size()==n);
      |            ~~~~~~~~~~^~~
longesttrip.cpp:141:52: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  141 |     assert(ans.size()==n && grp1.size()+grp2.size()==n);
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~

Subtask #0
0.0 / 0.0

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

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 344 KB Output is correct
2 Correct 7 ms 344 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 6 ms 344 KB Output is correct
5 Correct 5 ms 344 KB Output is correct
6 Correct 7 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 7 ms 344 KB Output is correct
10 Correct 5 ms 344 KB Output is correct
11 Correct 5 ms 344 KB Output is correct
12 Correct 5 ms 344 KB Output is correct
13 Correct 7 ms 436 KB Output is correct

Subtask #3
25.0 / 25.0

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

Subtask #4
45.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 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 6 ms 344 KB Output is correct
6 Correct 10 ms 344 KB Output is correct
7 Correct 11 ms 344 KB Output is correct
8 Correct 6 ms 344 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 7 ms 600 KB Output is correct
11 Correct 5 ms 344 KB Output is correct
12 Correct 5 ms 344 KB Output is correct
13 Correct 5 ms 344 KB Output is correct
14 Correct 9 ms 344 KB Output is correct
15 Correct 8 ms 344 KB Output is correct
16 Correct 8 ms 344 KB Output is correct
17 Correct 7 ms 344 KB Output is correct
18 Correct 6 ms 344 KB Output is correct
19 Correct 7 ms 344 KB Output is correct
20 Correct 8 ms 600 KB Output is correct
21 Correct 8 ms 344 KB Output is correct
22 Correct 8 ms 344 KB Output is correct
23 Correct 6 ms 432 KB Output is correct
24 Correct 6 ms 344 KB Output is correct
25 Correct 6 ms 440 KB Output is correct
26 Correct 7 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 4 ms 344 KB Output is correct
30 Correct 6 ms 600 KB Output is correct
31 Correct 6 ms 344 KB Output is correct
32 Correct 11 ms 344 KB Output is correct
33 Correct 10 ms 344 KB Output is correct
34 Correct 8 ms 344 KB Output is correct
35 Correct 8 ms 344 KB Output is correct
36 Correct 7 ms 344 KB Output is correct
37 Correct 6 ms 436 KB Output is correct
38 Correct 9 ms 344 KB Output is correct
39 Correct 7 ms 344 KB Output is correct
40 Correct 6 ms 344 KB Output is correct
41 Correct 7 ms 600 KB Output is correct
42 Correct 6 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 6 ms 344 KB Output is correct
46 Correct 6 ms 344 KB Output is correct
47 Correct 5 ms 428 KB Output is correct
48 Correct 5 ms 344 KB Output is correct
49 Correct 4 ms 344 KB Output is correct
50 Correct 7 ms 344 KB Output is correct
51 Partially correct 7 ms 344 KB Output is partially correct
52 Correct 6 ms 344 KB Output is correct
53 Correct 10 ms 688 KB Output is correct
54 Correct 10 ms 344 KB Output is correct
55 Correct 11 ms 344 KB Output is correct
56 Correct 6 ms 344 KB Output is correct
57 Partially correct 8 ms 344 KB Output is partially correct
58 Partially correct 6 ms 344 KB Output is partially correct
59 Partially correct 8 ms 344 KB Output is partially correct
60 Correct 7 ms 344 KB Output is correct
61 Correct 8 ms 344 KB Output is correct
62 Correct 6 ms 344 KB Output is correct
63 Partially correct 9 ms 684 KB Output is partially correct
64 Partially correct 10 ms 616 KB Output is partially correct
65 Partially correct 6 ms 600 KB Output is partially correct
66 Partially correct 6 ms 432 KB Output is partially correct
67 Correct 9 ms 688 KB Output is correct
68 Correct 7 ms 344 KB Output is correct
69 Partially correct 8 ms 344 KB Output is partially correct
70 Partially correct 7 ms 452 KB Output is partially correct
71 Correct 6 ms 344 KB Output is correct
72 Partially correct 7 ms 344 KB Output is partially correct
73 Partially correct 10 ms 448 KB Output is partially correct
74 Partially correct 8 ms 452 KB Output is partially correct
75 Correct 7 ms 344 KB Output is correct
76 Correct 7 ms 456 KB Output is correct
77 Correct 5 ms 344 KB Output is correct
78 Partially correct 9 ms 464 KB Output is partially correct
79 Correct 10 ms 452 KB Output is correct
80 Partially correct 10 ms 436 KB Output is partially correct
81 Correct 9 ms 456 KB Output is correct
82 Correct 7 ms 600 KB Output is correct