Submission #835622

#TimeUsernameProblemLanguageResultExecution timeMemory
835622ma_moutahidThousands Islands (IOI22_islands)C++17
6.75 / 100
25 ms4172 KiB
#include "islands.h"

#include <variant>
#include <vector>
#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) {
  int a=0,b=-1;
  pair<int,int>p;
  for(int i=0;i<M;i++){
    if(U[i]==0){
      if(a>=2)continue;
      if(a==1)p.second=i;
      else p.first=i;
      a++;
    }
    else {
      b=i;
    }
  }
  if (b!=-1 && a>=2) {
    return std::vector<int>({p.first,b,p.second,p.first,b,p.second});
  }
  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...