제출 #1190705

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1190705		Amr	Thousands Islands (IOI22_islands)	C++20	10 / 100	19 ms	4464 KiB

islands

#include "islands.h"

#include <variant>
#include <vector>

#include<bits/stdc++.h>
using namespace std;
#define ll int
std::variant<bool, std::vector<int>> find_journey( int N, int M, std::vector<int> U, std::vector<int> V) {

    if(N==2)
    {
        vector<int> va,vb;
        for(int i = 0; i < M; i++) if(U[i]==0)va.push_back(i); else vb.push_back(i);
        if(va.size()>=2&&vb.size()>=1)
        {
            vector<int > ans;
            ll a1 = va[0], a2 = va[1], b = vb[0];
            return vector<int>({a1,b,a2,a1,b,a2});
        }
        else return false;
    }
    ll a1 , a2, b1 ,b2 , c1, c2;
    for(int i = 0; i < M; i++)
    {
        if(U[i]==0&&V[i]==1) a1 = i;
        if(U[i]==1&&V[i]==0) a2 = i;
        if(U[i]==1&&V[i]==2) b1 = i;
        if(U[i]==2&&V[i]==1) b2 = i;
        if(U[i]==2&&V[i]==0) c1 = i;
        if(U[i]==0&&V[i]==2) c2 = i;
    }
    return vector<int>({a1,b1,c1,c2,b2,a2,c1,b1,a1,a2,b2,c2});
}

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