oj.uz

답안 #282441

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
282441 2020-08-24T12:28:52 Z hoanghq2004 Split the Attractions (IOI19_split) C++14
40 / 100
 181 ms 25720 KB 
#include <bits/stdc++.h>

#define split

#include <split.h>

using namespace std;

const int N = 100005;

int n;
pair <int, int> a, b, c;
vector <int> C, adj[N], E[N];
int sz[N], check[N];
int times, low[N], num[N];

void dfs(int u, int p)
{
    num[u] = low[u] = ++times;
    sz[u] = 1;
    check[u] = 1;
    for (auto v: adj[u])
    {
        if (v == p) continue;
        if (!num[v])
        {
            E[u].push_back(v);
            dfs(v, u);
            sz[u] += sz[v];
            low[u] = min(low[u], low[v]);
            if (sz[v] >= a.first) check[u] = 0;
        }
        else low[u] = min(low[u], num[v]);
    }
}


void paint(int u, int num, int cl)
{
    queue <int> q;
    q.push(u);
    int cnt = 0;
    if (!C[u])
    {
        C[u] = cl;
        cnt = 1;
    }
    if (cnt == num) return;
    while (!q.empty())
    {
        int u = q.front();
        q.pop();
        for (auto v: E[u])
            if (!C[v])
            {
                ++cnt;
                C[v] = cl;
                q.push(v);
                if (num == cnt) return;
            }
    }
}


vector <int> find_split(int _n, int _a, int _b, int _c, vector <int> u, vector <int> v)
{
    n = _n;
    a = {_a, 1}, b = {_b, 2}, c = {_c, 3};

    if (a > b) swap(a, b);
    if (a > c) swap(a, c);
    if (b > c) swap(b, c);

    assert(a <= b && b <= c);

    int m = (int)v.size();
    C = vector <int> (n, 0);

    for (int i = 0; i < m; i ++)
    {
        adj[v[i]].push_back(u[i]);
        adj[u[i]].push_back(v[i]);
    }
    dfs(0, 0);
    for (int u = 0; u < n; ++u)
    {
        if (check[u] && sz[u] >= a.first && n - sz[u] >= a.first)
        {
            if (sz[u] <= n - sz[u])
            {
                paint(u, a.first, a.second);
                paint(0, b.first, b.second);
            }
            else
            {
                paint(u, b.first, b.second);
                paint(0, a.first, a.second);
            }
            for (int i = 0; i < n; ++i)
                if (!C[i]) C[i] = c.second;
            return C;
        }
    }
    for (int u = 0; u < n; ++u)
        if (check[u] && n - sz[u] < a.first)
        {
            int cnt = 0;
            for (auto v: E[u])
                if (low[v] < num[u]) cnt += sz[v];
            if (cnt + n - sz[u] < a.first) continue;
            C[u] = b.second;
            paint(0, a.first, a.second);
            cnt = n - sz[u];
            for (auto v: E[u])
            {
                if (low[v] < num[u] && cnt + sz[v] <= a.first)
                {
                    paint(v, a.first, a.second);
                    cnt += sz[v];
                    if (cnt == a.first) break;
                    else continue;
                }
                if (low[v] < num[u] && cnt + sz[v] > a.first)
                {
                    int pivot = num[u];
                    queue <int> q;
                    q.push(v);
                    stack <int> stk;
                    while (!q.empty())
                    {
                        int u = q.front();
                        q.pop();
                        stk.push(u);
                        for (auto v: E[u])
                            if (!C[v] && low[v] < pivot)
                                q.push(v);
                    }
                    while (!stk.empty())
                    {
                        int u = stk.top();
                        stk.pop();
                        C[u] = a.second;
                        ++cnt;
                        if (cnt == a.first) break;
                    }
                }
                if (cnt == a.first) break;
            }
            C[u] = 0;
            paint(u, b.first, b.second);

            for (int i = 0; i < n; ++i)
                if (!C[i]) C[i] = c.second;
            return C;
        }
    return C;
}

#ifndef split
int main() {
//    freopen("split.inp", "r", stdin);
//    freopen("split.out", "w", stdout);


	int n, m, a, b, c;
	assert(5 == scanf("%d%d%d%d%d", &n, &m, &a, &b, &c));
	vector <int> p(m), q(m);
	for (int i = 0; i < m; ++i)
		assert(2 == scanf("%d%d", &p[i], &q[i]));

	vector <int> result = find_split(n, a, b, c, p, q);

	for (int i = 0; i < result.size(); ++i)
		printf("%s%d", ((i > 0) ? " " : ""), result[i]);
	printf("\n");
	return 0;
}
#endif

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4992 KB ok, correct split
2 Correct 4 ms 4992 KB ok, correct split
3 Correct 4 ms 4992 KB ok, correct split
4 Correct 4 ms 4992 KB ok, correct split
5 Correct 3 ms 4992 KB ok, correct split
6 Correct 4 ms 4992 KB ok, correct split
7 Correct 119 ms 25212 KB ok, correct split
8 Correct 118 ms 22520 KB ok, correct split
9 Correct 128 ms 21752 KB ok, correct split
10 Correct 119 ms 25720 KB ok, correct split
11 Correct 124 ms 25720 KB ok, correct split

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4992 KB ok, correct split
2 Correct 3 ms 4992 KB ok, correct split
3 Correct 4 ms 4992 KB ok, correct split
4 Correct 155 ms 21336 KB ok, correct split
5 Correct 102 ms 14968 KB ok, correct split
6 Correct 111 ms 25720 KB ok, correct split
7 Correct 173 ms 22264 KB ok, correct split
8 Correct 181 ms 18580 KB ok, correct split
9 Correct 141 ms 16504 KB ok, correct split
10 Correct 69 ms 13808 KB ok, correct split
11 Correct 82 ms 13808 KB ok, correct split
12 Correct 75 ms 14240 KB ok, correct split

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4992 KB ok, correct split
2 Correct 115 ms 15000 KB ok, correct split
3 Correct 41 ms 8952 KB ok, correct split
4 Correct 4 ms 4992 KB ok, correct split
5 Correct 157 ms 19464 KB ok, correct split
6 Correct 132 ms 19192 KB ok, correct split
7 Correct 119 ms 18936 KB ok, correct split
8 Correct 139 ms 20600 KB ok, correct split
9 Correct 122 ms 18808 KB ok, correct split
10 Correct 29 ms 8320 KB ok, no valid answer
11 Correct 47 ms 9976 KB ok, no valid answer
12 Correct 80 ms 14324 KB ok, no valid answer
13 Correct 108 ms 14968 KB ok, no valid answer
14 Correct 69 ms 14064 KB ok, no valid answer

Subtask #4
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4992 KB ok, correct split
2 Correct 5 ms 4992 KB ok, no valid answer
3 Correct 4 ms 5024 KB ok, correct split
4 Correct 4 ms 4992 KB ok, correct split
5 Correct 4 ms 4992 KB ok, correct split
6 Correct 4 ms 4992 KB ok, correct split
7 Correct 4 ms 4992 KB ok, correct split
8 Correct 4 ms 4992 KB ok, correct split
9 Correct 6 ms 5376 KB ok, correct split
10 Correct 6 ms 5376 KB ok, correct split
11 Correct 4 ms 4992 KB ok, correct split
12 Correct 6 ms 5376 KB ok, correct split
13 Correct 3 ms 4992 KB ok, correct split
14 Correct 3 ms 4992 KB ok, correct split
15 Correct 3 ms 4992 KB ok, correct split
16 Correct 3 ms 4992 KB ok, correct split
17 Correct 4 ms 4992 KB ok, correct split
18 Correct 4 ms 4992 KB ok, correct split
19 Correct 5 ms 5120 KB ok, correct split
20 Correct 4 ms 5144 KB ok, correct split
21 Correct 5 ms 5376 KB ok, correct split
22 Correct 5 ms 5376 KB ok, correct split
23 Correct 6 ms 5376 KB ok, correct split
24 Correct 7 ms 5376 KB ok, correct split
25 Correct 6 ms 5376 KB ok, correct split
26 Correct 7 ms 5376 KB ok, correct split
27 Correct 7 ms 5376 KB ok, correct split
28 Correct 6 ms 5376 KB ok, correct split
29 Correct 4 ms 5120 KB ok, correct split
30 Correct 5 ms 5376 KB ok, correct split
31 Correct 4 ms 5120 KB ok, correct split
32 Correct 3 ms 4992 KB ok, correct split
33 Correct 5 ms 5120 KB ok, correct split
34 Correct 5 ms 5248 KB ok, correct split
35 Correct 6 ms 5248 KB ok, correct split
36 Incorrect 5 ms 5248 KB invalid split: #1=718, #2=1, #3=1681
37 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4992 KB ok, correct split
2 Correct 4 ms 4992 KB ok, correct split
3 Correct 4 ms 4992 KB ok, correct split
4 Correct 4 ms 4992 KB ok, correct split
5 Correct 3 ms 4992 KB ok, correct split
6 Correct 4 ms 4992 KB ok, correct split
7 Correct 119 ms 25212 KB ok, correct split
8 Correct 118 ms 22520 KB ok, correct split
9 Correct 128 ms 21752 KB ok, correct split
10 Correct 119 ms 25720 KB ok, correct split
11 Correct 124 ms 25720 KB ok, correct split
12 Correct 4 ms 4992 KB ok, correct split
13 Correct 3 ms 4992 KB ok, correct split
14 Correct 4 ms 4992 KB ok, correct split
15 Correct 155 ms 21336 KB ok, correct split
16 Correct 102 ms 14968 KB ok, correct split
17 Correct 111 ms 25720 KB ok, correct split
18 Correct 173 ms 22264 KB ok, correct split
19 Correct 181 ms 18580 KB ok, correct split
20 Correct 141 ms 16504 KB ok, correct split
21 Correct 69 ms 13808 KB ok, correct split
22 Correct 82 ms 13808 KB ok, correct split
23 Correct 75 ms 14240 KB ok, correct split
24 Correct 3 ms 4992 KB ok, correct split
25 Correct 115 ms 15000 KB ok, correct split
26 Correct 41 ms 8952 KB ok, correct split
27 Correct 4 ms 4992 KB ok, correct split
28 Correct 157 ms 19464 KB ok, correct split
29 Correct 132 ms 19192 KB ok, correct split
30 Correct 119 ms 18936 KB ok, correct split
31 Correct 139 ms 20600 KB ok, correct split
32 Correct 122 ms 18808 KB ok, correct split
33 Correct 29 ms 8320 KB ok, no valid answer
34 Correct 47 ms 9976 KB ok, no valid answer
35 Correct 80 ms 14324 KB ok, no valid answer
36 Correct 108 ms 14968 KB ok, no valid answer
37 Correct 69 ms 14064 KB ok, no valid answer
38 Correct 4 ms 4992 KB ok, correct split
39 Correct 5 ms 4992 KB ok, no valid answer
40 Correct 4 ms 5024 KB ok, correct split
41 Correct 4 ms 4992 KB ok, correct split
42 Correct 4 ms 4992 KB ok, correct split
43 Correct 4 ms 4992 KB ok, correct split
44 Correct 4 ms 4992 KB ok, correct split
45 Correct 4 ms 4992 KB ok, correct split
46 Correct 6 ms 5376 KB ok, correct split
47 Correct 6 ms 5376 KB ok, correct split
48 Correct 4 ms 4992 KB ok, correct split
49 Correct 6 ms 5376 KB ok, correct split
50 Correct 3 ms 4992 KB ok, correct split
51 Correct 3 ms 4992 KB ok, correct split
52 Correct 3 ms 4992 KB ok, correct split
53 Correct 3 ms 4992 KB ok, correct split
54 Correct 4 ms 4992 KB ok, correct split
55 Correct 4 ms 4992 KB ok, correct split
56 Correct 5 ms 5120 KB ok, correct split
57 Correct 4 ms 5144 KB ok, correct split
58 Correct 5 ms 5376 KB ok, correct split
59 Correct 5 ms 5376 KB ok, correct split
60 Correct 6 ms 5376 KB ok, correct split
61 Correct 7 ms 5376 KB ok, correct split
62 Correct 6 ms 5376 KB ok, correct split
63 Correct 7 ms 5376 KB ok, correct split
64 Correct 7 ms 5376 KB ok, correct split
65 Correct 6 ms 5376 KB ok, correct split
66 Correct 4 ms 5120 KB ok, correct split
67 Correct 5 ms 5376 KB ok, correct split
68 Correct 4 ms 5120 KB ok, correct split
69 Correct 3 ms 4992 KB ok, correct split
70 Correct 5 ms 5120 KB ok, correct split
71 Correct 5 ms 5248 KB ok, correct split
72 Correct 6 ms 5248 KB ok, correct split
73 Incorrect 5 ms 5248 KB invalid split: #1=718, #2=1, #3=1681
74 Halted 0 ms 0 KB -