| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1235640 | MuhammadSaram | 수천개의 섬 (IOI22_islands) | C++20 | 19 ms | 6984 KiB |
#include "islands.h"
#include <bits/stdc++.h>
using namespace std;
variant<bool, vector<int>> find_journey(int n, int m, vector<int> U, vector<int> V)
{
if (n<3) return false;
int e[n][n];
for (int i=0;i<m;i++)
e[U[i]][V[i]]=i;
return vector<int>({e[0][1],e[1][0],e[0][2],e[2][1],e[0][1],e[1][0],e[2][1],e[0][2]});
}| # | 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... | ||||
