제출 #1253210

#제출 시각아이디문제언어결과실행 시간메모리
1253210TINWorld Map (IOI25_worldmap)C++20
5 / 100
8 ms1348 KiB
#include "worldmap.h" std::vector<std::vector<int>> create_map(int N, int M, std::vector<int> A, std::vector<int> B) { std::vector<std::vector<int>> ans(2 * N, std::vector<int>(2 * N, 1)); for (auto& x : A) --x; for (auto& x : B) --x; if (M == N - 1) { bool sub1 = true; for (int i = 0; i + 1 < N; i++) if (A[i] != i || B[i] != i + 1) sub1 = false; if (sub1) { for (int i = 0; i < 2 * N; i++) for (int j = 0; j < 2 * N; j++) ans[i][j] = N; for (int i = 1; i < N; i++) for (int j = 0; j < 2 * N; j++) ans[i - 1][j] = i; } else { } return ans; } 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...