Submission #1294660

#TimeUsernameProblemLanguageResultExecution timeMemory
1294660theiuliusWorld Map (IOI25_worldmap)C++17
0 / 100
3 ms3644 KiB
#include "worldmap.h"
#include <bits/stdc++.h>
#define pb push_back
using namespace std;
vector<int> v[50];
int j = 0, b = 1;
vector<std::vector<int>> ans(100, vector<int> (100, 1));

void dfs(int x, int last){
  ans[0][j] = x;

  for (auto h : v[x]){
    if (last != h){
      j++;
      dfs(h, x);
    }
  }

  ans[0][j] = x;
  j++;
}

std::vector<std::vector<int>> create_map(int N, int M, std::vector<int> a, std::vector<int> b) {
  for (int k = 0; k < M; k++){
    v[a[k]].pb(b[k]);
    v[b[k]].pb(a[k]);
  }

  dfs(1, 0);

  for (int k = 1; k < 100; k++){
    for (int j = 0; j < 100; j++){
      ans[k][j] = ans[0][j];
    }
  }

  return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...