Submission #15785

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
15785	2015-07-26 11:10:50	myungwoo	Parachute rings (IOI12_rings)	C++14	100 / 100	2403 ms	52392 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 <vector>
using namespace std;
#define MAXN 1000006
#define mp make_pair
#define pb push_back
#define sz(v) ((int)(v).size())
typedef pair<int,int> pii;
static int N,deg[MAXN],par[MAXN],size[MAXN];
static int _par[4][MAXN],_deg[4][MAXN],_target[4];
static int cycle_cnt,cycle_size;
static bool sw,_valid[4];
static vector<pii> edges;
int find(int n,int p[MAXN]=par){ return p[n]==n?n:(p[n]=find(p[n],p)); }
void Init(int n)
{
  int i;
  N = n;
  for (i=1;i<=N;i++) par[i] = i, size[i] = 1;
}
void addEdge(int a,int b)
{
  int i;
  for (i=0;i<4;i++){
    if (_target[i] == a || _target[i] == b) continue;
    if (++_deg[i][a] == 3) _valid[i] = 0;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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