제출 #635509

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
635509	2022-08-26 10:53:49	Bruteforceman	낙하산 고리들 (IOI12_rings)	C++11	100 / 100	639 ms	55632 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
    #pragma GCC optimize("Ofast")    
    #include "bits/stdc++.h"
    using namespace std;
    int N;
    struct dsu {
        int other[1000010];
        int len[1000010];
        int cycle_cnt;
        int cycle_sum;
        bool bad;
        int no_of_nodes;
        int del_node;
     
        void init (int n) {
            no_of_nodes = n;
            del_node = -1;
            for(int i = 0; i < no_of_nodes; i++) {
                other[i] = i;
                len[i] = 1;
            }
            cycle_cnt = 0;
            cycle_sum = 0;
            bad = false;
        }
        void add(int x, int y) {
            if(del_node == x || del_node == y) return ; 
            if(bad) return ;
            if(other[x] == y) {
                other[x] = -1;
                other[y] = -1;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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