Submission #1250186

#TimeUsernameProblemLanguageResultExecution timeMemory
1250186chithanhnguyenWorld Map (IOI25_worldmap)C++20
7 / 100
9 ms1348 KiB
#include "worldmap.h" #include <bits/stdc++.h> using namespace std; int n; vector<vector<int>> create_map(int N, int M, vector<int> A, vector<int> B) { n = N; int k = 2 * n; vector<vector<int>> a(k, vector<int>(k, n)); for (int m = 0; m < n; ++m) { int j = 2 * m; for (int i = 0; i < k; ++i) { if (i % 2 == 0) { a[i][j] = m + 1; } else { int y = i / 2; a[i][j] = (y != m) ? y + 1 : m + 1; } } j = 2 * m + 1; for (int i = 0; i < k; ++i) { if (i % 2 == 1) { a[i][j] = m + 1; } else { int y = i / 2; a[i][j] = (y != m) ? y + 1 : m + 1; } } if (m >= 1) { for (int i = 0; i < k; i += 2) { a[i][2 * m - 1] = m + 1; } } if (m < n - 1) { for (int i = 0; i < k; i += 2) { a[i][2 * m + 1] = m + 1; } } } return a; } // int main() { // vector<vector<int>> res = create_map(5, 6, {1, 2, 1, 4, 4}, {2, 3, 4, 5, 6}); // for (int i = 0; i < 2*n; ++i) { // for (int j = 0; j < 2*n; ++j) { // cout << res[i][j] << " "; // } // cout << '\n'; // } // }
#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...