Submission #1262765

#	Time	Username	Problem	Language	Result	Execution time	Memory
1262765		vtnoo	World Map (IOI25_worldmap)	C++20	0 / 100	1 ms	832 KiB

worldmap

#include <bits/stdc++.h>

using namespace std;

const int K=240;
vector<vector<int>> adj, g;
int j=0;

void dfs(int u, int p){
    for(int i=0;i<K;i++){
        g[i][j]=u;
    }
    j++;
    for(auto v:adj[u]){
        if(v==p)continue;
        dfs(v, u);
        for(int i=0;i<K;i++){
            g[i][j]=u;
        }
        j++;
    }
}

std::vector<std::vector<int>> create_map(int N, int M, std::vector<int> A, std::vector<int> B){
    g.resize(K, vector<int> (K, -1));
    adj.resize(N+1);
    for(int i=0;i<M;i++){
        adj[A[i]].push_back(B[i]);
        adj[B[i]].push_back(A[i]);
    }
    dfs(1, 1);
    int lim=0;
    for(int i=0;i<K;i++){
        for(int j0=0;j0<K;j0++){
            if(g[i][j0]==-1){
                lim=j0;
                break;
            }
        }
        if(lim)break;
    }
    lim--;
    vector<vector<int>> res(lim, vector<int>(lim));
    for(int i=0;i<lim;i++){
        for(int j=0;j<lim;j++){
            res[i][j]=g[i][j];
        }
    }
    return res;
}

• 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