Submission #1192729

#	Time	Username	Problem	Language	Result	Execution time	Memory
1192729		alexdd	Parachute rings (IOI12_rings)	C++20	0 / 100	3 ms	5188 KiB

rings

#include <bits/stdc++.h>
using namespace std;

int n,cntrele;

vector<int> con[200005];

void Init(int N_)
{
    assert(n==0);
    n = N_;

}

void Link(int A, int B)
{
    con[A].push_back(B);
    con[B].push_back(A);

    if(con[A].size() == 3)
        cntrele++;
    if(con[B].size() == 3)
        cntrele++;
}

int CountCritical()
{
    int rez=0;
    for(int i=0;i<n;i++)
    {
        int cnt=0;
        if(con[i].size() > 2)
            cnt++;
        for(int adj:con[i])
            if(con[adj].size() == 3)
                cnt++;
        if(cnt==cntrele)
            rez++;
    }
    return rez;
}

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