oj.uz

Submission #1059731

# Submission time Handle Problem Language Result Execution time Memory
1059731 2024-08-15T07:34:56 Z tolbi Longest Trip (IOI23_longesttrip) C++17
85 / 100
 15 ms 856 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)
{
    mp.clear();
    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:114:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  114 |     for (int i = 0; i < arr[0].size(); i++){
      |                     ~~^~~~~~~~~~~~~~~
longesttrip.cpp:117:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  117 |     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:31: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 0 ms 344 KB Output is correct
2 Correct 3 ms 468 KB Output is correct

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 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 7 ms 344 KB Output is correct
5 Correct 10 ms 344 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 6 ms 344 KB Output is correct
3 Correct 6 ms 344 KB Output is correct
4 Correct 8 ms 344 KB Output is correct
5 Correct 10 ms 600 KB Output is correct
6 Correct 8 ms 344 KB Output is correct
7 Correct 6 ms 440 KB Output is correct
8 Correct 6 ms 344 KB Output is correct
9 Correct 6 ms 344 KB Output is correct
10 Correct 10 ms 480 KB Output is correct
11 Correct 7 ms 492 KB Output is correct
12 Correct 7 ms 344 KB Output is correct
13 Correct 10 ms 500 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 7 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 344 KB Output is correct
5 Correct 10 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 6 ms 448 KB Output is correct
10 Correct 7 ms 344 KB Output is correct
11 Correct 10 ms 492 KB Output is correct
12 Correct 7 ms 492 KB Output is correct
13 Correct 7 ms 344 KB Output is correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 8 ms 344 KB Output is correct
16 Correct 11 ms 344 KB Output is correct
17 Correct 10 ms 344 KB Output is correct
18 Correct 7 ms 344 KB Output is correct
19 Correct 7 ms 344 KB Output is correct
20 Correct 7 ms 344 KB Output is correct
21 Correct 8 ms 712 KB Output is correct
22 Correct 8 ms 344 KB Output is correct
23 Correct 8 ms 344 KB Output is correct
24 Correct 8 ms 344 KB Output is correct
25 Correct 6 ms 344 KB Output is correct
26 Correct 6 ms 344 KB Output is correct
27 Correct 7 ms 344 KB Output is correct
28 Correct 7 ms 344 KB Output is correct
29 Correct 7 ms 344 KB Output is correct
30 Correct 6 ms 448 KB Output is correct
31 Correct 8 ms 344 KB Output is correct
32 Correct 9 ms 344 KB Output is correct
33 Correct 9 ms 344 KB Output is correct
34 Correct 7 ms 344 KB Output is correct
35 Correct 7 ms 344 KB Output is correct
36 Correct 7 ms 344 KB Output is correct
37 Correct 8 ms 344 KB Output is correct
38 Correct 12 ms 600 KB Output is correct
39 Correct 11 ms 344 KB Output is correct
40 Correct 12 ms 856 KB Output is correct
41 Correct 10 ms 344 KB Output is correct
42 Correct 10 ms 344 KB Output is correct
43 Correct 10 ms 344 KB Output is correct
44 Correct 15 ms 612 KB Output is correct
45 Correct 6 ms 344 KB Output is correct
46 Correct 9 ms 344 KB Output is correct
47 Correct 8 ms 344 KB Output is correct
48 Correct 8 ms 344 KB Output is correct
49 Correct 10 ms 344 KB Output is correct
50 Correct 7 ms 344 KB Output is correct
51 Correct 9 ms 344 KB Output is correct
52 Correct 15 ms 600 KB Output is correct
53 Correct 8 ms 344 KB Output is correct
54 Correct 9 ms 600 KB Output is correct
55 Correct 8 ms 344 KB Output is correct
56 Correct 8 ms 344 KB Output is correct
57 Correct 12 ms 344 KB Output is correct
58 Correct 10 ms 508 KB Output is correct
59 Correct 11 ms 344 KB Output is correct
60 Correct 11 ms 344 KB Output is correct
61 Correct 15 ms 504 KB Output is correct
62 Correct 11 ms 340 KB Output is correct
63 Correct 12 ms 344 KB Output is correct
64 Correct 11 ms 600 KB Output is correct

Subtask #4
45.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 6 ms 344 KB Output is correct
3 Correct 6 ms 344 KB Output is correct
4 Correct 6 ms 344 KB Output is correct
5 Correct 8 ms 600 KB Output is correct
6 Correct 10 ms 344 KB Output is correct
7 Correct 7 ms 344 KB Output is correct
8 Correct 8 ms 344 KB Output is correct
9 Correct 6 ms 344 KB Output is correct
10 Correct 10 ms 344 KB Output is correct
11 Correct 7 ms 344 KB Output is correct
12 Correct 7 ms 344 KB Output is correct
13 Correct 7 ms 484 KB Output is correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 7 ms 344 KB Output is correct
16 Correct 11 ms 344 KB Output is correct
17 Correct 8 ms 344 KB Output is correct
18 Correct 7 ms 344 KB Output is correct
19 Correct 7 ms 344 KB Output is correct
20 Correct 9 ms 600 KB Output is correct
21 Correct 9 ms 344 KB Output is correct
22 Correct 7 ms 344 KB Output is correct
23 Correct 7 ms 344 KB Output is correct
24 Correct 7 ms 344 KB Output is correct
25 Correct 7 ms 344 KB Output is correct
26 Correct 7 ms 344 KB Output is correct
27 Correct 12 ms 344 KB Output is correct
28 Correct 11 ms 344 KB Output is correct
29 Correct 7 ms 464 KB Output is correct
30 Correct 8 ms 344 KB Output is correct
31 Correct 7 ms 344 KB Output is correct
32 Correct 8 ms 344 KB Output is correct
33 Correct 12 ms 344 KB Output is correct
34 Correct 9 ms 344 KB Output is correct
35 Correct 8 ms 344 KB Output is correct
36 Correct 8 ms 344 KB Output is correct
37 Correct 9 ms 344 KB Output is correct
38 Correct 9 ms 344 KB Output is correct
39 Correct 10 ms 360 KB Output is correct
40 Correct 7 ms 344 KB Output is correct
41 Correct 8 ms 344 KB Output is correct
42 Correct 9 ms 344 KB Output is correct
43 Correct 10 ms 600 KB Output is correct
44 Correct 8 ms 344 KB Output is correct
45 Correct 8 ms 492 KB Output is correct
46 Correct 11 ms 492 KB Output is correct
47 Correct 8 ms 344 KB Output is correct
48 Correct 8 ms 496 KB Output is correct
49 Correct 13 ms 728 KB Output is correct
50 Correct 10 ms 344 KB Output is correct
51 Correct 10 ms 340 KB Output is correct
52 Correct 10 ms 344 KB Output is correct
53 Correct 10 ms 500 KB Output is correct
54 Correct 10 ms 344 KB Output is correct
55 Correct 11 ms 600 KB Output is correct
56 Correct 8 ms 344 KB Output is correct
57 Correct 11 ms 476 KB Output is correct
58 Correct 12 ms 592 KB Output is correct
59 Correct 12 ms 600 KB Output is correct
60 Correct 10 ms 344 KB Output is correct
61 Correct 10 ms 504 KB Output is correct
62 Correct 8 ms 344 KB Output is correct
63 Correct 9 ms 492 KB Output is correct
64 Correct 10 ms 600 KB Output is correct
65 Partially correct 11 ms 500 KB Output is partially correct
66 Partially correct 11 ms 600 KB Output is partially correct
67 Partially correct 13 ms 600 KB Output is partially correct
68 Partially correct 11 ms 496 KB Output is partially correct
69 Partially correct 13 ms 500 KB Output is partially correct
70 Partially correct 11 ms 344 KB Output is partially correct
71 Correct 10 ms 604 KB Output is correct
72 Correct 9 ms 508 KB Output is correct
73 Partially correct 10 ms 596 KB Output is partially correct
74 Partially correct 13 ms 344 KB Output is partially correct
75 Partially correct 10 ms 504 KB Output is partially correct
76 Partially correct 10 ms 344 KB Output is partially correct
77 Correct 8 ms 344 KB Output is correct
78 Correct 11 ms 856 KB Output is correct
79 Correct 15 ms 508 KB Output is correct
80 Partially correct 10 ms 344 KB Output is partially correct
81 Partially correct 11 ms 344 KB Output is partially correct
82 Partially correct 15 ms 344 KB Output is partially correct