oj.uz

Submission #282309

# Submission time Handle Problem Language Result Execution time Memory
282309 2020-08-24T09:36:13 Z hoanghq2004 Split the Attractions (IOI19_split) C++14
18 / 100
 168 ms 25848 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);
//            }
            paint(u, a.first, a.second);
            paint(0, b.first, b.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;
                    }
                    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

# Verdict Execution time Memory 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 3 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 129 ms 25208 KB ok, correct split
8 Correct 122 ms 22520 KB ok, correct split
9 Correct 139 ms 21752 KB ok, correct split
10 Correct 130 ms 25848 KB ok, correct split
11 Correct 127 ms 25720 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory 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 144 ms 21240 KB ok, correct split
5 Correct 104 ms 14968 KB ok, correct split
6 Correct 123 ms 25720 KB ok, correct split
7 Correct 128 ms 22264 KB ok, correct split
8 Correct 168 ms 18680 KB ok, correct split
9 Correct 117 ms 16380 KB ok, correct split
10 Correct 65 ms 13808 KB ok, correct split
11 Correct 66 ms 13808 KB ok, correct split
12 Correct 72 ms 14276 KB ok, correct split

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4992 KB ok, correct split
2 Incorrect 108 ms 14968 KB invalid split: #1=20000, #2=21840, #3=58160
3 Halted 0 ms 0 KB -

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4992 KB ok, correct split
2 Correct 4 ms 4992 KB ok, no valid answer
3 Correct 3 ms 4992 KB ok, correct split
4 Correct 4 ms 5044 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 5504 KB ok, correct split
11 Correct 4 ms 4992 KB ok, correct split
12 Correct 6 ms 5376 KB ok, correct split
13 Correct 4 ms 4992 KB ok, correct split
14 Correct 4 ms 4992 KB ok, correct split
15 Correct 4 ms 4992 KB ok, correct split
16 Correct 4 ms 4992 KB ok, correct split
17 Correct 5 ms 4992 KB ok, correct split
18 Correct 3 ms 4992 KB ok, correct split
19 Correct 4 ms 5152 KB ok, correct split
20 Correct 5 ms 5120 KB ok, correct split
21 Correct 6 ms 5376 KB ok, correct split
22 Incorrect 6 ms 5376 KB invalid split: #1=800, #2=800, #3=900
23 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# Verdict Execution time Memory 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 3 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 129 ms 25208 KB ok, correct split
8 Correct 122 ms 22520 KB ok, correct split
9 Correct 139 ms 21752 KB ok, correct split
10 Correct 130 ms 25848 KB ok, correct split
11 Correct 127 ms 25720 KB ok, correct split
12 Correct 4 ms 4992 KB ok, correct split
13 Correct 4 ms 4992 KB ok, correct split
14 Correct 4 ms 4992 KB ok, correct split
15 Correct 144 ms 21240 KB ok, correct split
16 Correct 104 ms 14968 KB ok, correct split
17 Correct 123 ms 25720 KB ok, correct split
18 Correct 128 ms 22264 KB ok, correct split
19 Correct 168 ms 18680 KB ok, correct split
20 Correct 117 ms 16380 KB ok, correct split
21 Correct 65 ms 13808 KB ok, correct split
22 Correct 66 ms 13808 KB ok, correct split
23 Correct 72 ms 14276 KB ok, correct split
24 Correct 4 ms 4992 KB ok, correct split
25 Incorrect 108 ms 14968 KB invalid split: #1=20000, #2=21840, #3=58160
26 Halted 0 ms 0 KB -