oj.uz

답안 #1078016

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1078016 2024-08-27T11:38:59 Z PanosPask 가장 긴 여행 (IOI23_longesttrip) C++17
15 / 100
 12 ms 440 KB 
#include "longesttrip.h"
#include <bits/stdc++.h>
#define pb push_back

using namespace std;

void extend(vector<int>& a, vector<int>& b, int first, int last)
{
    for (int i = first; i <= last; i++) {
        a.pb(b[i]);
    }
}

bool connected(vector<int> v1, vector<int> v2)
{
    v1.resize(unique(v1.begin(), v1.end()) - v1.begin());
    v2.resize(unique(v2.begin(), v2.end()) - v2.begin());

    return are_connected(v1, v2);
}

vector<int> longest_trip(int N, int D)
{
    vector<int> v1, v2;

    v1.pb(0);
    v2.pb(1);

    // True if we are sure that the last elements of v1 and v2 are disconnected
    bool last_disconnect = true;

    for (int i = 2; i < N; i++) {
        if (connected({v1.back()}, {i})) {
            v1.pb(i);
            last_disconnect = false;
        }
        else {
            if (last_disconnect || connected({v2.back()}, {i})) {
                v2.pb(i);

                // i and v2.back() are not connected(asserted above)
                last_disconnect = true;
            }
            else {
                // The density constraint means that the last elements of v1 and v2 are connected
                reverse(v2.begin(), v2.end());
                extend(v1, v2, 0, v2.size() - 1);
                
                v2.clear();
                v2.pb(i);

                if (v2.size() > 1) {
                    last_disconnect = false;
                }
                else {
                    // The last element of the new v1 is, once again, v2.back() and it is definetely not connected to i
                    last_disconnect = true;
                }
            }
        } 

        if (v1.size() < v2.size()) {
            swap(v1, v2);
        }
    }

    vector<int> res;

    if (connected(v1, v2)) {
        if (connected({v1.front(), v1.back()}, {v2.front(), v2.back()})) {
            // Some endpoints are connected
            if (connected({v1.front()}, {v2.front(), v2.back()})) {
                reverse(v1.begin(), v1.end());
            }
            if (connected({v1.back()}, {v2.back()})) {
                reverse(v2.begin(), v2.end());
            }

            extend(res, v1, 0, v1.size() - 1);
            extend(res, v2, 0, v2.size() - 1);
        }
        else {
            // No endpoints are connected => v1 and v2 are 2 cycles
            int l = 0;
            int r = v1.size();

            while (l + 1 < r) {
                int mid = (l + r) / 2;
                if (connected(vector<int>(v1.begin(), v1.begin() + mid), v2)) {
                    r = mid;
                }
                else {
                    l = mid;
                }
            }

            int p1 = l;
            l = 0;
            r = v2.size();
            while (l + 1 < r) {
                int mid = (l + r) / 2;
                if (connected(vector<int>(v2.begin(), v2.begin() + mid), {v1[p1]})) {
                    r = mid;
                }
                else {
                    l = mid;
                }
            }

            int p2 = l;

            extend(res, v1, p1 + 1, v1.size() - 1);
            extend(res, v1, 0, p1);
            extend(res, v2, p2, v2.size() - 1);
            extend(res, v2, 0, p2 - 1);
        }
    }
    else {
        res = v1;
    }

    return res;
}

Subtask #0
0.0 / 0.0

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

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 344 KB Output is correct
2 Correct 7 ms 344 KB Output is correct
3 Correct 4 ms 344 KB Output is correct
4 Correct 7 ms 344 KB Output is correct
5 Correct 8 ms 344 KB Output is correct
6 Correct 10 ms 344 KB Output is correct
7 Correct 6 ms 344 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 6 ms 344 KB Output is correct
10 Correct 8 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 5 ms 344 KB Output is correct
14 Incorrect 1 ms 344 KB Incorrect
15 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 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 5 ms 344 KB Output is correct
5 Correct 5 ms 344 KB Output is correct
6 Correct 11 ms 344 KB Output is correct
7 Correct 7 ms 344 KB Output is correct
8 Correct 9 ms 344 KB Output is correct
9 Correct 6 ms 344 KB Output is correct
10 Correct 6 ms 440 KB Output is correct
11 Correct 6 ms 344 KB Output is correct
12 Correct 8 ms 344 KB Output is correct
13 Correct 6 ms 436 KB Output is correct
14 Incorrect 1 ms 344 KB Incorrect
15 Halted 0 ms 0 KB -