제출 #1071782

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1071782		c2zi6	수천개의 섬 (IOI22_islands)	C++17	0 / 100	1 ms	604 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;
VVPI gp;

variant<bool, VI> find_journey(int N, int M, VI U, VI V) {
    n = N;
    gp = VVPI(n);
    rep(i, M) {
        gp[U[i]].pb({V[i], i});
        gp[V[i]].pb({U[i], i});
    }
    if (N == 2) {
        if (gp[0].size() < 3 || gp[1].size() < 1) return false;
        VI ans;
        ans.pb(gp[0][0].ss);
        ans.pb(gp[1][0].ss);
        ans.pb(gp[0][1].ss);
        ans.pb(gp[0][0].ss);

        ans.pb(gp[0][2].ss);
        ans.pb(gp[0][1].ss);
        ans.pb(gp[1][0].ss);
        ans.pb(gp[0][2].ss);
        return ans;
    }
    return false;
}

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