oj.uz

Submission #1059730

# Submission time Handle Problem Language Result Execution time Memory
1059730 2024-08-15T07:34:27 Z tolbi Longest Trip (IOI23_longesttrip) C++17
5 / 100
 11 ms 584 KB 
#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;
//bool are_connected(std::vector<int> A, std::vector<int> B);
map<pair<int,int>,bool> mp;
bool sor(int x, int y){
    if (mp.count({x,y})) return mp[{x,y}];
    std::vector<int> ilk;
    std::vector<int> iki;
    ilk.push_back(x);
    iki.push_back(y);
    return mp[{x,y}]=mp[{y,x}]=are_connected(ilk,iki);
}
mt19937 ayahya(chrono::high_resolution_clock().now().time_since_epoch().count());
int get(int l, int r){
    return l+(ayahya()%(r-l+1));
}
template<typename T> void shuffle_arr(vector<T> &arr){
for (int i = 0; i < arr.size()-1; i++){
    swap(arr[i],arr[get(i,arr.size()-1)]);
}
}
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){
        shuffle_arr(arr);
        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];
    }
    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;
    vector<int> longrunner(1,arr[0][bir]);
    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,longrunner)){
            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:113:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  113 |     for (int i = 0; i < arr[0].size(); i++){
      |                     ~~^~~~~~~~~~~~~~~
longesttrip.cpp:116:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  116 |     for (int i = 0; i < arr[1].size(); i++){
      |                     ~~^~~~~~~~~~~~~~~
longesttrip.cpp: In instantiation of 'void shuffle_arr(std::vector<_Tp>&) [with T = std::vector<int>]':
longesttrip.cpp:30:24:   required from here
longesttrip.cpp:19:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 | for (int i = 0; i < arr.size()-1; i++){
      |                 ~~^~~~~~~~~~~~~~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 3 ms 344 KB Output is correct

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 344 KB Output is correct
2 Correct 3 ms 344 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 6 ms 344 KB Output is correct
5 Correct 10 ms 584 KB Output is correct

Subtask #2
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 344 KB Output is correct
2 Correct 2 ms 344 KB Output is correct
3 Correct 6 ms 516 KB Output is correct
4 Correct 7 ms 344 KB Output is correct
5 Correct 11 ms 344 KB Output is correct
6 Incorrect 1 ms 344 KB Incorrect
7 Halted 0 ms 0 KB -

Subtask #3
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 344 KB Output is correct
2 Correct 2 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 8 ms 344 KB Output is correct
6 Incorrect 0 ms 344 KB Incorrect
7 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 344 KB Output is correct
2 Correct 2 ms 440 KB Output is correct
3 Correct 6 ms 344 KB Output is correct
4 Correct 9 ms 344 KB Output is correct
5 Correct 8 ms 568 KB Output is correct
6 Incorrect 1 ms 344 KB Incorrect
7 Halted 0 ms 0 KB -