#include <bits/stdc++.h>
using namespace std;
map<long long,long long> sumas;
vector<vector<int>> V;
long long con1=0;
int N=10;
void Init(int N){
vector<int> V1(N,0);
for(int i=0;i<N;i++){
V.push_back(V1);
}
}
void Link(int A,int B){
V[A][B]=1;
V[B][A]=1;
sumas[A]++;
sumas[B]++;
}
int CountCritical(){
long long res=0;
for(int i=0;i<N;i++){
bool com=true;
long long con=0;
long long solitos=0;
for(int j=0;j<N;j++){
if(i!=j){
if(V[i][j]==1){
sumas[j]--;
}
if(sumas[j]>2){
com=false;
break;
}
if(sumas[j]==0){
solitos++;
if(V[i][j]==1){
sumas[j]++;
}
continue;
}
if(sumas[j]==1){
con++;
}
if(V[i][j]==1){
sumas[j]++;
}
}
}
if(solitos!=N-1){
if(con%2!=0 || con==0){
com=false;
}
}
if(com){
res++;
}
}
return res;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
336 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
180 ms |
262144 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
336 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
336 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
336 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |