Submission #1258094

#TimeUsernameProblemLanguageResultExecution timeMemory
1258094avighnaWorld Map (IOI25_worldmap)C++20
15 / 100
152 ms18336 KiB
#include <bits/stdc++.h> std::vector<std::vector<int>> create_map(int N, int M, std::vector<int> A, std::vector<int> B) { std::vector ans(240, std::vector<int>(240, 1)); int i = 0, j = 0; for (int k = 0; k < M; ++k) { ans[i][j] = A[k], ans[i][j + 1] = B[k]; j += 3; if (j == 240) { i += 2, j = 0; } } 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...