oj.uz

답안 #317440

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
317440 2020-10-29T17:50:01 Z mohamedsobhi777 낙하산 고리들 (IOI12_rings) C++14
37 / 100
 4000 ms 104112 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;
int onc[cn];

void detect(int x, int p)
{
        if (vis[x] == c)
        {
                cyc = now;
                for (auto u : now)
                        onc[u] = 1;
                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())
        {
                if (asy)
                        return 1;
                return onc[*bigs.begin()];
        }

        if (th.size() == 1)
        {
                if (asy)
                        return 1 + (int)adj[*th.begin()].size();
                int tret = onc[*th.begin()];
                for (auto u : adj[*th.begin()])
                        tret += onc[u];
                //return tret;
        }
        else if (th.size() == 2)
        {
                if (cs)
                {
                        int a = *th.begin();
                        int b = *th.rbegin();
                        if (onc[a] + onc[b] == 0)
                                return 0;
                        map<int, int> mp;
                        for (auto u : adj[a])
                                mp[u]++;
                        for (auto u : adj[b])
                                mp[u]++;
                        mp[a]++;
                        mp[b]++;
                        for (auto u : mp)
                        {
                                if (onc[u.first] && u.second == 2)
                                        ++ret;
                        }
                        return ret;
                }
        }

        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 (th.size() == 0)
                return N;

        // 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

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 27776 KB Output is correct
2 Correct 21 ms 27936 KB Output is correct
3 Correct 22 ms 28064 KB Output is correct
4 Correct 19 ms 27776 KB Output is correct
5 Correct 21 ms 28032 KB Output is correct
6 Correct 22 ms 28288 KB Output is correct
7 Correct 19 ms 27776 KB Output is correct
8 Correct 20 ms 27904 KB Output is correct
9 Correct 22 ms 28032 KB Output is correct
10 Correct 23 ms 28160 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 477 ms 46072 KB Output is correct
2 Correct 968 ms 56104 KB Output is correct
3 Correct 1962 ms 79736 KB Output is correct
4 Correct 1238 ms 66188 KB Output is correct
5 Correct 1259 ms 72276 KB Output is correct
6 Correct 1361 ms 104112 KB Output is correct
7 Correct 1810 ms 80504 KB Output is correct
8 Correct 3102 ms 69092 KB Output is correct
9 Correct 3361 ms 71980 KB Output is correct
10 Correct 816 ms 65272 KB Output is correct

Subtask #3
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 27776 KB Output is correct
2 Correct 21 ms 27936 KB Output is correct
3 Correct 22 ms 28064 KB Output is correct
4 Correct 19 ms 27776 KB Output is correct
5 Correct 21 ms 28032 KB Output is correct
6 Correct 22 ms 28288 KB Output is correct
7 Correct 19 ms 27776 KB Output is correct
8 Correct 20 ms 27904 KB Output is correct
9 Correct 22 ms 28032 KB Output is correct
10 Correct 23 ms 28160 KB Output is correct
11 Execution timed out 4078 ms 28032 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 27776 KB Output is correct
2 Correct 21 ms 27936 KB Output is correct
3 Correct 22 ms 28064 KB Output is correct
4 Correct 19 ms 27776 KB Output is correct
5 Correct 21 ms 28032 KB Output is correct
6 Correct 22 ms 28288 KB Output is correct
7 Correct 19 ms 27776 KB Output is correct
8 Correct 20 ms 27904 KB Output is correct
9 Correct 22 ms 28032 KB Output is correct
10 Correct 23 ms 28160 KB Output is correct
11 Execution timed out 4078 ms 28032 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #5
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 27776 KB Output is correct
2 Correct 21 ms 27936 KB Output is correct
3 Correct 22 ms 28064 KB Output is correct
4 Correct 19 ms 27776 KB Output is correct
5 Correct 21 ms 28032 KB Output is correct
6 Correct 22 ms 28288 KB Output is correct
7 Correct 19 ms 27776 KB Output is correct
8 Correct 20 ms 27904 KB Output is correct
9 Correct 22 ms 28032 KB Output is correct
10 Correct 23 ms 28160 KB Output is correct
11 Correct 477 ms 46072 KB Output is correct
12 Correct 968 ms 56104 KB Output is correct
13 Correct 1962 ms 79736 KB Output is correct
14 Correct 1238 ms 66188 KB Output is correct
15 Correct 1259 ms 72276 KB Output is correct
16 Correct 1361 ms 104112 KB Output is correct
17 Correct 1810 ms 80504 KB Output is correct
18 Correct 3102 ms 69092 KB Output is correct
19 Correct 3361 ms 71980 KB Output is correct
20 Correct 816 ms 65272 KB Output is correct
21 Execution timed out 4078 ms 28032 KB Time limit exceeded
22 Halted 0 ms 0 KB -