oj.uz

Submission #317424

# Submission time Handle Problem Language Result Execution time Memory
317424 2020-10-29T17:24:50 Z mohamedsobhi777 Parachute rings (IOI12_rings) C++14
37 / 100
 4000 ms 100584 KB 
#include <bits/stdc++.h>

using namespace std;
int N;
const int cn = 1e6;

vector<int> adj[cn];
int deg[cn];
int vis[cn];
int c;
bool bd = 1;
int del;
vector<int> vec;
set<int> th;
int asy = 1;
int cs = 0;

struct dsu
{
        int fat[cn];
        dsu()
        {
                memset(fat, 0, sizeof fat);
                for (int i = 0; i < cn; ++i)
                        fat[i] = i;
        }
        inline int find(int x) { return fat[x] = (x == fat[x] ? x : find(fat[x])); }
        inline bool same(int x, int y) { return find(x) == find(y); }
        void link(int u, int v)
        {
                u = find(u);
                v = find(v);
                if (fat[u] != v)
                        fat[u] = v;
        }
} d1;

void dfs(int x, int p)
{
        vis[x] = c;
        int ch = (p != x);
        vec.push_back(x);
        for (auto u : adj[x])
        {
                if (u == p || del == u)
                        continue;
                if (vis[u] == c)
                        bd = 0;
                else
                        dfs(u, x), ++ch;
        }
        if (ch > 2)
                bd = 0;
}
set<int> bigs;

bool check(int i)
{
        del = i;
        for (auto u : adj[i])
        {
                deg[u]--;
                deg[i]--;
        }
        bool ok = 1;
        vec.clear();
        for (int j = 0; j < N; ++j)
        {
                if (vis[j] != c && i != j)
                {
                        bd = 1;
                        dfs(j, j);
                        ok &= bd;
                }
        }

        for (auto u : adj[i])
        {
                deg[u]++;
                deg[i]++;
        }
        return ok;
}

vector<int> cyc;
vector<int> now;

void detect(int x, int p)
{
        if (vis[x] == c)
        {
                cyc = now;
                return;
        }
        now.push_back(x);

        vis[x] = c;
        for (auto u : adj[x])
        {
                if (u == p || (int)cyc.size())
                        continue;
                detect(u, x);
        }
        now.pop_back();
}

int brute()
{
        int ret = 0;
        set<int> uni;

        if (cs > 1 || bigs.size() > 1 || th.size() > 2)
                return 0;
        if(th.size() == 0 && asy)return N ; 
        if(cs == 1 && th.size() == 0)return (int) cyc.size() ;

        if (bigs.size() == 1 && asy)
                return 1;
        if (th.size() == 1 && bigs.size() == 0 && asy)
        {
                return 1 + (int)adj[*th.begin()].size();
        }
        

        if (th.size() > 1)
        {

                for (auto u : th)
                {
                        ++c;
                        if (check(u))
                                uni.insert(u);
                        for (auto v : adj[u])
                        {
                                ++c;
                                if (check(v))
                                        uni.insert(v);
                        }
                }
                return (int)uni.size();
        }
        // if (asy)
        //       return N;
        for (int i = 0; i < N; ++i)
        {
                ++c;
                if (check(i))
                        ++ret;
        }

        return ret;
}

void Init(int N_)
{

        N = N_;
}
void Link(int A, int B)
{
        adj[A].push_back(B);
        adj[B].push_back(A);
        cs += (d1.same(A, B));
        if (d1.same(A, B) && asy)
        {
                ++c;
                detect(A, A);
                asy = 0;
        }

        d1.link(A, B);
        deg[A]++;
        deg[B]++;
        if (deg[A] > 3)
                bigs.insert(A);
        if (deg[B] > 3)
                bigs.insert(B);
        if (deg[A] == 3)
        {
                th.insert(A);
        }
        if (deg[B] == 3)
        {
                th.insert(B);
        }
}

int CountCritical()
{
        if (bigs.size() > 1)
                return 0;
        return brute();
        return N;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 27776 KB Output is correct
2 Correct 23 ms 27904 KB Output is correct
3 Correct 22 ms 27904 KB Output is correct
4 Correct 20 ms 27776 KB Output is correct
5 Correct 22 ms 28032 KB Output is correct
6 Correct 22 ms 28160 KB Output is correct
7 Correct 20 ms 27776 KB Output is correct
8 Correct 21 ms 27904 KB Output is correct
9 Correct 23 ms 28032 KB Output is correct
10 Correct 23 ms 28032 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 477 ms 46180 KB Output is correct
2 Correct 957 ms 56184 KB Output is correct
3 Correct 1916 ms 79736 KB Output is correct
4 Correct 1212 ms 64956 KB Output is correct
5 Correct 1220 ms 68600 KB Output is correct
6 Correct 1335 ms 100584 KB Output is correct
7 Correct 1772 ms 80376 KB Output is correct
8 Correct 3042 ms 69476 KB Output is correct
9 Correct 3342 ms 72296 KB Output is correct
10 Correct 802 ms 63736 KB Output is correct

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 27776 KB Output is correct
2 Correct 23 ms 27904 KB Output is correct
3 Correct 22 ms 27904 KB Output is correct
4 Correct 20 ms 27776 KB Output is correct
5 Correct 22 ms 28032 KB Output is correct
6 Correct 22 ms 28160 KB Output is correct
7 Correct 20 ms 27776 KB Output is correct
8 Correct 21 ms 27904 KB Output is correct
9 Correct 23 ms 28032 KB Output is correct
10 Correct 23 ms 28032 KB Output is correct
11 Execution timed out 4019 ms 28160 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 27776 KB Output is correct
2 Correct 23 ms 27904 KB Output is correct
3 Correct 22 ms 27904 KB Output is correct
4 Correct 20 ms 27776 KB Output is correct
5 Correct 22 ms 28032 KB Output is correct
6 Correct 22 ms 28160 KB Output is correct
7 Correct 20 ms 27776 KB Output is correct
8 Correct 21 ms 27904 KB Output is correct
9 Correct 23 ms 28032 KB Output is correct
10 Correct 23 ms 28032 KB Output is correct
11 Execution timed out 4019 ms 28160 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #5
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 27776 KB Output is correct
2 Correct 23 ms 27904 KB Output is correct
3 Correct 22 ms 27904 KB Output is correct
4 Correct 20 ms 27776 KB Output is correct
5 Correct 22 ms 28032 KB Output is correct
6 Correct 22 ms 28160 KB Output is correct
7 Correct 20 ms 27776 KB Output is correct
8 Correct 21 ms 27904 KB Output is correct
9 Correct 23 ms 28032 KB Output is correct
10 Correct 23 ms 28032 KB Output is correct
11 Correct 477 ms 46180 KB Output is correct
12 Correct 957 ms 56184 KB Output is correct
13 Correct 1916 ms 79736 KB Output is correct
14 Correct 1212 ms 64956 KB Output is correct
15 Correct 1220 ms 68600 KB Output is correct
16 Correct 1335 ms 100584 KB Output is correct
17 Correct 1772 ms 80376 KB Output is correct
18 Correct 3042 ms 69476 KB Output is correct
19 Correct 3342 ms 72296 KB Output is correct
20 Correct 802 ms 63736 KB Output is correct
21 Execution timed out 4019 ms 28160 KB Time limit exceeded
22 Halted 0 ms 0 KB -