제출 #1319828

#제출 시각아이디문제언어결과실행 시간메모리
1319828yeyso2세계 지도 (IOI25_worldmap)C++20
0 / 100
135 ms18044 KiB
#include "worldmap.h" using namespace std; #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<std::vector<int>> ans(2 * N, std::vector<int>(2 * N, 1)); // if (M > 0) { // ans[0][0] = A[0]; // ans[0][1] = B[0]; // } vector<vector<int>> res(240, vector<int>(240, 1)); int row = 1; int col = 1; for(int i = 0; i < M; i ++){ if(A[i] != 1 && A[i] != 2){ res[row][col] = A[i]; res[row][col+1] = B[i]; col += 3; if(col > 230){ col = 1; row += 2; } } } return res; } /* 1 7 9 1 2 1 3 1 4 1 5 1 6 1 7 4 5 5 6 4 6 */
#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...