oj.uz

Submission #1006370

# Submission time Handle Problem Language Result Execution time Memory
1006370 2024-06-23T21:37:29 Z Wael Longest Trip (IOI23_longesttrip) C++17
40 / 100
 11 ms 604 KB 
#include "longesttrip.h"
//#include "grader.cpp"
#include <bits/stdc++.h>
using namespace std;
mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count());

using i64 = long long;

vector<int> longest_trip(int N, int D) {
    int n = N;
    
    auto ask = [&](int x, int y) -> bool {
        return are_connected(vector<int>{x}, vector<int>{y});
    };

    vector<int> nodes(n);
    iota(nodes.begin(), nodes.end(), 0);
    random_shuffle(nodes.begin(), nodes.end());

    bool edge = 0;
    vector<int> a{nodes[0]}, b;
    for (int z = 1; z < n; ++z) {
        int i = nodes[z];

        if (edge == 0) {
            if (ask(a.back(), i)) {
                a.push_back(i);
                edge = 1;
            } else {
                b.push_back(i);
                edge = 0;
            }
        } else {
            if (ask(a.back(), i)) {
                a.push_back(i);
            } else {
                if (b.size() == 0 || ask(b.back(), i)) {
                    b.push_back(i);
                    edge = 0;
                } else {
                    reverse(b.begin(), b.end());
                    for (auto j : b) {
                        a.push_back(j);
                    }
                    b.clear();
                }
            } 
        }
    }

    if (b.size() && are_connected(a, b)) {
        if (are_connected(vector<int>{a.back()}, vector<int>(b.begin(), b.end())) == 0) {
            int l = 1, r = b.size();
            while (l <= r) {
                int mid = (l + r) / 2;
                if (are_connected(a, vector<int>(b.begin(), b.begin() + mid))) {
                    r = mid - 1;
                } else {
                    l = mid + 1;
                }
            }
            ++r;
            swap(b[r - 1], b.back());
            swap(a, b);
        }
        if (ask(a.back(), b.back())) {
            reverse(b.begin(), b.end());
        }
        int l = 1, r = b.size();
        while (l <= r) {
            int mid = (l + r) / 2;
            if (are_connected(vector<int>{a.back()}, vector<int>(b.begin(), b.begin() + mid))) {
                r = mid - 1;
            } else {
                l = mid + 1;
            }
        }
        --l;
        while (l--) {
            b.push_back(b[0]);
            b.erase(b.begin());
        }
        for (auto j : b) {
            a.push_back(j);
        }
        b.clear();
    } else {
        if (a.size() < b.size()) {
            swap(a, b);
        }
    }

    return a;
}

Subtask #0
0.0 / 0.0

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

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 5 ms 344 KB Output is correct
3 Correct 4 ms 344 KB Output is correct
4 Correct 6 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 5 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 5 ms 344 KB Output is correct
11 Correct 4 ms 344 KB Output is correct
12 Correct 5 ms 344 KB Output is correct
13 Correct 6 ms 344 KB Output is correct

Subtask #3
25.0 / 25.0

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

Subtask #4
0.0 / 60.0

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