oj.uz

Submission #1110053

# Submission time Handle Problem Language Result Execution time Memory
1110053 2024-11-08T14:52:52 Z ozner77 Parachute rings (IOI12_rings) C++17
0 / 100
 4000 ms 262144 KB 
#include <bits/stdc++.h>
using namespace std;
map<long long,long long> sumas;
vector<vector<int>> V;
vector<vector<int>> R;
long long con1=0;
int n;
void Init(int N){
    n=N;
    vector<int> V1(N,0);
    vector<int> J;
    for(int i=0;i<n;i++){
        V.push_back(V1);
        R.push_back(J);
    }
}
void Link(int A,int B){
    R[A].push_back(B);
    R[B].push_back(A);
    V[A][B]=1;
    V[B][A]=1;
    sumas[A]++;
    sumas[B]++;
}
void cadena(int i,int j,vector<int> visitados){
    visitados[j]=1;
    if(V[i][j]==1){
        if(sumas[j]==2){
            con1++;
        }
    }else{
        if(sumas[j]==1){
            con1++;       
        }
    }
    int jaja=R[j].size();
    for(int k=0;k<jaja;k++){
        if(visitados[R[j][k]]==0 && R[j][k]!=i){
            cadena(i,R[j][k],visitados);
        }
    }
}
int CountCritical(){
    long long res=0;
    for(int i=0;i<n;i++){
        bool com=true;
        for(int j=0;j<n;j++){
            if(i!=j){
                if(V[i][j]==1){
                    if(sumas[j]==1){
                        continue;
                    }else if(sumas[j]>3){
                        com=false;
                        break;
                    }else{
                        vector<int> visitados(n,0);
                        con1=0;
                        cadena(i,j,visitados);
                        if(con1!=2){
                            com=false;
                            break;
                        }
                    }
                }else{
                    if(sumas[j]==0){
                        continue;
                    }else if(sumas[j]>2){
                        com=false;
                        break;
                    }else{
                        vector<int> visitados(n,0);
                        con1=0;
                        cadena(i,j,visitados);
                        if(con1!=2){
                            com=false;
                            break;
                        }
                    }
                }
            }
        }
        if(com){
            res++;
        }
    }
    return res;
}
/*int main(){
    Init(n);
    Link(9,0);
    Link(0,5);
    Link(0,6);
    Link(1,2);
    Link(1,5);
    Link(5,6);
    Link(5,9);
    Link(9,6);
    long long xd=CountCritical();
    cout<<xd;
}*/
//me dio bien en 3 casos de pruebas...
//ma falta comprobar que tenga solo un incio y un final y ya tengo 20 puntos creo
//RINGS PROBLEMA DE MIERDDDDDDDDDD TODA LA PUT* TARDE TRATANDO DE RESOLVERTE Y ERES EL UNICO QUE NO ME SALES CARAJ* >:( ODIOOOOOOOOOOOO ESTE PROBLEMA DEL DEMONIO

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 336 KB Output is correct
2 Execution timed out 4090 ms 72164 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Runtime error 168 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 336 KB Output is correct
2 Execution timed out 4090 ms 72164 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 336 KB Output is correct
2 Execution timed out 4090 ms 72164 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 336 KB Output is correct
2 Execution timed out 4090 ms 72164 KB Time limit exceeded
3 Halted 0 ms 0 KB -