Submission #654838

#TimeUsernameProblemLanguageResultExecution timeMemory
654838aryan12수천개의 섬 (IOI22_islands)C++17
5 / 100
33 ms4424 KiB
#include "islands.h"
#include <bits/stdc++.h>
using namespace std;

variant<bool, vector<int> > find_journey(int N, int M, vector<int> U, vector<int> V)
{
    vector<int> c1, c2;
    for(int i = 0; i < M; i++)
    {
        if(U[i] == 0 && V[i] == 1)
        {
            c1.push_back(i);
        }
        else if(U[i] == 1 && V[i] == 0)
        {
            c2.push_back(i);
        }
    }
    if(c1.size() < 2 || c2.size() < 1)
    {
        return false;
    }
    return vector<int>({c1[0], c2[0], c1[1], c1[0], c2[0], c1[1]});
    // if true
    return vector<int>({0, 1, 2});
    // if false
    return false;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...