Submission #1263045

#TimeUsernameProblemLanguageResultExecution timeMemory
1263045nerrrminWorld Map (IOI25_worldmap)C++20
0 / 100
0 ms328 KiB
#include "worldmap.h" #define pb push_back #include <bits/stdc++.h> using namespace std; const int maxn = 100; int n, m; vector < int > g[maxn]; int col[maxn]; std::vector<std::vector<int>> create_map(int N, int M, std::vector<int> A, std::vector<int> B) { n = N; m = M; for (int i = 0; i < m; ++ i) { g[A[i]].pb(B[i]); } int r = 0; for (int i = 0; i < 2*n; ++ i) col[i] = 1; for (int i = 2; i <= n; ++ i) { col[r] = i; r += 2; } std::vector<std::vector<int>> ans(2*n, std::vector<int>(2*n, 0)); for (int i = 0; i < 2*n; ++ i) { if(col[i] == 1) { for (int j = 0; j < 2*n; ++ j) ans[i][j] = 1; } else { int v = col[i]; int j = 0; for (auto x: g[v]) { ans[i][j] = x; j ++; ans[i][j] = v; j ++; } while(j < 2*n) { ans[i][j] = v; j ++; } } } 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...