oj.uz

Submission #979991

# Submission time Handle Problem Language Result Execution time Memory
979991 2024-05-11T19:01:22 Z vjudge1 Longest Trip (IOI23_longesttrip) C++17
0 / 100
 1000 ms 2416 KB 
#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector <int>;
using vll = vector <ll>;

const ll MAXN = 256;
vll adj[MAXN];
ll mat[MAXN][MAXN];

// diameter common fishel L
pair <ll, vi> bfs (ll n, ll u) {
    vector <char> vis(n, false);
    vll dis(n), from(n);
    queue <ll> q;
    vis[u] = true;
    dis[u] = 0;
    from[u] = u;
    q.push(u);
    ll far = u;
    while (q.size()) {
        ll u = q.front(); q.pop();
        for (ll v : adj[u]) {
            if (vis[v]) continue;
            vis[v] = true;
            dis[v] = dis[u]+1;
            from[v] = u;
            q.push(v);
            far = v;
        }
    }
    ll ffar = far;
    vi path;
    while (far != from[far]) {
        path.push_back(far);
        far = from[far];
    }
    path.push_back(far);
    return { ffar, path };
}

vi longest_trip (int n, int d) {
    fill(adj, adj+n, vll({}));
    for (ll u = 0; u < n; u++) {
        for (ll v = u+1; v < n; v++) {
            if (are_connected(vi({ int(u) }), vi({ int(v) }))) {
                adj[u].push_back(v);
                adj[v].push_back(u);
                mat[u][v] = true;
                mat[v][u] = true;
            } else {
                mat[u][v] = false;
                mat[v][u] = false;
            }
        }
    }
    vi ans = {};
    for (ll v = 0; v < n; v++) {
        vi pans = {};
        for (ll u = 0; u < n; u++) {
            vi path = bfs(n, bfs(n, 0).first).second;
            if (path.size() > pans.size()) pans = path;
        }
        deque <int> dq(pans.begin(), pans.end());
        ll ex1 = dq.front(), ex2 = dq.back();
        vector <char> vis(n, false);
        for (ll u : dq) vis[u] = true;
        for (ll u = 0; u < n; u++) {
            if (vis[u]) continue;
            if (mat[u][ex1]) {
                dq.push_front(u);
                ex1 = u;
            } else if (mat[u][ex2]) {
                dq.push_back(u);
                ex2 = u;
            }
        }
        pans = vi(dq.begin(), dq.end());
        if (pans.size() > ans.size()) ans = pans;
    }
    return ans;
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Execution timed out 3074 ms 2416 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 344 KB Output is correct
2 Correct 26 ms 344 KB Output is correct
3 Correct 423 ms 608 KB Output is correct
4 Execution timed out 3039 ms 1332 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #2
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 344 KB Output is correct
2 Correct 28 ms 344 KB Output is correct
3 Correct 396 ms 828 KB Output is correct
4 Execution timed out 3067 ms 1504 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #3
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 26 ms 344 KB Output is correct
3 Correct 358 ms 804 KB Output is correct
4 Execution timed out 3068 ms 1624 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 344 KB Output is correct
2 Correct 28 ms 344 KB Output is correct
3 Partially correct 350 ms 600 KB Output is partially correct
4 Execution timed out 3058 ms 980 KB Time limit exceeded
5 Halted 0 ms 0 KB -