Submission #1295297

#	Time	Username	Problem	Language	Result	Execution time	Memory
1295297		123123123	World Map (IOI25_worldmap)	C++20	15 / 100	1173 ms	2162688 KiB

worldmap

#include <bits/stdc++.h>
using namespace std;
int fix[245];
vector <int> v[245], tr;
void DFS(int y, int x)
{
    int j;
    
    for(j = 0; j < v[x].size(); j++)
    {
        if(v[x][j] != y)
        {
            tr.push_back(x);
            DFS(x, v[x][j]);
        }
    }
    
    if(x != 1) tr.push_back(x);
}
vector <vector <int> > create_map(int N, int M, vector<int> A, vector<int> B)
{
    int i, j;
    
    if(M == 0) 
    {
        vector <vector<int> > mymap(1, std::vector<int>(1, 1));
  	    return mymap;
    }
    
    for(i = 1; i <= N; i++)
    {
        v[i].clear();
    }
    
    for(i = 0; i < M; i++)
    {
        v[A[i]].push_back(B[i]);
        v[B[i]].push_back(A[i]);
    }
    
    tr.clear();
    DFS(0, 1);
    
    vector <vector <int> > mymap(tr.size(), std::vector<int>(tr.size(), 1));
    
    for(i = 0; i < tr.size(); i++)
    {
        for(j = 0; j < tr.size(); j++)
        {
            mymap[i][j] = tr[j];
        }
    }

    return mymap;
}

• 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