Submission #1253176

#	Time	Username	Problem	Language	Result	Execution time	Memory
1253176		dreamnguyen	세계 지도 (IOI25_worldmap)	C++20	0 / 100	0 ms	328 KiB

worldmap

#include <bits/stdc++.h>
#include "worldmap.h"
#define FOR(i,a,b) for(int i = a; i<b; i++)
using ll = long long;
using namespace std;
void giai(int u, vector<int> &used, vector<vector<int>> &a, vector<int> &o) {
    o.push_back(u);
    used[u] = 1;
    for (auto v : a[u]) {
        if (used[v] == 0) {
            giai(v, used, a, o);
            o.push_back(u);
        }
    }
}
std::vector<std::vector<int>> create_map(int N, int M, std::vector<int> A, std::vector<int> B) {
    if(M=N*(N-1)/2){
      int K = 2 * N;
      std::vector<std::vector<int>> grid(K, std::vector<int>(K, 0));
      int color = 1;
  
      for (int i = 0; i < N; ++i) {
          grid[i][i] = i + 1;
      }
  
      int x = 0, y = N;
      for (int i = 0; i < M; ++i) {
          if (x + 1 >= K) {
              x = 0;
              ++y;
              if (y + 1 >= K) break;
          }
          grid[x][y] = A[i];
          grid[x + 1][y] = B[i];
          x += 2;
      }
  
      return grid;
    }
    if(M=N-1){
        int maxx = 41;
        vector<int> used(maxx, 0);
        vector<vector<int>> a(maxx);
        for (int i = 0; i < M; i++) {
            a[A[i]].push_back(B[i]);
            a[B[i]].push_back(A[i]);
        }
        vector<int> o;
        giai(1, used, a, o);
        int n = (int)o.size();
        vector<vector<int>> ans(n, vector<int> (n, 0));
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                ans[i][j] = o[i];
            }
        }
        return ans;
    }
}

Compilation message (stderr)

worldmap.cpp: In function 'std::vector<std::vector<int> > create_map(int, int, std::vector<int>, std::vector<int>)':
worldmap.cpp:59:1: warning: control reaches end of non-void function [-Wreturn-type]
   59 | }
      | ^

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