oj.uz

답안 #848626

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
848626 2023-09-13T06:11:57 Z piOOE 가장 긴 여행 (IOI23_longesttrip) C++17
15 / 100
 17 ms 604 KB 
#include "longesttrip.h"
#include <bits/stdc++.h>

using namespace std;

std::vector<int> longest_trip(int N, int D) {
    mt19937 rnd(228);

    vector<int> a, b, ord(N);
    iota(ord.begin(), ord.end(), 0);
    shuffle(ord.begin(), ord.end(), rnd);
    int known = -1;

    for (int x : ord) {
        if (a.empty() || b.empty()) {
            (a.empty() ? a : b).push_back(x);
            continue;
        }
        if (rnd() % 2) {
            swap(a, b);
        }
        if (0) {
            int res = are_connected({a.back()}, {x});
            if (res == 1) {
                a.push_back(x);
                known = -1;
            } else if (known != -1) {
                if (known == 1) { // unreachable
                    a.insert(a.end(), b.rbegin(), b.rend());
                    b = {x};
                    known = -1;
                } else {
                    b.push_back(x);
                    known = 0;
                }
            } else {
                res = are_connected({b.back()}, {x});
                if (res == 0) {
                    a.insert(a.end(), b.rbegin(), b.rend());
                    b = {x};
                    known = -1;
                } else {
                    b.push_back(x);
                    known = 0;
                }
            }
        } else {
            if (are_connected({a.back()}, {x})) {
                a.push_back(x);
            } else if (are_connected({b.back()}, {x})) {
                b.push_back(x);
            } else {
                a.insert(a.end(), b.rbegin(), b.rend());
                b = {x};
            }
        }
    }

    if (a.empty() || b.empty() || !are_connected(a, b)) {
        return a.size() > b.size() ? a : b;
    }

    if (size(a) < size(b)) {
        swap(a, b);
    }

    if (!are_connected(a, {b[0]})) {
        int lo = 0, hi = size(b);
        while (lo + 1 < hi) {
            int mid = lo + hi >> 1;
            if (are_connected(a, vector(b.begin(), b.begin() + mid))) {
                hi = mid;
            } else {
                lo = mid;
            }
        }
        rotate(b.begin(), b.begin() + lo, b.end());
    }

    assert(are_connected(a, {b[0]}));

    if (are_connected({a[0], a.back()}, {b[0]})) {
        if (are_connected({a[0]}, {b[0]})) {
            reverse(a.begin(), a.end());
        }
        a.insert(a.end(), b.begin(), b.end());
        return a;
    } else {
        int lo = 0, hi = size(b);
        while (lo + 1 < hi) {
            int mid = lo + hi >> 1;
            if (are_connected(vector(a.begin(), a.begin() + mid), {b[0]})) {
                hi = mid;
            } else {
                lo = mid;
            }
        }
        rotate(a.begin(), a.begin() + hi, a.end());
        a.insert(a.end(), b.begin(), b.end());
        return a;
    }
}

Compilation message

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:70:26: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   70 |             int mid = lo + hi >> 1;
      |                       ~~~^~~~
longesttrip.cpp:91:26: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   91 |             int mid = lo + hi >> 1;
      |                       ~~~^~~~

Subtask #0
0.0 / 0.0

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

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
0.0 / 25.0

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

Subtask #4
0.0 / 60.0

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