Submission #1249804

#TimeUsernameProblemLanguageResultExecution timeMemory
1249804zzzzzzzzzzzzzzzWorld Map (IOI25_worldmap)C++20
5 / 100
3 ms580 KiB
#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>> ans(N, vector<int>(N, 1)); vector<vector<int>> g(N+1); vector<int> cnt(N+1); for(int i=0;i<M;i++){ g[A[i]].push_back(B[i]); g[B[i]].push_back(A[i]); cnt[A[i]]++; cnt[B[i]]++; } int v,p=-1; for(int i=1;i<=N;i++){ if(cnt[i]==1){ v=i; break; } } for(int i=0;i<N;i++){ for(int j=0;j<N;j++) ans[i][j]=v; int p2=v; for(int k:g[v]){ if(k!=p) { v=k; break; } } p=p2; } 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...