Submission #1012764

#TimeUsernameProblemLanguageResultExecution timeMemory
1012764bachhoangxuanThousands Islands (IOI22_islands)C++17
5 / 100
17 ms3976 KiB
#include "islands.h"
#include<bits/stdc++.h>
using namespace std;

std::variant<bool, std::vector<int>> find_journey(
    int N, int M, std::vector<int> U, std::vector<int> V) {
    if(N<=2) return false;
    vector<vector<int>> e(N);
    for(int i=0;i<M;i++) if(min(U[i],V[i])==0 && max(U[i],V[i])<=2) e[U[i]].push_back(i);
    if(V[e[0][0]]!=1) swap(e[0][0],e[0][1]);
    vector<int> res={e[0][0],e[1][0],e[0][1],e[2][0],e[1][0],e[0][0],e[2][0],e[0][1]};
    return res;
}
#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...