oj.uz

Submission #1081293

# Submission time Handle Problem Language Result Execution time Memory
1081293 2024-08-29T21:12:05 Z ArthuroWich Longest Trip (IOI23_longesttrip) C++17
0 / 100
 1000 ms 5712 KB 
#include "longesttrip.h"
#include<bits/stdc++.h>
using namespace std;
int ans = 0;
vector<int> ord;
int vis[200005];
vector<int> adj[200005];
void dfs(int i, int d, vector<int> proc) {
    if (vis[i]) {
        return;
    }
    vis[i] = 1;
    proc.push_back(i);
    if (d > ans) {
        d = ans;
        ord = proc;
    }
    for (int j : adj[i]) {
        dfs(j, d+1, proc);
    }
    proc.pop_back();
    vis[i] = 0;
}
vector<int> longest_trip(int n, int d) {
    for (int i = 0; i < n; i++) {
        adj[i].clear();
    }
    for (int i = 0; i < n; i++) {
        for (int j = i+1; j < n; j++) {
            if (are_connected({i}, {j})) {
                adj[i].push_back(j);
                adj[j].push_back(i);
            }
        }
    }
    ans = 0;
    ord.clear();
    for (int i = 0; i < n; i++) {
        dfs(i, 0, {});
    }
    return ord;
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4952 KB Output is correct
2 Execution timed out 3023 ms 5712 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 4952 KB Output is correct
2 Execution timed out 3085 ms 4952 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #2
0.0 / 10.0

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

Subtask #3
0.0 / 25.0

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

Subtask #4
0.0 / 60.0

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