제출 #1253173

#제출 시각아이디문제언어결과실행 시간메모리
1253173dreamnguyen세계 지도 (IOI25_worldmap)C++20
0 / 100
0 ms328 KiB
#include <vector>
#include "worldmap.h"
std::vector<std::vector<int>> create_map(int N, int M, std::vector<int> A, std::vector<int> B) {
    int K = 2 * N;
    std::vector<std::vector<int>> grid(K, std::vector<int>(K, 0));
    int color = 1;

    // Gán mỗi màu vào một vị trí riêng biệt (đảm bảo đủ điều kiện 1)
    for (int i = 0; i < N; ++i) {
        grid[i][i] = i + 1;
    }
    int x = 0, y = N;
    for (int i = 0; i < M; ++i) {
        if (x + 1 >= K) {
            x = 0;
            ++y;
            if (y + 1 >= K) break;
        }
        grid[x][y] = A[i];
        grid[x + 1][y] = B[i];
        x += 2;
    }

    return grid;
}
#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...