제출 #1252617

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1252617		bzzzzzzzzzz	세계 지도 (IOI25_worldmap)	C++20	29 / 100	22 ms	3144 KiB

worldmap

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

void dfs(int v, vector<int> &used, vector<vector<int>> &g, vector<int> &o, int p, vector<vector<int>> &k) {
    o.push_back(v);
    used[v] = 1;
    for (auto i : g[v]) {
        if (used[i] == 0) {
            k[i][v] = 1;
            k[v][i] = 1;
            dfs(i, used, g, o, v, k);
            o.push_back(v);
        } else if (k[i][v] == 0) {
            o.push_back(i);
            o.push_back(v);
            k[i][v] = 1;
            k[v][i] = 1;
        }
    }
}

std::vector<std::vector<int>> create_map(int N, int M, std::vector<int> A, std::vector<int> B) {
    int SIZE = 41;
    vector<vector<int>> k(SIZE, vector<int> (SIZE, 0));
    vector<int> used(SIZE, 0);
    vector<vector<int>> g(SIZE);
    for (int i = 0; i < M; i++) {
        g[A[i]].push_back(B[i]);
        g[B[i]].push_back(A[i]);
    }
    vector<int> o;
    dfs(1, used, g, o, 1, k);
    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;
}

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