Submission #561779

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
561779	2022-05-13 13:22:17	drkarlicio2107	Parachute rings (IOI12_rings)	C++14	100 / 100	723 ms	80256 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;
int N; int ima=0, tre=0;
pair <int, int> g [1000010];
struct rijesi {
  int par [1000010];
  int dub [1000010];
  int deg [1000010];
  int c=-1, md=0, zab=-1;
  void dod (int a, int b){
    if (a==zab || b==zab || md>2) return ;
    //cout << a << " " << b << " " << zab << endl;
    deg [a]++; deg [b]++;
    md=max (md, max (deg [a], deg [b]));
    while (par [a]!=-1) a=par [a];
    while (par [b]!=-1) b=par [b];
    if (dub [b]>dub [a]) swap (a, b);
    //cout << dub [a] << " " << dub [b] << endl;
    if (a==b){
      if (c>-1) c=0;
      else c=dub [a];
    }
    else {
      dub [a]+=dub [b];
      par [b]=a;
    }
    return ;
  }
  int ans (){
    if (ima && c!=-1) return 0;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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