#ifndef EVAL
#include "grader.cpp"
#endif
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
const int Ni = 1e6+5;
vector<int> edges[Ni];
int n, ans;
vector<int> p;
vector<int> sz;
int par(int u){
if(p[u] == u)return u;
return p[u] = par(p[u]);
}
bool IsSame(int u, int v){
return par(u) == par(v);
}
void merge(int u,int v){
u=par(u);v=par(v);
if(u == v)return;
p[v] = u;
sz[u] += sz[v];
return;
}
int have_this_number_of_edges[5];
void Init(int N_) {
n = N_;
ans = n;
p.assign(n,0);
sz.assign(n,0);
for(int i=0;i<n;i++)p[i] = i;
have_this_number_of_edges[0] = n;
}
int number_of_cycles;
void Link(int u, int v){
have_this_number_of_edges[u]--;
have_this_number_of_edges[v]--;
edges[u].pb(v);
edges[v].pb(u);
have_this_number_of_edges[min(4,u)]++;
have_this_number_of_edges[min(4,v)]++;
if(IsSame(u, v)){
number_of_cycles++;
}else {
merge(u,v);
}return;
}
int please_dont_go_there;
bool is_it_normal;
bool used[Ni];
void dfs(int u, int p){
used[u] = true;
int cnt= 0 ;
for(auto v : edges[u]){
if(v != please_dont_go_there)cnt++;
if(v == p || v == please_dont_go_there)continue;
if(used[v])is_it_normal = false;
else dfs(v,u);
}if(cnt>2)is_it_normal = false;
}
vector<int> cycle;
void PleaseFindCycles(int u, int p){
}
int CountCritical(){
if(number_of_cycles > 1 || have_this_number_of_edges[4] > 1)return 0;
ans = 0;
for(int i=0;i<n;i++){
// it's like: what if we delete this vertex?
please_dont_go_there = i;
for(int j=0;j<n;j++)used[j] = false;
used[please_dont_go_there] = true;
is_it_normal = true;
for(int j=0;j<n;j++){
if(!used[j])dfs(j,j);
}
if(is_it_normal)ans++;
}return ans;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
51 ms |
48236 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
56 ms |
56428 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
51 ms |
48236 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
51 ms |
48236 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
51 ms |
48236 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
