Submission #1008998

#	Time	Username	Problem	Language	Result	Execution time	Memory
1008998		SulA	Parachute rings (IOI12_rings)	C++17	0 / 100	4006 ms	30932 KiB

rings

#include <vector>
using namespace std;
vector<vector<int>> adj;
vector<int> degree;
int n;

void Init(int N_) {
    n = N_;
    adj.resize(n, vector<int>{});
    degree.resize(n, 0);
}

void Link(int u, int v) {
    adj[u].push_back(v);
    adj[v].push_back(u);
    degree[u]++, degree[v]++;
}

int CountCritical() {
    int cnt = 0;
    for (int u = 0; u < n; u++) {
        // trying to remove node u
        for (int v : adj[u]) {
            degree[v]--;
        }
        bool isCritical = true;
        for (int v = 0; v < n; v++) {
            if (v == u) continue;
            isCritical &= degree[v] <= 2;
        }
        cnt += isCritical;
        for (int v : adj[u]) {
            degree[v]++;
        }
    }
    return cnt;
}

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