제출 #1250561

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1250561		fadyscube	World Map (IOI25_worldmap)	C++20	7 / 100	39 ms	4932 KiB

worldmap

#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<int> ans;
  for (int i = 0; i < M; i++) {
    ans.push_back(A[i]);
    ans.push_back(B[i]);
    ans.push_back(1);
  }
  int X = 120;
  vector<vector<int>> v(X, vector<int>());
  int k = 0;
  for (int i = 0; i < ans.size(); i++) {
    v[k].push_back(ans[i]);
    if ((i+1) % (X/2) == 0) {
      for (int j = 0; j < X/2; j++)
        v[k].push_back(1);
      k++;
    }
  }
  int cnst = X-v[k].size();
  for (int i = 0; i < cnst; i++)
    v[k].push_back(1);

  vector<int> l(X, 1);
  for (int i = k+1; i < X; i++) {
    v[i] = l;
  }

  return v;
}

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