| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1235837 | mariza | 수천개의 섬 (IOI22_islands) | C++20 | 19 ms | 5308 KiB |
#include "islands.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=1e5;
variant<bool, vector<int>> find_journey(int n, int m, vector<int> u, vector<int> v) {
vector<ll> x0, x1;
for(ll i=0; i<m; i++){
if(u[i]==0) x0.push_back(i);
else x1.push_back(i);
}
if(x0.size()>=2 && x1.size()>=1){
vector<int> ans;
ll a=x0[0], b=x0[1], c=x1[0];
ans.push_back(a);
ans.push_back(c);
ans.push_back(b);
ans.push_back(a);
ans.push_back(c);
ans.push_back(b);
return ans;
}
else 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... | ||||
