Submission #1110144

#	Time	Username	Problem	Language	Result	Execution time	Memory
1110144		ozner77	Parachute rings (IOI12_rings)	C++17	0 / 100	1748 ms	262144 KiB

rings

#include <bits/stdc++.h>
using namespace std;
map<long long,long long> sumas;
vector<vector<int>> V;
long long con1=0;
int n;
void Init(int N){
    n=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;
}

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