oj.uz

Submission #957450

# Submission time Handle Problem Language Result Execution time Memory
957450 2024-04-03T17:55:00 Z Turkhuu Longest Trip (IOI23_longesttrip) C++17
15 / 100
 9 ms 696 KB 
#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> longest_trip(int N, int D) {
    if (D > 1) {
        deque<int> a;
        if (are_connected({0}, {1})) {
            a = {0, 1};
            if (are_connected({0}, {2})) {
                a.push_front(2);
            } else {
                a.push_back(2);
            }
        } else {
            a = {0, 2, 1};
        }
        for (int i = 3; i < N; i++) {
            if (are_connected({a.front()}, {i})) {
                a.push_front(i);
            } else {
                a.push_back(i);
            }
        }
        return vector(a.begin(), a.end());
    }
    vector<int> a{0}, b{1};
    for (int i = 2; i < N; i++) {
        if (are_connected({i}, {a.back()})) {
            a.push_back(i);
        } else if (are_connected({i}, {b.back()})) {
            b.push_back(i);
        } else {
            a.insert(a.end(), b.rbegin(), b.rend());
            b = {i};
        }
    }
    if (!are_connected(a, b)) {
        return a.size() > b.size() ? a : b;
    }
    int i, lo, hi;
    lo = 0, hi = a.size() - 1;
    while (lo < hi) {
        int mi = (lo + hi) / 2;
        are_connected(vector(a.begin(), a.begin() + mi + 1), b) ? hi = mi : lo = mi + 1;
    }
    i = lo, lo = 0, hi = b.size() - 1;
    while (lo < hi) {
        int mi = (lo + hi) / 2;
        are_connected(vector(b.begin(), b.begin() + mi + 1), {a[i]}) ? hi = mi : lo = mi + 1;
    }
    vector<int> ans;
    ans.insert(ans.end(), a.begin() + i + 1, a.end());
    ans.insert(ans.end(), a.begin(), a.begin() + i + 1);
    ans.insert(ans.end(), b.begin() + lo, b.end());
    ans.insert(ans.end(), b.begin(), b.begin() + lo);
    return ans;
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #1
5.0 / 5.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 4 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 7 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 4 ms 344 KB Output is correct
5 Correct 5 ms 600 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 5 ms 344 KB Output is correct
10 Correct 5 ms 344 KB Output is correct
11 Correct 5 ms 600 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

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

Subtask #4
0.0 / 60.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 5 ms 344 KB Output is correct
4 Correct 5 ms 344 KB Output is correct
5 Correct 4 ms 696 KB Output is correct
6 Correct 9 ms 500 KB Output is correct
7 Incorrect 0 ms 344 KB Incorrect
8 Halted 0 ms 0 KB -