Submission #1250537

#TimeUsernameProblemLanguageResultExecution timeMemory
1250537fadyscubeWorld Map (IOI25_worldmap)C++20
7 / 100
8 ms1348 KiB
#include "worldmap.h"

using namespace std;

void dfs (int u, vector<vector<int>> &adj, vector<bool> &visited, vector<int> &ans) {
  visited[u] = true;
  ans.push_back(u+1);
  for (int i = 0; i < adj[u].size(); i++) {
    if (!visited[adj[u][i]]) {
      dfs(adj[u][i], adj, visited, ans);
      ans.push_back(u+1);
    }
  }
}

std::vector<std::vector<int>> create_map(int N, int M, std::vector<int> A, std::vector<int> B) {
  vector<vector<int>> ans;
  vector<int> v(2*N, 1);
  for (int i = 0; i < N; i++)
    v[i] = i+1;
  for (int i = 1; i <= N; i++) {
    ans.push_back(v);
    vector<int> l(2*N, i);
    ans.push_back(l);
  }

  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...