oj.uz

답안 #291037

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
291037 2020-09-04T15:49:22 Z stoyan_malinin 낙하산 고리들 (IOI12_rings) C++14
38 / 100
 614 ms 262148 KB 
//#include "grader.cpp"

#include <set>
#include <map>
#include <vector>
#include <cstring>
#include <assert.h>
#include <iostream>
#include <algorithm>
#include <functional>

using namespace std;

const int MAXN = 1e6 + 5;

struct Graph
{
    struct DSU
    {
        int n;
        int deg[MAXN];
        int parent[MAXN], treeSize[MAXN];

        bool isBad[MAXN];
        int badComponentSz;
        int components, badComponents;

        DSU(){}
        DSU(int n)
        {
            this->n = n;
            this->components = n;
            this->badComponents = 0;

            for(int i = 0;i<n;i++)
            {
                this->deg[i] = 0;
                this->parent[i] = i;
                this->treeSize[i] = 1;
                this->isBad[i] = false;
            }
        }

        int Find(int x)
        {
            if(parent[x]==x) return x;

            parent[x] = Find(parent[x]);
            return parent[x];
        }

        void Union(int u, int v)
        {
            int uOrig = u, vOrig = v;
            u = Find(u);
            v = Find(v);

            badComponents -= isBad[u];
            badComponents -= isBad[v];

            isBad[u] |= isBad[v];
            if(deg[uOrig]>1 || deg[vOrig]>1) isBad[u] = true;

            parent[v] = u;
            treeSize[u] += treeSize[v];

            badComponents += isBad[u];
            if(isBad[u]==true) badComponentSz = treeSize[u];

        }

        void addEdge(int u, int v)
        {
            if(Find(u)!=Find(v))
            {
                Union(u, v);
            }
            else
            {
                if(isBad[Find(u)]==false)
                {
                    isBad[Find(u)] = true;

                    badComponents++;
                    badComponentSz = treeSize[Find(u)];
                }
            }

            deg[u]++;
            deg[v]++;
        }
    };

    int n;
    DSU T;

    int maxDeg = 0;
    vector <int> adj[MAXN];
    vector <pair <int, int>> allEdges;

    int superDegCnt = 0;

    Graph(){}
    Graph(int n)
    {
        this->n = n;
        T = DSU(n);
    }

    void addEdge(int u, int v)
    {
        T.addEdge(u, v);
        adj[u].push_back(v);
        adj[v].push_back(u);
        allEdges.push_back({u, v});

        maxDeg = max(maxDeg, int(adj[u].size()));
        maxDeg = max(maxDeg, int(adj[v].size()));

        if(adj[u].size()==4) superDegCnt++;
        if(adj[v].size()==4) superDegCnt++;
    }
};

Graph G;
map <int, Graph> excludedNode;

void Init(int N)
{
    G = Graph(N);
}

void initFirst()
{
    int node = -1;
    for(int x = 0;x<G.n;x++)
    {
        if(G.adj[x].size()==3)
        {
            node = x;
            break;
        }
    }

    excludedNode[node] = Graph(G.n);
    for(int x: G.adj[node]) excludedNode[x] = Graph(G.n);

    for(auto it = excludedNode.begin();it!=excludedNode.end();it++)
    {
        int x = it->first;
        Graph &g = it->second;

        for(pair <int, int> e: G.allEdges)
        {
            if(e.first!=x && e.second!=x)
            {
                g.addEdge(e.first, e.second);
            }
        }
    }
}

bool initSecondCalled = false;
void initSecond()
{
    initSecondCalled = true;

    int node = -1;
    for(int x = 0;x<G.n;x++)
    {
        if(G.adj[x].size()>=4)
        {
            node = x;
            break;
        }
    }

    if(excludedNode.count(node)==false)
    {
        excludedNode[node] = Graph(G.n);
        for(pair <int, int> e: G.allEdges)
        {
            if(e.first!=node && e.second!=node)
            {
                excludedNode[node].addEdge(e.first, e.second);
            }
        }
    }
}

void Link(int A, int B)
{
    G.addEdge(A, B);

    if(G.maxDeg==3)
    {
        if(excludedNode.empty()==true)
        {
            initFirst();
        }
        else
        {
            for(auto it = excludedNode.begin();it!=excludedNode.end();it++)
            {
                int x = it->first;
                Graph &g = it->second;

                if(A!=x && B!=x)
                {
                    g.addEdge(A, B);
                }
            }
        }
    }
    else if(G.maxDeg>=4)
    {
        if(initSecondCalled==false)
        {
            for(auto it = excludedNode.begin();it!=excludedNode.end();it++)
            {
                int x = it->first;
                Graph &g = it->second;

                if(A!=x && B!=x)
                {
                    g.addEdge(A, B);
                }
            }

            initSecond();
        }
        else
        {
            for(auto it = excludedNode.begin();it!=excludedNode.end();it++)
            {
                int x = it->first;
                Graph &g = it->second;

                if(A!=x && B!=x)
                {
                    g.addEdge(A, B);
                }
            }
        }
    }
}

int CountCritical()
{
    if(G.maxDeg<=2)
    {
        if(G.T.badComponents>1) return 0;
        if(G.T.badComponents==1) return G.T.badComponentSz;

        return G.n;
    }

    assert(excludedNode.size()<=5);

    int ans = 0;
    for(auto it = excludedNode.begin();it!=excludedNode.end();it++)
    {
        if(it->second.T.badComponents==0 && it->second.maxDeg<=2)
        {
            //cout << " -> " << it->first << " " << it->second.maxDeg << '\n';
            ans++;
        }
    }

    return ans;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 61 ms 72696 KB Output is correct
2 Correct 211 ms 218488 KB Output is correct
3 Correct 210 ms 218828 KB Output is correct
4 Correct 62 ms 72824 KB Output is correct
5 Correct 61 ms 72952 KB Output is correct
6 Correct 65 ms 73080 KB Output is correct
7 Correct 202 ms 217848 KB Output is correct
8 Correct 61 ms 73080 KB Output is correct
9 Correct 209 ms 218744 KB Output is correct
10 Correct 213 ms 218872 KB Output is correct

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 549 ms 99820 KB Output is correct
2 Runtime error 614 ms 262148 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 61 ms 72696 KB Output is correct
2 Correct 211 ms 218488 KB Output is correct
3 Correct 210 ms 218828 KB Output is correct
4 Correct 62 ms 72824 KB Output is correct
5 Correct 61 ms 72952 KB Output is correct
6 Correct 65 ms 73080 KB Output is correct
7 Correct 202 ms 217848 KB Output is correct
8 Correct 61 ms 73080 KB Output is correct
9 Correct 209 ms 218744 KB Output is correct
10 Correct 213 ms 218872 KB Output is correct
11 Correct 243 ms 255100 KB Output is correct
12 Correct 253 ms 256376 KB Output is correct
13 Correct 221 ms 219896 KB Output is correct
14 Correct 212 ms 218872 KB Output is correct
15 Correct 213 ms 218872 KB Output is correct
16 Correct 65 ms 73336 KB Output is correct
17 Correct 222 ms 219768 KB Output is correct
18 Correct 272 ms 257016 KB Output is correct
19 Correct 67 ms 73336 KB Output is correct
20 Correct 224 ms 220148 KB Output is correct

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 61 ms 72696 KB Output is correct
2 Correct 211 ms 218488 KB Output is correct
3 Correct 210 ms 218828 KB Output is correct
4 Correct 62 ms 72824 KB Output is correct
5 Correct 61 ms 72952 KB Output is correct
6 Correct 65 ms 73080 KB Output is correct
7 Correct 202 ms 217848 KB Output is correct
8 Correct 61 ms 73080 KB Output is correct
9 Correct 209 ms 218744 KB Output is correct
10 Correct 213 ms 218872 KB Output is correct
11 Correct 243 ms 255100 KB Output is correct
12 Correct 253 ms 256376 KB Output is correct
13 Correct 221 ms 219896 KB Output is correct
14 Correct 212 ms 218872 KB Output is correct
15 Correct 213 ms 218872 KB Output is correct
16 Correct 65 ms 73336 KB Output is correct
17 Correct 222 ms 219768 KB Output is correct
18 Correct 272 ms 257016 KB Output is correct
19 Correct 67 ms 73336 KB Output is correct
20 Correct 224 ms 220148 KB Output is correct
21 Correct 82 ms 74740 KB Output is correct
22 Correct 99 ms 75760 KB Output is correct
23 Correct 107 ms 76528 KB Output is correct
24 Correct 421 ms 228220 KB Output is correct
25 Correct 231 ms 220024 KB Output is correct
26 Correct 398 ms 231520 KB Output is correct
27 Correct 124 ms 77352 KB Output is correct
28 Correct 523 ms 236100 KB Output is correct
29 Runtime error 314 ms 262148 KB Execution killed with signal 9
30 Halted 0 ms 0 KB -

Subtask #5
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 61 ms 72696 KB Output is correct
2 Correct 211 ms 218488 KB Output is correct
3 Correct 210 ms 218828 KB Output is correct
4 Correct 62 ms 72824 KB Output is correct
5 Correct 61 ms 72952 KB Output is correct
6 Correct 65 ms 73080 KB Output is correct
7 Correct 202 ms 217848 KB Output is correct
8 Correct 61 ms 73080 KB Output is correct
9 Correct 209 ms 218744 KB Output is correct
10 Correct 213 ms 218872 KB Output is correct
11 Correct 549 ms 99820 KB Output is correct
12 Runtime error 614 ms 262148 KB Execution killed with signal 9
13 Halted 0 ms 0 KB -