Submission #1256201

#TimeUsernameProblemLanguageResultExecution timeMemory
1256201JoksimKaktusWorld Map (IOI25_worldmap)C++20
15 / 100
1180 ms2162688 KiB
#include "worldmap.h" #include <bits/stdc++.h> using namespace std; vector<int> red; vector<int> adj[50]; void init(){ for(int i = 0;i < 50;i++){ adj[i].clear(); } red.clear(); } void find(int u,int p){ red.push_back(u); for(int v : adj[u]){ if(v == p)continue; find(v,u); red.push_back(u); } } vector<vector<int>> create_map(int n, int m, vector<int> a, vector<int> b) { init(); for(int i = 0;i < m;i++){ adj[a[i]].push_back(b[i]); adj[b[i]].push_back(a[i]); } find(1,-1); int len = red.size(); vector<vector<int>> res(len,vector<int>(len)); for(int i = 0;i < len;i++){ for(int j = 0;j < len;j++){ res[i][j] = red[j]; } } return res; }
#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...