Submission #1067147

#	Time	Username	Problem	Language	Result	Execution time	Memory
1067147		j_vdd16	Thousands Islands (IOI22_islands)	C++17	1.75 / 100	21 ms	5776 KiB

islands

#include "islands.h"

#include <variant>
#include <algorithm>
#include <bitset>
#include <cstdint>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

//#define int long long
#define loop(X, N) for(int X = 0; X < (N); X++)
#define all(V) V.begin(), V.end()
#define rall(V) V.rbegin(), V.rend()

using namespace std;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;

typedef uint64_t u64;
typedef int64_t i64;

int n, m;
vvii adj;

vb vis;
vi depths;

int counter = 0;
vii inOut;
void dfs(int node, int d) {
    if (vis[node]) {
        return;
    }
    vis[node] = true;
    depths[node] = d;

    inOut[node].first = counter++;

    for (auto [child, idx] : adj[node]) {
        dfs(child, d + 1);
    }

    inOut[node].second = counter++;
}

bool isAncestor(int a, int b) {
    return inOut[a].first <= inOut[b].first && inOut[b].first <= inOut[a].second;
}

bool dfs2(int node) {
    if (vis[node]) {

    }
}

std::variant<bool, std::vector<int>> find_journey(int N, int M, vi U, vi V) {
    n = N;
    m = M;
    adj = vvii(n);
    loop(i, m) {
        adj[U[i]].push_back({V[i], i});
    }

    if (n >= 3) {
        return true;
    }

    return false;

    // depths = vi(n);
    // counter = 0;
    // inOut = vii(n);
    // vis = vb(n);
    // dfs(0, 0);

    // vis = vb(n);

    // return false;

    // return success;
}

Compilation message (stderr)

islands.cpp: In function 'bool dfs2(int)':
islands.cpp:69:1: warning: no return statement in function returning non-void [-Wreturn-type]
   69 | }
      | ^

• Subtask 1: 0 / 5
• Subtask 2: 1.75 / 5
• Subtask 3: 0 / 21
• Subtask 4: 0 / 24
• Subtask 5: 0 / 45