Submission #1247522

#TimeUsernameProblemLanguageResultExecution timeMemory
1247522ereringThousands Islands (IOI22_islands)C++20
5 / 100
18 ms3396 KiB
#include <bits/stdc++.h>
#include "islands.h"
using namespace std;

variant<bool, vector<int>> find_journey(int N, int M, vector<int> U, vector<int> V) {
    pair<int,int> p={-1,-1};
    int idx=-1;
    for(int i=0;i<M;i++){
        if(U[i]==0 && V[i]==1){
            if(p.first==-1)p.first=i;
            else p.second=i;
        }
        if(U[i]==1 && V[i]==0)idx=i;
    }
    if(p.second==-1 || idx==-1)return false;
    return vector<int>{p.first,idx,p.second,p.first,idx,p.second};
}
#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...