Submission #608558

#	Time	Username	Problem	Language	Result	Execution time	Memory
608558		Hanksburger	Split the Attractions (IOI19_split)	C++17	0 / 100	585 ms	1048576 KiB

split

#include "split.h"
#include <bits/stdc++.h>
using namespace std;
int sz[100005], x[100005], node, cnt;
vector<int> adj[100005], ans;
void dfs(int u, int p)
{
    sz[u]=1;
    for (int v:adj[u])
    {
        if (v!=p)
        {
            dfs(v, u);
            sz[u]+=sz[v];
        }
    }
    x[sz[u]]=u;
}
void dfs2(int u, int p, bool b)
{
    if (b)
    {
        ans[u]=1;
        cnt--;
    }
    if (cnt)
    {
        for (int v:adj[u])
        {
            if (v!=p)
            {
                dfs2(v, u, b|(v==node));
                if (!cnt)
                    break;
            }
        }
    }
}
void dfs3(int u, int p)
{
    ans[u]=2;
    cnt--;
    if (cnt)
    {
        for (int v:adj[u])
        {
            if (v!=p && ans[v]==3)
            {
                dfs3(v, u);
                if (!cnt)
                    break;
            }
        }
    }
}
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q)
{
    int swapped=0;
    if (a>=b && a>=c)
    {
        swap(a, c);
        swapped=1;
    }
    else if (b>=a && b>=c)
    {
        swap(b, c);
        swapped=2;
    }
    for (int i=0; i<p.size(); i++)
    {
        adj[p[i]].push_back(q[i]);
        adj[q[i]].push_back(p[i]);
    }
    for (int z=0; z<2; z++)
    {
        for (int i=1; i<=n; i++)
            x[i]=-1;
        dfs(0, 0);
        int ind=a;
        while (x[ind]==-1)
            ind++;
        if (ind+b<=n)
        {
            node=x[ind];
            for (int i=0; i<n; i++)
                ans.push_back(3);
            cnt=a;
            dfs2(0, 0, 0);
            cnt=b;
            dfs3(0, 0);
            if (swapped==1)
            {
                for (int i=0; i<n; i++)
                    ans[i]=4-ans[i];
            }
            else if (swapped==2)
            {
                for (int i=0; i<n; i++)
                    ans[i]=(ans[i]==1)?1:(5-ans[i]);
            }
            if (z)
            {
                for (int i=0; i<n; i++)
                    ans[i]=(ans[i]==3)?3:(3-ans[i]);
            }
            return ans;
        }
        swap(a, b);
    }
    for (int i=0; i<n; i++)
        ans.push_back(0);
    return ans;
}

Compilation message (stderr)

split.cpp: In function 'std::vector<int> find_split(int, int, int, int, std::vector<int>, std::vector<int>)':
split.cpp:69:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |     for (int i=0; i<p.size(); i++)
      |                   ~^~~~~~~~~

• Subtask 1: 0 / 7
• Subtask 2: 0 / 11
• Subtask 3: 0 / 22
• Subtask 4: 0 / 24
• Subtask 5: 0 / 36