Submission #119768

#	Time	Username	Problem	Language	Result	Execution time	Memory
119768		ahmad_salah	Parachute rings (IOI12_rings)	C++17	0 / 100	4097 ms	48068 KiB

rings

#include <bits/stdc++.h>

using namespace std;

const int M = 1e6;
int n;
vector<int> adj[M];
bool v[M], ok;

void dfs(int node, bool bef, int forb) {
    if (!v[node]) {
        v[node] = 1;

        int cnt = 0;
        for (int x : adj[node])
            if (x != forb)
                cnt++;

        if ((!bef && cnt > 2) || (bef && cnt > 1)) {
            ok = false;
            return;
        }

        for (int x : adj[node])
            if (x != forb)
                dfs(x, 1, forb);
    }
}

void Init(int N) { n = N; }

void Link(int a, int b) {
    adj[a].push_back(b);
    adj[b].push_back(a);
}

int CountCritical() {
    int ans = 0;

    for (int i = 0; i < n; i++) {
        memset(v, 0, sizeof v);
        ok = true;
        for (int j = 0; j < n; j++)
            if (!v[j])
                dfs(j, 0, i);
        if (ok)
            ans++;
    }

    return ans;
}

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