Submission #1251249

#	Time	Username	Problem	Language	Result	Execution time	Memory
1251249		yeyso2	World Map (IOI25_worldmap)	C++20	0 / 100	3 ms	580 KiB

worldmap

#include "worldmap.h"
#include <bits/stdc++.h>
using namespace std;
void dfs(int u, int parent, vector<vector<int>> &adj, vector<int> &path){
    path.push_back(u);
    for(int v : adj[u]){
        if(v != parent){
            dfs(v, u, adj, path);
        }
    }
}
vector<vector<int>> create_map(int N, int M, vector<int> A, vector<int> B) {

    vector<vector<int>> adj(N+1, vector<int>());
    for(int i = 0; i < M; i ++){
        adj[A[i]].push_back(B[i]);
        adj[B[i]].push_back(A[i]);
    }
    int start = 0;
    for(int i = 0; i < adj.size(); i ++){
        if(adj[i].size() == 1){
            start = i;
        }
    }
    vector<int> path;
    dfs(start, start, adj, path);
    vector<vector<int>> res(N, vector<int>(N, 0));

    for(int i = 0; i < (int)res.size(); i ++){
        for(int j = 0; j < (int)res[i].size(); j ++){
            res[i][j] = path[j];
        }
    }

    return res;
}
/*
g++ -std=gnu++20 -Wall -O2 -pipe -static -g -o main grader.cpp worldmap.cpp
1
6 5
1 5
2 3
3 4
1 6
6 4
*/

• 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