제출 #1070865

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1070865		zsombor	가장 긴 여행 (IOI23_longesttrip)	C++17	85 / 100	19 ms	600 KiB

longesttrip

#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;

int n;
vector<int> a;
vector<int> b;

void pf(vector<int> &v, int x) {
    v.push_back(0);
    for (int i = v.size() - 1; i > 0; i--) v[i] = v[i - 1];
    v[0] = x;
}

void pb(vector<int> &v, int x) {
    v.push_back(x);
}

bool query(vector<int> x, int l, int r, vector<int> &v) {
    vector<int> u;
    for (int i = l; i < r; i++) u.push_back(v[i]);
    return are_connected({x}, u);
}

int bin(vector<int> x, vector<int> &v) {
    int l = 0, r = v.size(), m;
    if (!query(x, l, r, v)) return -1;
    while (r - l > 1) {
        m = (l + r) / 2;
        (query(x, l, m, v) ? r = m : l = m);
    }
    return l;
}

bool try_add(int x, vector<int> &v) {
    if (!v.size()) {
        pb(v, x);
        return true;
    }
    if (v.size() == 1) {
        if (are_connected({v[0]}, {x})) {
            pb(v, x);
            return true;
        }
        return false;
    }
    int y = v[0], z = v.back();
    if (are_connected({y}, {x})) {
        reverse(v.begin(), v.end());
        pb(v, x);
        return true;
    }
    if (are_connected({z}, {x})) {
        pb(v, x);
        return true;
    }
    int k = bin({x}, v);
    if (k == -1) return false;
    vector<int> u;
    for (int i = k + 1; i < v.size(); i++) pb(u, v[i]);
    for (int i = 0; i <= k; i++) pb(u, v[i]);
    v = u;
    v.push_back(x);
    return true;
}

void solve() {
    for (int i = 2; i < n - 1; i += 2) {
        int x = i, y = i + 1;
        bool A = are_connected({x}, {a.back()});
        bool B = are_connected({x}, {b.back()});
        if (are_connected({x}, {y})) {
            if (A) {
                a.push_back(x);
                a.push_back(y);
            }
            if (!A && B) {
                b.push_back(x);
                b.push_back(y);
            }
            if (!A && !B) {
                while (b.size()) {
                    a.push_back(b.back());
                    b.pop_back();
                }
                b.push_back(x);
                b.push_back(y);
            }
        } else {
            if (A == B) {
                if (!A) swap(x, y);
                a.push_back(x);
                while (b.size()) {
                    a.push_back(b.back());
                    b.pop_back();
                }
                b.push_back(y);
            } else {
                if (!A) swap(x, y);
                a.push_back(x);
                b.push_back(y);
            }
        }
    }
    if (n % 2) {
        if (are_connected({a.back()}, {b.back()})) {
            while (b.size()) {
                a.push_back(b.back());
                b.pop_back();
            }
        }
        if (are_connected({n - 1}, {a.back()})) a.push_back(n - 1);
        else b.push_back(n - 1);
    }
}

vector<int> longest_trip(int N, int D) {
    n = N;
    a = {0};
    b = {1};
    solve();
    if (a.size() < b.size()) swap(a, b);
    if (!b.size()) return a;

    for (int i = 0; i < 2; i++) {
        if (try_add(a.back(), b)) {
            b.pop_back();
            while (b.size()) {
                a.push_back(b.back());
                b.pop_back();
            }
            return a;
        }
        swap(a, b);
    }

    if (!are_connected(a, b)) return a;
    int y = bin(b, a);
    int z = bin({a[y]}, b);

    vector<int> u;
    for (int i = y + 1; i < a.size(); i++) pb(u, a[i]);
    for (int i = 0; i <= y; i++) pb(u, a[i]);
    for (int i = z; i < b.size(); i++) pb(u, b[i]);
    for (int i = 0; i < z; i++) pb(u, b[i]);
    return u;
}

컴파일 시 표준 에러 (stderr) 메시지

longesttrip.cpp: In function 'bool try_add(int, std::vector<int>&)':
longesttrip.cpp:60:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |     for (int i = k + 1; i < v.size(); i++) pb(u, v[i]);
      |                         ~~^~~~~~~~~~
longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:142:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  142 |     for (int i = y + 1; i < a.size(); i++) pb(u, a[i]);
      |                         ~~^~~~~~~~~~
longesttrip.cpp:144:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  144 |     for (int i = z; i < b.size(); i++) pb(u, b[i]);
      |                     ~~^~~~~~~~~~

• Subtask 0: 0 / 0
• Subtask 1: 5 / 5
• Subtask 2: 10 / 10
• Subtask 3: 25 / 25
• Subtask 4: 45 / 60