Submission #1289154

#TimeUsernameProblemLanguageResultExecution timeMemory
1289154ecen30World Map (IOI25_worldmap)C++20
7 / 100
8 ms1848 KiB
//testing AI Code #include <bits/stdc++.h> using namespace std; vector<vector<int>> create_map(int N, int M, vector<int> A, vector<int> B) { int K = min(2 * N, 240); vector<vector<int>> C(K, vector<int>(K, 1)); // Step 1: each country appears at least once for (int i = 0; i < N; i++) { C[i][i] = i + 1; } // Step 2: place adjacency pairs as 2x2 tiles int r = 0, c = 0; for (int i = 0; i < M; i++) { int a = A[i], b = B[i]; C[r][c] = a; if (c + 1 < K) C[r][c + 1] = b; else if (r + 1 < K) C[r + 1][c] = b; c += 2; if (c >= K) { c = 0; r += 2; } if (r >= K) break; // we have plenty of space } // Step 3: fill remaining empty cells with country 1 for (int i = 0; i < K; i++) for (int j = 0; j < K; j++) if (C[i][j] < 1 || C[i][j] > N) C[i][j] = 1; return C; }
#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...