Submission #1302469

#	Time	Username	Problem	Language	Result	Execution time	Memory
1302469		aaaaaaaa	World Map (IOI25_worldmap)	C++20	15 / 100	13 ms	3248 KiB

worldmap

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

const int mxN = 42;

vector<pair<int, int>> ord;
vector<int> adj[mxN];
bool vis[mxN];

void dfs(int u, int par){
    if(par > 0) ord.push_back({u, par});
    if(vis[u]) {
        if(par > 0) ord.push_back({par, u});
        return;
    }
    vis[u] = 1;
    for(auto it : adj[u]){
        if(it ^ par) dfs(it, u);
    }
    if(par > 0) ord.push_back({par, u});
}

vector<vector<int>> create_map(int N, int M, vector<int> A, vector<int> B) {

  for(int i = 0; i < M; ++i){
    adj[A[i]].push_back(B[i]);
    adj[B[i]].push_back(A[i]);
  }

  dfs(1, 0);


  vector<vector<int>> ans(max(1, (int) ord.size()), vector<int>(max(1, (int) ord.size()), 1));

  //cout << ord.size() << "\n";

  for(int i = 0; i < ord.size(); ++i){
    ans[i][0] = ord[i].first;
    ans[i][1] = ord[i].second;
    for(int j = 2; j < ord.size(); ++j) ans[i][j] = ans[i][j - 1];
  }

  for(int i = 1; i <= N; ++i) adj[i].clear(), vis[i] = 0;
  ord.clear();

  return ans;
}

• 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