#include <bits/stdc++.h>
using namespace std;
const int N = 1000010;
int n , comp[N], mx , adj[N] , ans = 0 , cycles = 0 , vis[N] , vi = 0 , comp2[4][N] , con1[4][N] , con2[4][N] , qu[N];
vector< int > g[N];
vector< pair<int,bool> > v;
vector< pair<int,int> > v2;
int Find(int u){
return (u == comp[u] ? u : comp[u] = Find(comp[u]));
}
int Find2(int u,int i){
if(u == comp2[i][u])
return u;
return comp2[i][u] = Find2(comp2[i][u],i);
}
void Init(int N_) {
n = N_;
ans = n ;
for(int i=0;i<n;i++)
comp[i] = i;
mx = 0 ;
cycles = 0 ;
}
void DFS(int node,int prnt,int last){
while(true){
ans++;
if(node == last) return;
for(int i=0;i<(int)g[node].size();i++){
if(g[node][i] != prnt){
prnt = node;
node = g[node][i];
break;
}
}
}
}
void DFS2(int node,int cant,int cur,int cnt){
int st = 0 , en = 1 , num = 0;
qu[st] = node;
vis[node] = vi;
while(st < en){
comp2[cur][node] = cnt;
node = qu[st++];
num = 0 ;
for(int i=0;i<(int)g[node].size();i++){
num += (g[node][i] != cant);
if(vis[g[node][i]] == vi || g[node][i] == cant) continue;
num++;
qu[en++] = g[node][i];
vis[g[node][i]] = vi;
}
if(num < 2){
if(con1[cur][cnt] == -1) con1[cur][cnt] = node; else con2[cur][cnt] = node;
}
}
}
void make(int u){
v.push_back(make_pair(u,true));
for(int i=0;i<(int)g[u].size();i++){
v.push_back(make_pair(g[u][i],true));
}
ans = 0 ;
for(int i=0;i<(int)v.size();i++){
vi++;
for(int j=0;j<n;j++){
if(j == v[i].first || vis[j] == vi) continue;
con1[i][j] = con2[i][j] = -1;
DFS2(j,v[i].first,i,j);
if(con1[i][j] == -1){
v[i].second = false;
break;
}
if(con2[i][j] == -1) con2[i][j] = con1[i][j];
}
ans += v[i].second;
}
}
void Link(int a, int b) {
if(ans == 0) return;
if(mx < 3){
int u = Find(a);
int v = Find(b);
adj[a]++;
adj[b]++;
g[a].push_back(b);
g[b].push_back(a);
if(adj[a] == 3){
mx = 3;
make(a);
return ;
}
if(adj[b] == 3){
mx = 3;
make(b);
return;
}
if(u == v){
if(cycles > 0){
ans = 0;
return ;
}
cycles++;
ans = 0 ;
DFS(a,b,b);
}
else{
comp[u] = v;
}
return ;
}
for(int i=0;i<(int)v.size();i++){
if(v[i].second == false) continue;
if(a == v[i].first || b == v[i].first){
adj[v[i].first]++;
if(adj[v[i].first] > 3 && v.size() > 1){
int cur = v[i].first;
ans = 1;
v.clear();
v.push_back(make_pair(cur,1));
break;
}
continue;
}
int u = Find2(comp2[i][a],i);
int vv = Find2(comp2[i][b],i);
if(u == vv){
v[i].second = false;
ans--;
continue;
}
if(a != con1[i][u] && a != con2[i][u]){
v[i].second = false;
ans--;
continue;
}
if(b != con1[i][vv] && b != con2[i][vv]){
v[i].second = false;
ans--;
continue;
}
comp2[i][u] = vv;
if(a == con1[i][u] && b == con1[i][vv]){
con1[i][vv] = con2[i][u];
}
else if(a == con2[i][u] && b == con1[i][vv]){
con1[i][vv] = con1[i][u];
}
else if(a == con1[i][u] && b == con2[i][vv]){
con2[i][vv] = con2[i][u];
}
else if(a == con2[i][u] && b == con2[i][vv]){
con2[i][vv] = con1[i][u];
}
}
}
int CountCritical() {
return ans;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
21 ms |
23800 KB |
Output is correct |
| 2 |
Incorrect |
24 ms |
24460 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
449 ms |
44412 KB |
Output is correct |
| 2 |
Incorrect |
808 ms |
85064 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
21 ms |
23800 KB |
Output is correct |
| 2 |
Incorrect |
24 ms |
24460 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
21 ms |
23800 KB |
Output is correct |
| 2 |
Incorrect |
24 ms |
24460 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
21 ms |
23800 KB |
Output is correct |
| 2 |
Incorrect |
24 ms |
24460 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
