Submission #1249593

#	Time	Username	Problem	Language	Result	Execution time	Memory
1249593		FernandoJC07	World Map (IOI25_worldmap)	C++20	12 / 100	20 ms	2628 KiB

worldmap

//#include "worldmap"
#include <vector>
#include <queue>
#include <functional>
using namespace std;
#define vi vector<int>
#define vii vector<vector<int>>
#define For(i, a, n) for(int i = a; i<n; ++i)
#define pb push_back

vii create_map(int N, int M, vi A, vi B){
    if(N==1) return {{1}};
    vii adj, mapa;
    vi vst;
    adj.resize(N+1);
    vst.resize(N+1, 0);

    For(i, 0, M) {adj[A[i]].pb(B[i]); adj[B[i]].pb(A[i]);}
        
    function<void(int)> dfs = [&](int a){
        mapa.pb({a});
        vi res;
        vst[a] = 1;
        for(int x: adj[a]){
            res.pb(a); res.pb(x);
        }
        mapa.pb(res);
        mapa.pb({a});
        for(int x: adj[a]){
            if(vst[x]) continue;
            dfs(x);
        }
    };
    For(i, 1, N+1) {
        if(!vst[i] && adj[i].size()) dfs(i);
        break;
    }
    int k = mapa.size();
    For(i, 0, k){
        int m = k-mapa[i].size();
        while(m--){mapa[i].pb(mapa[i][0]);}
    }
    return mapa;    
}

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