Submission #1249605

#	Time	Username	Problem	Language	Result	Execution time	Memory
1249605		Ghulam_Junaid	World Map (IOI25_worldmap)	C++20	0 / 100	57 ms	7352 KiB

worldmap

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

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

vector<vector<int>> ans;
void dfs(int v){
    vis[v] = 1;
    vec.clear();
    for (int u : g[v]){
        vec.push_back(v);
        vec.push_back(u);
    }
    ans.push_back(vec);
    ans.push_back({v});

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

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 mx = ans.size();
    for (int i = 0; i < ans.size(); i ++)
        mx = max(mx, (int)ans[i].size());
    while (ans.size() <= mx)
        ans.push_back({1});
    for (int i = 0; i < ans.size(); i ++)
        while (ans[i].size() <= mx)
            ans[i].push_back(ans[i][0]);

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

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