제출 #628099

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
628099	2022-08-13 04:56:27	amunduzbaev	수천개의 섬 (IOI22_islands)	C++17	12.35 / 100	155 ms	19052 KiB

islands

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "islands.h"
#include "bits/stdc++.h"
using namespace std;
#include <variant>
#ifndef EVAL
#include "grader.cpp"
#endif
#define ar array
const int N = 2e5 + 5;
vector<int> edges[N];
int used[N], in[N];
variant<bool, vector<int>> find_journey(int n, int m, vector<int> u, vector<int> v) {
  map<ar<int, 2>, int> id;
  vector<int> r(m);
  for(int i=0;i<m;i++){
    edges[u[i]].push_back(i);
    if(id.count({v[i], u[i]})){
      int j = id[{v[i], u[i]}];
      r[j] = i, r[i] = j;
    }
    
    id[{u[i], v[i]}] = i;
  }
  
  if(edges[0].size() > 1){
    int a = edges[0][0], b = edges[0][1];
    return (vector<int>){a, r[a], b, r[b], r[a], a, r[b], b};
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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