제출 #500514

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
500514	2021-12-31 09:35:20	sidon	낙하산 고리들 (IOI12_rings)	C++17	38 / 100	4056 ms	61820 KiB

rings

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 <bits/stdc++.h>
using namespace std;
vector<array<int, 2>> g;
int N, p;
struct Solver {
  int e[1<<20], d[1<<20] = {};
  int maxDeg = 0, cycle = -1, rem = -1;
  int find(int u){
    return e[u] < 0 ? u : e[u] = find(e[u]);
  }
  void add(int u, int v) {
    
    if(u == rem || v == rem) return;
    maxDeg = max({maxDeg, ++d[u], ++d[v]});
    
    if((u = find(u)) == (v = find(v))) {
      cycle >= 0 ? maxDeg = 3 : cycle = u;
    } else {
      if(e[u] > e[v]) swap(u, v);
      e[u] += e[v], e[v] = u;
    }
  }
  int get() {
    if(maxDeg > 2) return 0;
    return cycle >= 0 ? e[cycle] : N;
  }
} s[5];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 20 / 20
• Subtask 2: 0 / 17
• Subtask 3: 18 / 18
• Subtask 4: 0 / 14
• Subtask 5: 0 / 31