제출 #1293713

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1293713		tschav_	세계 지도 (IOI25_worldmap)	C++20	86 / 100	41 ms	4960 KiB

worldmap

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


vector<vector<int>> create_map(int n, int m, vector<int> A, vector<int> B) {

    vector<vector<int>> adj;
    adj.resize(n+1,vector<int>{});

    for(int i = 0; i < m; ++i) {
        adj[A[i]].emplace_back(B[i]);
        adj[B[i]].emplace_back(A[i]);
    }

    if(m == 0){
        return vector<vector<int>>{vector<int>{1}};
    }

    vector<int> row;
    vector<bool> vis(n+1,false);

    int C = 0 ;

    auto dfs = [&](int ind, auto &&dfs) -> void {
        vis[ind]=true;
        ++C;
        row.push_back(ind);
        for(auto &u : adj[ind]) {
            if(vis[u] ) continue;

            dfs(u,dfs);
            if(C!=n)row.push_back(ind);
        }
    };

    dfs(1, dfs);

    for(int i = 0; i < row.size();++i){
        cerr << row[i] << " ";
    }

    map<int,int>freq;
    int sz = 1;
    for(int i = 1; i < row.size();++i){
        if(freq[row[i]]){
            ++sz;
        }else{sz+=2;}
        ++freq[row[i]];
    }

     vector<vector<int>> ans(sz, vector<int>(sz, 1));


    vector<bool> F(n+1,false); int last= 0;
    
    int L = 0;
    int lastt = 0;

    int par = 1;
    if(true){
        queue<int> Q;
        int u= row[L];
        for(auto &v : adj[u]){
            Q.push(v);
        }
        for(int i = 0; i < sz; ++i){
            if((i & 1) == par or Q.empty()){
                ans[i][0] = u;
            }else{
                ans[i][0] = Q.front();
                Q.pop();
            }
        }
        F[u]=true;
    }
    ++L;
    for(int i = 1; i < sz; ++i){

        if(L == row.size()){
            int V = row[L-1];

            for(int j = 0; j < sz;++ j){
                ans[j][i] = V;
            }

            continue;
        }

        int u = row[L];

        // if(F[u]){
        //     lastt = i;
        //     for(int j = 0; j < sz;++ j){
        //         ans[j][i] = u;
        //     }
        //             ++L;
        //     continue;
        // }


        if(i==lastt+1){

            int w = row[L-1];
            //cerr << endl;
            //cerr << u << " " << w << " " << L;
            for(int j = 0; j < sz;++ j){
                if((j & 1) == par){
                    ans[j][i] = u;
                }else ans[j][i] = w;
            }

            par ^= 1;

            if(F[u]){
                par ^= 1;
                ++lastt;
                ++L;
            }
            continue;
        }

        if( i == lastt+2){
            queue<int> Q;

            for(auto &v : adj[u]){
                Q.push(v);
            }


            for(int j = 0; j < sz; ++j){
                if((j & 1) == par or Q.empty()){
                    ans[j][i] = u;
                }else{
                    ans[j][i] = Q.front();
                    Q.pop();
                }
            }
            F[u] = true;

            lastt+=2;
            ++L;
        }
    }
    return ans;
}

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