제출 #1293512

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1293512		lizi14	World Map (IOI25_worldmap)	C++20	0 / 100	1 ms	572 KiB

worldmap

//#include "worldmap.h"
#include <cassert>
#include <cstdio>

//#include "worldmap.h"
#include <cassert>
#include <cstdio>
#include <bits/stdc++.h>
using namespace std;
vector<int>j;
//const int N1=50;
vector<int>v[100];
//#include "worldmap.h"
int x[100];
void dfs(int a,int bati){
    x[a]=1;
    j.push_back(a);
    for (int k:v[a]) {
        if(x[k]!=1 && k!=bati) {
            dfs(k,a);
            j.push_back(a);
        }
    }
}
vector<vector<int>>create_map(int N, int M,vector<int> A,vector<int> B) {
    int n=A.size();
    j.clear();
    // x.resize(N+1);
    // for(int i=0; i<=N; i++) x[i]=0;
    // v.resize(N+1);
    // for(int i=0; i<=N; i++) v[i].clear();
    for(int i=0; i<n; i++){
        v[A[i]].push_back(B[i]);
        v[B[i]].push_back(A[i]);
    }
    dfs(1,-1);
    int batiii=j.size();
    vector<vector<int>> ans(batiii-1, vector<int>(batiii-1));
    for(int i=1; i<=j.size()-1; i++){
        for(int drnachvi=1; drnachvi<=j.size()-1; drnachvi++){
            ans[drnachvi-1][i-1]=j[i];
            //cout<<ans[drnachvi][i]<<" ";
        }
        //cout<<endl;
    }
    
    return ans;
}

• 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