| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1252927 | nickolasarapidis | 세계 지도 (IOI25_worldmap) | C++20 | 3 ms | 580 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){
if(M == N - 1){
vector<vector<int>> ans(N, vector<int> (N));
for(int i = 0; i < N; i++){
for(int j = 0; j < N; j++){
ans[i][j] = i + 1;
}
}
return ans;
}
else{
vector<vector<int>> ans(2*N, vector<int> (2*N));
for(int i = 0; i < N; i++){
int cnt = 0;
for(int j = 0; j < 2*N; j++){
if(j%2 == 0){
ans[i][j] = i + 1;
cnt++;
}
else{
ans[i][j] = cnt;
}
}
}
for(int i = 0; i < N; i++){
for(int j = 0; j < 2*N; 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... | ||||
