Submission #980144

#	Time	Username	Problem	Language	Result	Execution time	Memory
980144		vjudge1	Longest Trip (IOI23_longesttrip)	C++17	15 / 100	779 ms	656 KiB

longesttrip

#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector <ll>;
using dll = deque <ll>;
using vi = vector <int>;

const ll MAXN = 256+16;
bool mat[MAXN][MAXN];

vi longest_trip (int n, int d) {
    for (ll u = 0; u < n; u++) {
        mat[u][u] = false;
        for (ll v = u+1; v < n; v++) {
            if (are_connected(vi({ int(u) }), vi({ int(v) }))) {
                mat[u][v] = true;
                mat[v][u] = true;
            } else {
                mat[u][v] = false;
                mat[v][u] = false;
            }
        }
    }
    dll dq;
    dq.push_back(0);
    vector <char> vis(n, false);
    vis[0] = true;
    for (ll v = 0; v < n; v++) {
        if (mat[0][v]) {
            vis[v] = true;
            dq.push_back(v);
            break;
        }
    }
    for (ll u = 0; u < n; u++) {
        if (vis[u]) continue;
        vis[u] = true;
        if (mat[u][dq.front()]) {
            dq.push_front(u);
        } else {
            dq.push_back(u);
        }
    }
    vi ans(dq.begin(), dq.end());
    return ans;
}

• Subtask 0: 0 / 0
• Subtask 1: 5 / 5
• Subtask 2: 10 / 10
• Subtask 3: 0 / 25
• Subtask 4: 0 / 60