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