제출 #1253011

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1253011		madamadam3	세계 지도 (IOI25_worldmap)	C++20	15 / 100	189 ms	12448 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);
  
  // sort(adj[u].begin(), adj[u].end(), [&](int a, int b) {return adj[a].size() < adj[b].size();});
  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]);
  int K = 5 * n;
  vector<set<pair<int, int>>> diags(2*K-1);
  for (int i = 0; i < K; i++) {
    for (int j = 0; j < K; j++) {
      int md = i + j;
      diags[md].insert({i, j});
    }
  }

  vector<bool> vis(n+1, false); vi tour; set<int> seen;
  dfs(1, vis, adj,tour);

  set<pair<int, int>> used;

  vvi ans(K, vi(K, 1)), dgs(n+1);
  int cidx = 0;
  vi ccdx(n+1, 0);

  int crow = 0;
  for (int i = 0; i < tour.size(); i++) {
    for (auto &el : diags[crow]) {
      ans[el.first][el.second] = tour[i];
    }
    crow++;
    
    while (ccdx[tour[i]] < adj[tour[i]].size()) {
      for (auto &el : diags[crow]) {
        if (ccdx[tour[i]] >= adj[tour[i]].size()) break;
        ans[el.first][el.second] = adj[tour[i]][ccdx[tour[i]]++];
      }
      crow++;
      for (auto &el : diags[crow]) {
        ans[el.first][el.second] = tour[i];
      }
      crow++;
    }
  }

  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;
        ans[el.first][el.second] = adj[i][aidx++];
      }
    }
  }

  return ans;
}

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