Submission #1285947

#TimeUsernameProblemLanguageResultExecution timeMemory
1285947kawhietWorld Map (IOI25_worldmap)C++20
15 / 100
110 ms15036 KiB
#include <bits/stdc++.h>
#include "worldmap.h"
using namespace std;

vector<vector<int>> create_map(int n, int m, vector<int> a, vector<int> b) {
  vector<vector<int>> g(n + 1);
  for (int i = 0; i < m; i++) {
    g[a[i]].push_back(b[i]);
    g[b[i]].push_back(a[i]);
  }
  int k = 6 * n;
  vector<vector<int>> ans(k, vector<int>(k, 1));
  int x = 2;
  for (int i = 0; i < k; i += 2) {
    if (x > n) break;
    int j = 0;
    for (auto y : g[x]) {
      ans[i][j++] = y;
      ans[i][j++] = x;
    }
    for (; j < k; j++) {
      ans[i][j] = x;
    }
    x++;
  }
  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...