oj.uz

답안 #1059714

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1059714 2024-08-15T07:25:05 Z tolbi 가장 긴 여행 (IOI23_longesttrip) C++17
15 / 100
 10 ms 600 KB 
#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;
//bool are_connected(std::vector<int> A, std::vector<int> B);
bool sor(int x, int y){
    std::vector<int> ilk;
    std::vector<int> iki;
    ilk.push_back(x);
    iki.push_back(y);
    return are_connected(ilk,iki);
}
std::vector<int> longest_trip(int N, int D)
{
    vector<vector<int>> arr(N);
    for (int i = 0; i < N; i++){
        arr[i].push_back(i);
    }
    while (arr.size()>2){
        if (sor(arr[0].back(),arr[1][0])){
            for (auto it : arr[1]){
                arr[0].push_back(it);
            }
            swap(arr[1],arr.back());
            arr.pop_back();
        }
        else if (sor(arr[0].back(),arr[2][0])){
            for (auto it : arr[2]){
                arr[0].push_back(it);
            }
            swap(arr[2],arr.back());
            arr.pop_back();
        }
        else{
            reverse(arr[1].begin(), arr[1].end());
            for (auto it : arr[2]){
                arr[1].push_back(it);
            }
            swap(arr[2],arr.back());
            arr.pop_back();
        }
    }
    if (!are_connected(arr[0],arr[1])){
        if (arr[0].size()>arr[1].size()) return arr[0];
        return arr[1];
    }
    if (sor(arr[0].back(),arr[1][0])){
        for (auto it : arr[1]){
            arr[0].push_back(it);
        }
        return arr[0];
    }
    else if (sor(arr[0].back(),arr[1].back())){
        reverse(arr[1].begin(), arr[1].end());
        for (auto it : arr[1]){
            arr[0].push_back(it);
        }
        return arr[0];
    }
    swap(arr[0],arr[1]);
    if (sor(arr[0].back(),arr[1][0])){
        for (auto it : arr[1]){
            arr[0].push_back(it);
        }
        return arr[0];
    }
    else if (sor(arr[0].back(),arr[1].back())){
        reverse(arr[1].begin(), arr[1].end());
        for (auto it : arr[1]){
            arr[0].push_back(it);
        }
        return arr[0];
    }
    assert(sor(arr[0][0],arr[0].back()));
    assert(sor(arr[1][0],arr[1].back()));
    if (arr[0].size()>arr[1].size()) return arr[0];
    return arr[1];
    int l = 0, r = arr[0].size()-1;
    while (l<r){
        int mid = l+(r-l)/2;
        vector<int> sahbatur;
        for (int i = 0; i <= mid; i++){
            sahbatur.push_back(arr[0][i]);
        }
        if (are_connected(sahbatur,arr[1])){
            r=mid;
        }
        else l=mid+1;
    }
    int bir = l;

    l = 0, r = arr[1].size()-1;
    while (l<r){
        int mid = l+(r-l)/2;
        vector<int> sahbatur;
        for (int i = 0; i <= mid; i++){
            sahbatur.push_back(arr[1][i]);
        }
        if (are_connected(sahbatur,arr[0])){
            r=mid;
        }
        else l=mid+1;
    }
    int iki = l;
    vector<int> ans;
    for (int i = 0; i < arr[0].size(); i++){
        ans.push_back(arr[0][(bir+i+1)%arr[0].size()]);
    }
    for (int i = 0; i < arr[1].size(); i++){
        ans.push_back(arr[1][(iki+i)%arr[1].size()]);
    }
    return ans;
}

Compilation message

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

Subtask #0
0.0 / 0.0

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

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
0.0 / 25.0

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

Subtask #4
0.0 / 60.0

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