| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1293593 | nikakh | World Map (IOI25_worldmap) | C++20 | 9 ms | 1852 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<vector<int>> matrix(2 * n, vector<int> (2 * n));
int x = 1;
for(int i = 0; i < 2 * n; i++){
if(i % 2 == 0){
for(int j = 0; j < 2 * n; j++) matrix[j][i] = x;
x++;
} else{
int y = 1;
for(int j = 0; j < n; j++){
matrix[j][i] = y++;
}
y = 1;
for(int j = n; j < 2 * n; j++){
matrix[j][i] = y++;
}
}
}
return matrix;
}| # | 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... | ||||
