Submission #1318572

#	Time	Username	Problem	Language	Result	Execution time	Memory
1318572		uranhishig	World Map (IOI25_worldmap)	C++20	7 / 100	1191 ms	2162688 KiB

worldmap

#include <bits/stdc++.h>
#include "worldmap.h"
using namespace std;

vector<int> adj[101];
vector<int> vect;

void dfs(int x, int pre) {
  vect.push_back(x);
  for (int X: adj[x]) {
      if(x == pre) {
        continue;
      }
      dfs(X, x);
      vect.push_back(X);
   }
}

std::vector<std::vector<int>> create_map(int N, int M, std::vector<int> A, std::vector<int> B) {
    std::vector<std::vector<int>> ans(N, std::vector<int>(N, 1));
    if(M + M == N * (N - 1)) {
      int h=240;
      vector< vector< int> > v(h, vector<int> (h));
      srand(time(0));
      for(int i=0;i<h;i++){
          for(int j=0;j<h;j++){
              v[i][j]= rand()%N+1;
          }
      }
      return v;
  }

    for (int i = 0; i < M; i++) {
      adj[A[i]].push_back(B[i]);
      adj[B[i]].push_back(A[i]);
    }
    dfs(1, 0);
    for (int i = 0; i < N; i++) {
      for (int j = 0; j < N; j++) {
        ans[i][j] = vect[i];
      }
    }
  return ans;
}

• 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