Submission #1293517

#TimeUsernameProblemLanguageResultExecution timeMemory
1293517lizi14World Map (IOI25_worldmap)C++20
0 / 100
1 ms572 KiB
#include "worldmap.h" #include <cassert> #include <cstdio> #include <bits/stdc++.h> using namespace std; vector<int>j; //const int N1=50; vector<int>v[50]; //#include "worldmap.h" vector<int>x; void dfs(int a,int bati){ //x[a]=1; j.push_back(a); for (int k:v[a]) { if(k!=bati) { dfs(k,a); j.push_back(a); } } } vector<vector<int>>create_map(int N, int M,vector<int> A,vector<int> B) { for(int i=0; i<50; i++){ v[i].clear(); } j.clear(); // for(int i=0;i<=N; i++) { // if(x[i]==0)dfs(i, -1); // } dfs(1,0); int batiii=j.size(); vector<vector<int>> ans(batiii, vector<int>(batiii)); for(int i=0; i<j.size(); i++){ for(int drnachvi=0; drnachvi<j.size(); drnachvi++){ ans[drnachvi][i]=j[i]; //cout<<ans[drnachvi][i]<<" "; } //cout<<endl; } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...