| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1302478 | aaaaaaaa | 세계 지도 (IOI25_worldmap) | C++20 | 9 ms | 1344 KiB |
#include "worldmap.h"
#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> create_map(int N, int M, vector<int> A, vector<int> B) {
vector<pair<int, int>> ord;
for(int i = 1; i <= N; ++i){
for(int j = i + 1; j <= N; ++j){
ord.push_back({i, j});
}
}
vector<vector<int>> ans(max(1, (int) ord.size()), vector<int>(max(1, (int) ord.size()), 1));
for(int i = 0; i < ord.size(); ++i){
ans[i][0] = ord[i].first;
ans[i][1] = ord[i].second;
for(int j = 2; j < ord.size(); ++j) ans[i][j] = ans[i][j - 1];
}
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... | ||||
