제출 #1252558

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

worldmap

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

const int SIZE = 41;

vector<int> o;
vector<int> used(SIZE, 0);
vector<vector<int>> g(SIZE);

void dfs(int v) {
    o.push_back(v);
    used[v] = 1;
    for (auto i : g[v]) {
        if (used[i] == 0) {
            dfs(i);
        }
    }
    o.push_back(v);
}

std::vector<std::vector<int>> create_map(int N, int M, std::vector<int> A, std::vector<int> B) {
    int p = 0;
    for (int i = 0; i < M; i++) {
        if (A[i] == 1) {
            p++;
        }
        if (B[i] == 1) {
            p++;
        }
    }
    if (M == N * (N - 1) / 2) {
        vector<vector<int>> ans(240, vector<int> (240, 1));
        int c = 0;
        int h = 0;
        for (int i = 1; i <= N; i++) {
            for (int j = 1; j <= N; j++) {
                ans[c][h] = i;
                ans[c][h + 1] = j;
                c++;
                if (c == 240) {
                    c = 0;
                    h += 2;
                }
            }
        }
        return ans;
    } else if (M == N - 1 && p != N - 1) {
        for (int i = 0; i < M; i++) {
            g[A[i]].push_back(B[i]);
            g[B[i]].push_back(A[i]);
        }
        int n = (int)o.size();
        vector<vector<int>> ans(n, vector<int> (n, 1));
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                ans[i][j] = o[i];
            }
        }
        return ans;
    } else {
        vector<vector<int>> ans(240, vector<int> (240, 1));
        int c = 0;
        int h = 0;
        for (int i = 0; i < M; i++) {
            ans[c][h] = A[i];
            ans[c][h + 1] = B[i];
            c++;
            if (c >= 240) {
                c = 0;
                h += 3;
            }
        }
        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