제출 #1239661

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1239661		AlperenT_	Thousands Islands (IOI22_islands)	C++20	6.75 / 100	19 ms	4464 KiB

islands

#include "islands.h"

#include <variant>
#include <vector>
#include <bits/stdc++.h> 
//#include "segments.h"
#pragma GCC optimize("O3,unroll-loops") 
#pragma GCC target("avx2") 
#define pb push_back
#define F first
#define pii pair<int,int> 
#define all(a) a.begin(),a.end()
#define S second 
#define sz(a) (int)a.size()
#define rep(i , a , b) for(int i = (a) ; i <= (b) ; i++)
#define per(i , a , b) for(int i = (a) ; i >= (b) ; i--)
#define ld double
#define ll long long 
using namespace std ;
const int maxn = 5000 + 10 , inf = 1e9+ 10 , mod = 998244353;
std::variant<bool, std::vector<int>> find_journey(int n, int m, std::vector<int> U, std::vector<int> V) {
    vector <int> v , v2 ; 
    rep(i , 0 , m-1){
      if(U[i] == 0){
        v.pb(i);
      }else{
        v2.pb(i);
      }
    }
  vector <int> a ;
  if(sz(v) >= 2 && sz(v2) >= 1){
    a.pb(v[0]) ;
    a.pb(v2[0]) ;
    a.pb(v[1]) ;
    a.pb(v[0]);
    a.pb(v2[0]);
    a.pb(v[1]) ;
    return a; 
  }

  return false;
}

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