oj.uz

Submission #850290

# Submission time Handle Problem Language Result Execution time Memory
850290 2023-09-16T09:30:47 Z nvmdava Longest Trip (IOI23_longesttrip) C++17
85 / 100
 13 ms 1192 KB 
#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;


mt19937_64 rnggen(chrono::steady_clock::now().time_since_epoch().count());

vector<int> rng(vector<int>& a, int l, int r) {
    vector<int> res;
    for(int i = l; i <= r; ++i) res.push_back(a[i]);
    return res;
}

map<pair<int, int>, int> chk;

int get(int a, int b) {
    if(chk[{a, b}] != 0) return max(chk[{a, b}], 0);
    int w = are_connected({a}, {b});
    if(w == 0) w = -1;
    chk[{a, b}] = w;
    chk[{b, a}] = w;
    return max(w, 0);
}

std::vector<int> longest_trip(int N, int D)
{
    if(D == 3) {
        vector<int> res(N);
        for(int i = 0; i < N; ++i)
            res[i] = i;
        return res;
    }
    if(D == 2) {
        vector<int> res = {0};
        for(int i = 1; i < N; ++i) {
            if(are_connected({res.back()}, {i})) {
                res.push_back(i);
                continue;
            }
            if(i == 1) {
                res.push_back(i + 1);
                res.push_back(i);
                i++;
                continue;
            }
            res.insert(res.begin(), i);
        }
        return res;
    }
    chk.clear();
    vector<vector<int> > all;
    for(int i = 0; i < N; ++i) {
        all.push_back({i});
    }
    // shuffle(all.begin(), all.end(), rnggen);
    bool la = 0;
    while(all.size() >= 3) {
        int sz = all.size();
        if(la == 0) {
            if(get(all[sz - 1].back(), all[sz - 2].back())) {
                reverse(all[sz - 2].begin(), all[sz - 2].end());
                for(auto x : all[sz - 2]) all[sz - 1].push_back(x);
                swap(all[sz - 1], all[sz - 2]);
                all.pop_back();
                la = 0;
                continue;
            }
            la = 1;
        }
        if(get(all[sz - 1].back(), all[sz - 3].back())) {
            reverse(all[sz - 3].begin(), all[sz - 3].end());
            for(auto x : all[sz - 3]) all[sz - 1].push_back(x);
            swap(all[sz - 3], all[sz - 2]);
            swap(all[sz - 2], all[sz - 1]);
            all.pop_back();
            la = 0;
            continue;
        }
        reverse(all[sz - 3].begin(), all[sz - 3].end());
        for(auto x : all[sz - 3]) all[sz - 2].push_back(x);
        swap(all[sz - 3], all[sz - 2]);
        swap(all[sz - 2], all[sz - 1]);
        all.pop_back();
        la = 0;
    }


    if(get(all[0].back(), all[1].back())) {
        reverse(all[1].begin(), all[1].end());
        for(auto x : all[1]) all[0].push_back(x);
        return all[0];
    }

    if(get(all[0].back(), all[1][0])) {
        for(auto x : all[1]) all[0].push_back(x);
        return all[0];
    }

    if(get(all[0][0], all[1][0])) {
        reverse(all[0].begin(), all[0].end());
        for(auto x : all[1]) all[0].push_back(x);
        return all[0];
    }

    if(get(all[0][0], all[1].back())) {
        reverse(all[0].begin(), all[0].end());
        reverse(all[1].begin(), all[1].end());
        for(auto x : all[1]) all[0].push_back(x);
        return all[0];
    }


    int l0 = 0, r0 = (int)all[0].size() - 1;
    int l1 = 0, r1 = (int)all[1].size() - 1;

    // for(auto& x : all[0]) cout<<x<<' ';
    // cout<<'\n';
    // for(auto& x : all[1]) cout<<x<<' ';
    // cout<<'\n';

    if(are_connected(rng(all[0], l0, r0), rng(all[1], l1, r1)) == 0) {
        if(all[0].size() > all[1].size()) return all[0];
        return all[1];
    }

    while(l0 != r0 || l1 != r1) {
        if(l0 != r0) {
            int m = (l0 + r0) >> 1;
            if(are_connected(rng(all[0], l0, m), rng(all[1], l1, r1))) {
                r0 = m;
            } else {
                l0 = m + 1;
            }
            continue;
        }
        int m = (l1 + r1) >> 1;
        if(are_connected(rng(all[0], l0, r0), rng(all[1], l1, m))) {
            r1 = m;
        } else {
            l1 = m + 1;
        }
    }

    vector<int> res;
    for(int i = 1; i <= all[1].size(); ++i) {
        res.push_back(all[1][(i + l1) % all[1].size()]);
    }
    for(int i = 0; i < all[0].size(); ++i) {
        res.push_back(all[0][(i + l0) % all[0].size()]);
    }
    return res;
}

Compilation message

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

Subtask #0
0.0 / 0.0

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

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 5 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 6 ms 600 KB Output is correct
6 Correct 7 ms 344 KB Output is correct
7 Correct 6 ms 344 KB Output is correct
8 Correct 6 ms 344 KB Output is correct
9 Correct 5 ms 344 KB Output is correct
10 Correct 6 ms 864 KB Output is correct
11 Correct 6 ms 628 KB Output is correct
12 Correct 6 ms 616 KB Output is correct
13 Correct 6 ms 604 KB Output is correct
14 Correct 10 ms 344 KB Output is correct
15 Correct 8 ms 344 KB Output is correct
16 Correct 8 ms 344 KB Output is correct
17 Correct 6 ms 344 KB Output is correct
18 Correct 7 ms 344 KB Output is correct
19 Correct 7 ms 600 KB Output is correct
20 Correct 6 ms 504 KB Output is correct
21 Correct 6 ms 600 KB Output is correct
22 Correct 6 ms 344 KB Output is correct
23 Correct 7 ms 600 KB Output is correct
24 Correct 6 ms 800 KB Output is correct
25 Correct 8 ms 344 KB Output is correct
26 Correct 8 ms 344 KB Output is correct
27 Correct 9 ms 344 KB Output is correct
28 Correct 9 ms 344 KB Output is correct
29 Correct 9 ms 344 KB Output is correct
30 Correct 7 ms 952 KB Output is correct
31 Correct 10 ms 440 KB Output is correct
32 Correct 8 ms 452 KB Output is correct
33 Correct 7 ms 600 KB Output is correct
34 Correct 9 ms 600 KB Output is correct
35 Correct 8 ms 344 KB Output is correct
36 Correct 7 ms 484 KB Output is correct
37 Correct 10 ms 668 KB Output is correct
38 Correct 11 ms 1140 KB Output is correct
39 Correct 7 ms 496 KB Output is correct
40 Correct 8 ms 1120 KB Output is correct
41 Correct 9 ms 972 KB Output is correct
42 Correct 9 ms 1004 KB Output is correct
43 Correct 8 ms 1000 KB Output is correct
44 Correct 8 ms 864 KB Output is correct
45 Correct 7 ms 344 KB Output is correct
46 Correct 7 ms 344 KB Output is correct
47 Correct 7 ms 344 KB Output is correct
48 Correct 7 ms 344 KB Output is correct
49 Correct 9 ms 344 KB Output is correct
50 Correct 7 ms 444 KB Output is correct
51 Correct 9 ms 444 KB Output is correct
52 Correct 8 ms 444 KB Output is correct
53 Correct 6 ms 600 KB Output is correct
54 Correct 8 ms 600 KB Output is correct
55 Correct 9 ms 600 KB Output is correct
56 Correct 7 ms 600 KB Output is correct
57 Correct 8 ms 624 KB Output is correct
58 Correct 13 ms 856 KB Output is correct
59 Correct 9 ms 860 KB Output is correct
60 Correct 9 ms 612 KB Output is correct
61 Correct 8 ms 616 KB Output is correct
62 Correct 9 ms 760 KB Output is correct
63 Correct 8 ms 608 KB Output is correct
64 Correct 9 ms 648 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 5 ms 344 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 6 ms 600 KB Output is correct
5 Correct 5 ms 628 KB Output is correct
6 Correct 6 ms 344 KB Output is correct
7 Correct 5 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 484 KB Output is correct
11 Correct 6 ms 872 KB Output is correct
12 Correct 5 ms 488 KB Output is correct
13 Correct 6 ms 484 KB Output is correct
14 Correct 11 ms 344 KB Output is correct
15 Correct 11 ms 344 KB Output is correct
16 Correct 7 ms 344 KB Output is correct
17 Correct 9 ms 344 KB Output is correct
18 Correct 6 ms 344 KB Output is correct
19 Correct 7 ms 344 KB Output is correct
20 Correct 6 ms 344 KB Output is correct
21 Correct 8 ms 344 KB Output is correct
22 Correct 8 ms 344 KB Output is correct
23 Correct 7 ms 344 KB Output is correct
24 Correct 8 ms 344 KB Output is correct
25 Correct 7 ms 344 KB Output is correct
26 Correct 9 ms 696 KB Output is correct
27 Correct 11 ms 440 KB Output is correct
28 Correct 8 ms 696 KB Output is correct
29 Correct 6 ms 600 KB Output is correct
30 Correct 9 ms 856 KB Output is correct
31 Correct 8 ms 344 KB Output is correct
32 Correct 8 ms 344 KB Output is correct
33 Correct 10 ms 340 KB Output is correct
34 Correct 10 ms 344 KB Output is correct
35 Correct 8 ms 344 KB Output is correct
36 Correct 7 ms 344 KB Output is correct
37 Correct 7 ms 700 KB Output is correct
38 Correct 9 ms 440 KB Output is correct
39 Correct 8 ms 448 KB Output is correct
40 Correct 7 ms 344 KB Output is correct
41 Correct 9 ms 344 KB Output is correct
42 Correct 9 ms 600 KB Output is correct
43 Correct 6 ms 344 KB Output is correct
44 Correct 5 ms 600 KB Output is correct
45 Correct 5 ms 344 KB Output is correct
46 Correct 8 ms 600 KB Output is correct
47 Partially correct 9 ms 1116 KB Output is partially correct
48 Partially correct 9 ms 516 KB Output is partially correct
49 Partially correct 11 ms 624 KB Output is partially correct
50 Partially correct 7 ms 344 KB Output is partially correct
51 Partially correct 7 ms 1008 KB Output is partially correct
52 Correct 9 ms 876 KB Output is correct
53 Correct 7 ms 608 KB Output is correct
54 Correct 8 ms 756 KB Output is correct
55 Correct 7 ms 608 KB Output is correct
56 Partially correct 11 ms 1012 KB Output is partially correct
57 Partially correct 12 ms 884 KB Output is partially correct
58 Partially correct 7 ms 608 KB Output is partially correct
59 Partially correct 7 ms 988 KB Output is partially correct
60 Correct 8 ms 856 KB Output is correct
61 Correct 8 ms 504 KB Output is correct
62 Partially correct 7 ms 1008 KB Output is partially correct
63 Partially correct 10 ms 1112 KB Output is partially correct
64 Partially correct 12 ms 740 KB Output is partially correct
65 Partially correct 9 ms 1192 KB Output is partially correct
66 Partially correct 8 ms 612 KB Output is partially correct
67 Correct 8 ms 860 KB Output is correct
68 Correct 9 ms 732 KB Output is correct
69 Partially correct 8 ms 608 KB Output is partially correct
70 Partially correct 8 ms 1112 KB Output is partially correct
71 Partially correct 9 ms 600 KB Output is partially correct
72 Partially correct 12 ms 1128 KB Output is partially correct
73 Partially correct 8 ms 604 KB Output is partially correct
74 Partially correct 9 ms 856 KB Output is partially correct
75 Correct 9 ms 608 KB Output is correct
76 Correct 8 ms 608 KB Output is correct
77 Partially correct 11 ms 624 KB Output is partially correct
78 Partially correct 9 ms 600 KB Output is partially correct
79 Partially correct 9 ms 752 KB Output is partially correct
80 Partially correct 9 ms 500 KB Output is partially correct
81 Correct 8 ms 788 KB Output is correct
82 Correct 8 ms 616 KB Output is correct