| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1351180 | scalifrastico_098 | 세계 지도 (IOI25_worldmap) | C++20 | 0 ms | 344 KiB |
#include "worldmap.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
map<int, vector<int>> e; int i=0, j=0; vector<vector<int>> ans;
void fun(int k, int n)
{
for(int j=0; j<n; j++){ans[i][j]=k+1;} i++; j=0;
for(auto x: e[k]){fun(x, n);}
}
vector<vector<int>> create_map(int n, int m, vector<int> a, vector<int> b) {
ans.assign(n, vector<int>(n, 1));
for(int u=0; u<m; u++){e[a[i]].push_back(b[i]);} fun(1, n);
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... | ||||
