Submission #1293211

#TimeUsernameProblemLanguageResultExecution timeMemory
1293211tschav_World Map (IOI25_worldmap)C++20
15 / 100
15 ms3416 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>> adj; adj.resize(n+1,vector<int>{}); for(int i = 0; i < m; ++i) { adj[A[i]].emplace_back(B[i]); adj[B[i]].emplace_back(A[i]); } vector<vector<int>> ans(2*n,vector<int>(2*n,1)); for(int i = 0; i < 2 * n; ++i) { if(i & 1) { int u = (i+1)/2; queue<int> Q; for(auto &v : adj[u]) Q.push(v); for(int j = 0; j < 2 * n; ++j) { if(j & 1) { if(Q.empty()) { ans[i][j] = u; continue; } ans[i][j] = Q.front(); Q.pop(); } else { ans[i][j] = u; } } } else { for(int j = 0; j < 2 * n; ++j) { ans[i][j] = 1; } } } 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...