제출 #1227207

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1227207		brinton	수천개의 섬 (IOI22_islands)	C++20	22.75 / 100	56 ms	11592 KiB

islands

#include "islands.h"

#include <bits/stdc++.h>
using namespace std;

variant<bool, vector<int>> find_journey(int N, int M, vector<int> U, vector<int> V) {
  auto co = [](int id){
    if(id%2 == 0) return id+1;
    else return id-1;
  };

  vector<set<pair<int,int>>> edges(N);// nxt,id
  for(int i = 0;i < M;i++){
    edges[U[i]].insert({V[i],i});
  }
  // if(edges[0].size() < 2) return false;
  vector<bool> vis(N,false);
  
  int root = 0;
  vector<int> to_root;
  while(edges[root].size() <= 1){
    if(edges[root].size() == 0) return false;
    auto [nxt,id] = *edges[root].begin();

    to_root.push_back(id);
    vis[root] = true;
    edges[root].erase({nxt,id});
    edges[nxt].erase({root,co(id)});

    root = nxt;
  }
  
  auto [nxt1,id1] = *edges[root].begin();
  auto [nxt2,id2] = *++edges[root].begin();
  vector<int> ans{id1,co(id1),id2,co(id2),
                  co(id1),id1,co(id2),id2};
  
  vector<int> ret = to_root;
  for(auto &i:ans) ret.push_back(i);
  for(int i = to_root.size()-1;i >= 0;i--) ret.push_back(to_root[i]);

  return ret;
  // return ans;
}

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