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