oj.uz

답안 #941899

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
941899 2024-03-09T16:23:20 Z benjaminkleyn 가장 긴 여행 (IOI23_longesttrip) C++17
15 / 100
 11 ms 600 KB 
#include <bits/stdc++.h>
#include "longesttrip.h"
using namespace std;

vector<int> longest_trip(int N, int D)
{
    if (D == 3)
    {
        vector<int> res(N);
        iota(res.begin(), res.end(), 0);
        return res;
    }

    if (D == 2)
    {
        vector<int> res;
        int cur;
        if (are_connected({0}, {1}))
            res = {0, 1}, cur = 2;
        else
            res = {0, 2, 1}, cur = 3;

        for (int i = cur; i < N; i++)
        {
            if (!are_connected({res.back()}, {i}))
                reverse(res.begin(), res.end());
            res.push_back(i);
        }

        return res;
    }

    vector<int> A = {0}, B = {1};
    bool flagAB = false;
    for (int i = 2; i + 1 < N; i += 2)
    {
        if (are_connected({i}, {i + 1}))
        {
            // now we know i and i + 1 are connected.
            if (are_connected({i}, {A.back(), B.back()}))
            {
                if (are_connected({i}, {A.back()}))
                {
                    A.push_back(i);
                    A.push_back(i + 1);
                }
                else
                {
                    A.push_back(i);
                    A.push_back(i + 1);
                }
            }
            else
            {
                reverse(B.begin(), B.end());
                for (int x : B) A.push_back(x);
                B = {i, i + 1};
            }
        }
        else
        {
            if (are_connected({A.back()}, {i}))
            {
                A.push_back(i);
                if (are_connected({B.back()}, {i + 1}))
                    B.push_back(i + 1);
                else
                {
                    reverse(B.begin(), B.end());
                    for (int x : B)
                        A.push_back(x);
                    B = {i + 1};
                }
            }
            else
            {
                A.push_back(i + 1);
                if (are_connected({B.back()}, {i}))
                    B.push_back(i);
                else
                {
                    reverse(B.begin(), B.end());
                    for (int x : B)
                        A.push_back(x);
                    B = {i};
                }
            }
        }
    }
    if (N % 2)
    {
        if (are_connected({N - 1}, {A.back(), B.back()}))
        {
            if (are_connected({N - 1}, {A.back()}))
                A.push_back(N - 1);
            else
                B.push_back(N - 1);
        }
        else
        {
            reverse(B.begin(), B.end());
            for (int x : B)
                A.push_back(x);
            B = {N - 1};
        }
    }
    if (!are_connected(A, B))
    {
        if (A.size() > B.size())
            return A;
        return B;
    }
    if (A.size() > 1 && !are_connected({A[0]}, {A.back()}))
    {
        if ((!flagAB) && are_connected({A.back()}, {B.back()}))
            reverse(A.begin(), A.end());
        for (int x : A)
            B.push_back(x);
        return B;
    }
    if (B.size() > 1 && !are_connected({B[0]}, {B.back()}))
    {
        if ((!flagAB) && are_connected({A.back()}, {B.back()}))
            reverse(B.begin(), B.end());
        for (int x : B)
            A.push_back(x);
        return A;
    }
    int lo = 1, hi = A.size();
    while (lo < hi)
    {
        int mid = (lo + hi) / 2;
        if (are_connected(vector<int>(A.begin(), A.begin() + mid), B))
            hi = mid;
        else
            lo = mid + 1;
    }
    int idxA = lo - 1;
    lo = 1, hi = B.size();
    while (lo < hi)
    {
        int mid = (lo + hi) / 2;
        if (are_connected(vector<int>(B.begin(), B.begin() + mid), {A[idxA]}))
            hi = mid;
        else
            lo = mid + 1;
    }
    int idxB = lo - 1;
    vector<int> res;
    for (int i = idxA + 1; i < A.size(); i++)
        res.push_back(A[i]);
    for (int i = 0; i <= idxA; i++)
        res.push_back(A[i]);
    for (int i = idxB; i < B.size(); i++)
        res.push_back(B[i]);
    for (int i = 0; i < idxB; i++)
        res.push_back(B[i]);
    return res;
}

Compilation message

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:150:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  150 |     for (int i = idxA + 1; i < A.size(); i++)
      |                            ~~^~~~~~~~~~
longesttrip.cpp:154:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  154 |     for (int i = idxB; i < B.size(); i++)
      |                        ~~^~~~~~~~~~

Subtask #0
0.0 / 0.0

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

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 344 KB Output is correct
2 Correct 9 ms 344 KB Output is correct
3 Correct 7 ms 344 KB Output is correct
4 Correct 7 ms 344 KB Output is correct
5 Correct 7 ms 344 KB Output is correct
6 Correct 11 ms 344 KB Output is correct
7 Incorrect 0 ms 344 KB Incorrect
8 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 344 KB Output is correct
2 Correct 11 ms 344 KB Output is correct
3 Correct 7 ms 344 KB Output is correct
4 Correct 7 ms 344 KB Output is correct
5 Correct 6 ms 600 KB Output is correct
6 Correct 11 ms 344 KB Output is correct
7 Incorrect 0 ms 344 KB Incorrect
8 Halted 0 ms 0 KB -