제출 #836283

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
836283		ALeonidou	수천개의 섬 (IOI22_islands)	C++17	10 / 100	26 ms	4952 KiB

islands

#include "islands.h"

#include <variant>
#include <bits/stdc++.h>

using namespace std;
#define ll int
#define sz(x) (ll)x.size()
#define F first
#define S second
#define MID ((l+r)/2)
#define pb push_back
#define dbg(x) cout<<#x<<": "<<x<<endl;
#define dbg2(x,y) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<endl;
#define dbg3(x,y,z) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<" "<<#z<<": "<<z<<endl;
#define dbg4(x,y,z,w) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<" "<<#z<<": "<<z<<" "<<#w<<": "<<w<<endl;
#define dbg5(x,y,z,w,q) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<" "<<#z<<": "<<z<<" "<<#w<<": "<<w<<" "<<#q<<": "<<q<<endl;


typedef vector <ll> vi;
typedef pair <ll,ll> ii;
typedef vector <ii> vii;
#define MOD 1000002022
#define inf 1e9

variant<bool, vi> find_journey(int N, int M, vi U, vi V){
    ll n = N, m = M;
    vi a, b;


    if (n == 2){
        for (ll i =0; i<m; i++){
            if (U[i] == 0) a.pb(i);
            else b.pb(i);
        }

        bool ok =  (sz(a) >= 2 && sz(b) >= 1);
        
        vi v(6);
        if (ok){
            vi v(6);
            ll x = a[0], y = b[0], z = a[1];
            v[0] = x, v[1] = y, v[2] = z;
            v[3] = x, v[4] = y, v[5] = z;
            return v;
        }
        return false;
    }
    else{
        ll ab =0,ba = 0,ac =0,ca =0,bc =0,cb =0;
        for (ll i=0;i<m; i++){
            if (U[i] == 0 && V[i] == 1) ab = i;
            else if (U[i] == 1 && V[i] == 0) ba = i;
            else if (U[i] == 0 && V[i] == 2) ac = i;
            else if (U[i] == 2 && V[i] == 0) ca = i;
            else if (U[i] == 1 && V[i] == 2) bc = i;
            else if (U[i] == 2 && V[i] == 1) cb = i;
        }

        return vi({ab,bc,ca,ac,cb,ba,ca,bc,ab,ba,cb,ac});
    }

}

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