제출 #1072058

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1072058		c2zi6	수천개의 섬 (IOI22_islands)	C++17	1.75 / 100	25 ms	5588 KiB

islands

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "islands.h"

int n, m;
VVPI gp;

VI vis;
bool ans;
void dfs(int u = 0, int pi = -1) {
    vis[u] = true;
    for (auto[v, i] : gp[u]) if (i != pi) {
        if (vis[v]) {
            ans = true;
            continue;
        }
        dfs(v, i);
    }
}

variant<bool, VI> find_journey(int N, int M, VI U, VI V) {
    n = N;
    m = M;
    gp = VVPI(n);
    for (int i = 0; i < m; i += 2) {
        int u = U[i];
        int v = V[i];
        gp[u].pb({v, i});
        gp[v].pb({u, i});
    }
    vis = VI(n);
    ans = false;
    dfs();
    if (ans || gp[0].size() > 1) return VI{1, 4, 8, 8};
    return false;
}

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