제출 #1252975

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

worldmap

#include "worldmap.h"
#include <bits/stdc++.h>

using namespace std;

// #define int long long int
using vi = vector<int>;
using vvi = vector<vi>;

void dfs(int u, vector<bool> &vis, vvi &adj, vi &tour) {
  vis[u] = true;
  tour.push_back(u);
  
  for (int v : adj[u]) {
    if (vis[v]) continue;
    dfs(v, vis, adj, tour);
    tour.push_back(u);
  }
}

vvi create_map(int n, int m, vi a, vi b) {
  vvi adj(n+1, vi()); for (int i = 0; i < m; i++) adj[a[i]].push_back(b[i]), adj[b[i]].push_back(a[i]);
  
  vector<bool> vis(n+1, false); vi tour; set<int> seen;
  dfs(1, vis, adj,tour);

  int K = 3 * n - 1;
  vector<set<pair<int, int>>> diags(2*K-1);
  set<pair<int, int>> used;
  for (int i = 0; i < K; i++) {
    for (int j = 0; j < K; j++) {
      int md = i + j;
      diags[md].insert({i, j});
    }
  }

  vvi ans(K, vi(K)), dgs(n+1);
  int cidx = 0;
  for (int i = 0; i < tour.size(); i++) {
    dgs[tour[i]].push_back(cidx+1);
    for (; cidx < 3 * i + 3; cidx++) {
      for (auto &el : diags[cidx]) {
        ans[el.first][el.second] = tour[i];
      }
    }
  }

  for (int i = 1; i <= n; i++) {
    int aidx = 0;
    for (auto &gd : dgs[i]) {
      for (auto &el : diags[gd]) {
        if (aidx >= adj[i].size()) break;
        if (used.count({min(i, adj[i][aidx]), max(i, adj[i][aidx])})) continue; 
        used.insert({min(i, adj[i][aidx]), max(i, adj[i][aidx])});
        ans[el.first][el.second] = adj[i][aidx++];
      }
    }
  }

  // for (int i = 0; i < 2*K-1; i++) {
  //   for (auto &el : diags[i]) {
  //     ans[el.first][el.second] = i;
  //   }
  // }
  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