Submission #1043492

#TimeUsernameProblemLanguageResultExecution timeMemory
1043492jer033Thousands Islands (IOI22_islands)C++17
6.75 / 100
16 ms5336 KiB
#include "islands.h"
#include <bits/stdc++.h>
#include <variant>
#include <vector>
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 >=3 ) {
    return true;
  }
  vector<int> z;
  vector<int> o;
  for (int i=0; i<M; i++)
  {
    if (U[i]==0)
        z.push_back(i);
    else
        o.push_back(i);
  }
  if ((z.size()>=2) and (o.size()>=1))
  {
    vector<int> ans = {z[0], o[0], z[1], z[0], o[0], z[1]};
    return ans;
  }
  else
    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...