Submission #845830

#TimeUsernameProblemLanguageResultExecution timeMemory
845830Marco_EscandonThousands Islands (IOI22_islands)C++17
6.75 / 100
43 ms8388 KiB
#include<bits/stdc++.h>
using namespace std;
#include <vector>
typedef int ll;

#include <variant>
#include <vector>

std::variant<bool, std::vector<int>> find_journey(int n, int m, std::vector<int> U, std::vector<int> V)
{
    vector<pair<ll,pair<ll,ll>>> v;
    for(int i=0; i<m; i++)
    {
        v.push_back({U[i],{V[i],i}});
    }
    sort(v.begin(),v.end());
    if(m<=2||v[0].first==1||v[1].first==1||v[m-1].first==0)
    {
        return false;
    }
    vector<int>asd(6);
    asd[0]=v[0].second.second;
    asd[1]=v[m-1].second.second;
    asd[2]=v[1].second.second;
    asd[3]=v[0].second.second;
    asd[4]=v[m-1].second.second;
    asd[5]=v[1].second.second;
    return asd;
}
#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...