Submission #1249537

#	Time	Username	Problem	Language	Result	Execution time	Memory
1249537		Ghulam_Junaid	World Map (IOI25_worldmap)	C++20	15 / 100	59 ms	7240 KiB

worldmap

#include <bits/stdc++.h>
#include "worldmap.h"
using namespace std;

const int N = 41, K = 240;
int n, m;
vector<int> g[N];
bool vis[N];

vector<int> path;
void dfs(int v, int p = -1){
    vis[v] = 1;

    path.push_back(v);
    for (int u : g[v]){
        if (vis[u]){
            path.push_back(u);
            path.push_back(v);
            continue;
        }
        dfs(u);
        path.push_back(v);
    }
}

vector<vector<int>> create_map(int nn, int mm, vector<int> a, vector<int> b) {
    n = nn, m = mm;
    for (int i = 0; i < m; i ++){
        g[a[i]].push_back(b[i]);
        g[b[i]].push_back(a[i]);
    }
    dfs(1);

    int sz = path.size();
    vector<vector<int>> ans(sz);
    for (int i = 0; i < sz; i ++)
        ans[i] = path;

    memset(vis, 0, sizeof vis);
    path.clear();
    for (int i = 0; i <= n; i ++)
        g[i].clear();
    return ans;
}

• Subtask 0: 0 / 0
• Subtask 1: 5 / 5
• Subtask 2: 10 / 10
• Subtask 3: 0 / 7
• Subtask 4: 0 / 8
• Subtask 5: 0 / 14
• Subtask 6: 0 / 56