Submission #1370153

#TimeUsernameProblemLanguageResultExecution timeMemory
1370153leolin0214Thousands Islands (IOI22_islands)C++20
5 / 100
14 ms4328 KiB
#include "islands.h"

#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <variant>

using namespace std;

std::variant<bool, std::vector<int>> find_journey(int N, int M, std::vector<int> U, std::vector<int> V) 
{
    vector<int> c[2];
    for (int i=0; i<M; i++) c[U[i]].push_back(i);

    if (c[0].size() < 2 || c[1].size() < 1) return false;
    
    int x = c[0][0], y = c[0][1];
    int z = c[1][0];

    vector<int> ans = {x, z, y, x, z, y};
    return true, ans;
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...