Submission #1254202

#	Time	Username	Problem	Language	Result	Execution time	Memory
1254202		nickolasarapidis	World Map (IOI25_worldmap)	C++20	30 / 100	16 ms	2120 KiB

worldmap

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

vector<int> adj[45];

vector<int> et;
vector<bool> visited(45);

void dfs(int s, int e){
    et.push_back(s);
    if(visited[s]) return;
    visited[s] = true;
    for(auto u : adj[s]){
        if(u == e) continue;
        dfs(u, s);
        et.push_back(s);
    }
}

vector<vector<int>> create_map(int N, int M, vector<int> A, vector<int> B){
    for(int i = 0; i < 45; i++){
        adj[i].clear();
    }
    et.clear();
    for(int i = 0; i < 45; i++){
        visited[i] = false;
    }
    for(int i = 0; i < M; i++){
        adj[A[i]].push_back(B[i]);
        adj[B[i]].push_back(A[i]);
    }
    if(M == N - 1){
        dfs(1, -1);
        vector<vector<int>> ans(et.size(), vector<int>(et.size()));
        for(int i = 0; i < et.size(); i++){
            for(int j = 0; j < et.size(); j++){
                ans[i][j] = et[i];
            }
        }
        return ans;
    }
    else{
        vector<vector<int>> ans(2*N, vector<int>(2*N, 1));
        for(int i = 0; i < 2*N; i += 2){
            for(int j = 0; j < 2*adj[(i/2) + 1].size(); j += 2){
                ans[i][j] = adj[(i/2) + 1][j/2];
            }
            for(int j = 0; j < 2*adj[(i/2) + 1].size(); j += 2){
                ans[i][j + 1] = (i/2) + 1; 
            }
        }
        return ans;
    }
}

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