| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1319823 | yeyso2 | 세계 지도 (IOI25_worldmap) | C++20 | 8 ms | 1336 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(N*2, vector<int>(N*2, 0));
for(int i = 0; i < res.size(); i ++){
for(int j = 0; j < res[i].size(); j ++){
if(i % 2 == 0){
res[i][j] = i / 2 + 1;
} else {
res[i][j] = (j % N) + 1;
}
}
}
return res;
}
/*
1
1 2 3
2
1 3 4...
3
*/| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
