| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1149575 | byunjaewoo | 수천개의 섬 (IOI22_islands) | C++20 | 18 ms | 3400 KiB |
#include "islands.h"
#include <bits/stdc++.h>
#include <variant>
using namespace std;
variant<bool, vector<int>> find_journey(int N, int M, vector<int> U, vector<int> V) {
int a=-1, b=-1, c=-1;
for(int i=0; i<U.size(); i++) {
if(U[i]) {
if(c<0) c=i;
}
else {
if(a<0) a=i;
else if(b<0) b=i;
}
}
if(a<0 || b<0 || c<0) return false;
vector<int> ret;
for(int i=0; i<2; i++) ret.push_back(a), ret.push_back(c), ret.push_back(b);
return ret;
}
| # | 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... | ||||
