Submission #796268

#	Time	Username	Problem	Language	Result	Execution time	Memory
796268		ln_e	Thousands Islands (IOI22_islands)	C++17	6.75 / 100	24 ms	5180 KiB

islands

  #include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho
    #include "islands.h"
    using ll=long long;
    using ld=long double;
    int const INF=1000000005;
    ll const LINF=1000000000000000005;
    ll const mod=1000000007;
    ld const PI=3.14159265359;
    ll const MAX_N=3e5+5;
    ld const EPS=0.00000001;
    #pragma GCC optimize("O3")
    #pragma GCC optimize("Ofast")
    #define f first
    #define s second
    #define pb push_back
    #define mp make_pair
    #define endl '\n'
    #define sz(a) (int)a.size()
    #define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    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<ll>g[3];
    for(ll i=0;i<M;i++)
    {
      g[U[i]].pb(i);
    }
    if(g[0].size()>=2&&g[1].size()>=1){
      vector<int>ans;
      ans.pb(g[0][0]);
      ans.pb(g[1][0]);
      ans.pb(g[0][1]);
      ans.pb(g[0][0]);
      ans.pb(g[1][0]);
      ans.pb(g[0][1]);
      return ans;
    }else return false;
  }else if(N<=400&&N>=3){
    return true;
  }else return false;
}

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