oj.uz

답안 #1074272

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1074272 2024-08-25T09:17:35 Z anango 가장 긴 여행 (IOI23_longesttrip) C++17
100 / 100
 16 ms 704 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);
    /*cout << "QUERYING " << endl;
    for (auto i:S) {
        cout << i <<" ";
    }
    cout << endl;
    for (auto i:T) {
        cout << i <<" ";
    }
    cout << endl;*/
    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 (i<n-2) {
            //merge two at a time
            int C = i;
            int D = i+1;
            int A = path1.back();
            int B = path2.back();
            bool ans1 = are_connected_valid({C},{D});
            bool ans2 = are_connected_valid({C},{A});
            bool ans3 = are_connected_valid({C},{B});
            if (ans1) {
                if (ans2) {
                    //connect both to A
                    path1.push_back(C);
                    path1.push_back(D);
                }
                else if (ans3) {
                    path2.push_back(C);
                    path2.push_back(D);
                }
                else {
                    //conglomerate the paths as we know A-B
                    while (path2.size()) {
                        path1.push_back(path2.back());
                        path2.pop_back();
                    }
                    path2={C,D};
                }
            }
            else {
                if (ans2 && ans3) {
                    //conglomerate C
                    path1.push_back(C);
                    while (path2.size()) {
                        path1.push_back(path2.back());
                        path2.pop_back();
                    }
                    path2={D};
                }
                else if ((!ans2) && (!ans3)) {
                    path1.push_back(D);
                    while (path2.size()) {
                        path1.push_back(path2.back());
                        path2.pop_back();
                    }
                    path2={C};
                }
                else {
                    if (ans2) {
                        path1.push_back(C);
                        path2.push_back(D);
                    }
                    else if (ans3) {
                        path1.push_back(D);
                        path2.push_back(C);
                    }
                    else {
                        assert(false);
                    }
                }
            }
            i++;
            continue;
        }
        //cout << "MEGABLOAT " << i << " " << path1.back() <<" " << path2.back() << endl;
        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--;
    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]);
    }

    return ans;
}

Compilation message

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:201:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  201 |     for (int i=x1+1; i<grp1.size(); i++) {
      |                      ~^~~~~~~~~~~~
longesttrip.cpp:207:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  207 |     for (int i=x2; i<grp2.size(); i++) {
      |                    ~^~~~~~~~~~~~

Subtask #0
0.0 / 0.0

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

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
25.0 / 25.0

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

Subtask #4
60.0 / 60.0

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