Submission #814539

#	Time	Username	Problem	Language	Result	Execution time	Memory
814539		LIF	Thousands Islands (IOI22_islands)	C++17	10 / 100	27 ms	6956 KiB

islands

#include "islands.h"
#include<bits/stdc++.h>
#include <variant>
#include <vector>
int ind[300005];
int ph[1005][1005];
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)
  {
      vector <int> a,b;
      for(int i=0;i<M;i++)
      {
        if(U[i] == 0)a.push_back(i);
        else b.push_back(i);
      }
      if(a.size() >= 2 && b.size() >= 1)
      {
        vector<int> ans;
        ans.push_back(a[0]);
        ans.push_back(b[0]);
        ans.push_back(a[1]);
        ans.push_back(a[0]);
        ans.push_back(b[0]);
        ans.push_back(a[1]);
        return ans;
      }
      else return false;
  }
  else
  {
    for(int i=0;i<M;i++)ph[U[i]][V[i]] = i;
    vector<int> ans;
    ans.push_back(ph[0][1]);
    ans.push_back(ph[1][0]);
    ans.push_back(ph[0][2]);
    ans.push_back(ph[2][0]);
    ans.push_back(ph[1][0]);
    ans.push_back(ph[0][1]);
    ans.push_back(ph[2][0]);
    ans.push_back(ph[0][2]);
    return ans;
  }    	/*
  if (N == 4) {
    return std::vector<int>({0, 1, 2, 4, 0, 3, 2, 1, 4, 3});
  }
  return false;*/
  return true;
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 0 / 21
• Subtask 4: 0 / 24
• Subtask 5: 0 / 45