제출 #1239703

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1239703		AlperenT_	수천개의 섬 (IOI22_islands)	C++20	0 / 100	68 ms	78660 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 = 1e6 + 10 , inf = 1e9+ 10 , mod = 998244353;
int mark[maxn] ;
vector <pii> G[maxn] ;
bool ok = 0;
map <int,int> mp[maxn];
vector <int> az ; 
void dfs(int v){
  if(ok == 1)return ;
  mark[v] = 1; 
  az.pb(v);
  for(auto [u,w]: G[v]){
    if(ok == 1)break ;
    if(mark[u] == 1){
      az.pb(u) ;
      ok =1 ;
      break ;
    }
    dfs(u) ;
  }
  if(ok == 1)return ;
  az.pop_back() ;
}

std::variant<bool, std::vector<int>> find_journey(int n, int m, std::vector<int> U, std::vector<int> V) {
  rep(i , 0 ,m-1){
    G[U[i]].pb({V[i] , i}); 
    mp[U[i]][V[i]] = i ; 
  }
  dfs(0);
  if(sz(az) == 0)return false ;
  return true ;
}

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