| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1250008 | Aliyyiakbar | 세계 지도 (IOI25_worldmap) | C++20 | 1 ms | 580 KiB |
#include "bits/stdc++.h"
#include "worldmap.h"
using namespace std;
vector<vector<int>> create_map(int n, int m, vector<int> a, vector<int> b)
{
vector<vector<int>> ans(2 * n, vector<int>(2 * n, 1));
if (m > 0)
{
ans[0][0] = a[0];
ans[0][1] = b[0];
}
return ans;
}| # | 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... | ||||
