Submission #832784

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

split

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<ll> cad[200001];
vector<ll> asd={0,1,2}; vector<ll> d;
vector<int> sol;
ll po;
ll dfs(ll node,ll p)
{

    for(auto i:cad[node])
    {
        if(i!=p)
        {
            if(dfs(i,node)== false)
                return false;
            if(sol[node]==0)
            {
                if(d[asd[po]]==0)
                {
                    po++;
                }
                sol[node]=asd[po]+1;
                d[asd[po]]--;
            }
            //cout<<node<<" "<<sol[node]<<" "<<asd[po]+1<<" "<<d[asd[po]]<<po<<"\n\n";
            if(sol[node]!=asd[po]+1 && d[asd[po]]!=0)
            {
                //cout<<"asd";
                return false;
            }

        }
    }
    if(sol[node]==0)
    {
        if(d[asd[po]]==0)
        {
            po++;
        }
        sol[node]=asd[po]+1;
        d[asd[po]]--;
    }
    return true;
}
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
    for(int i=0; i<p.size(); i++)
    {
        cad[p[i]].push_back(q[i]);
        cad[q[i]].push_back(p[i]);
    }
    do
    {
        sol.assign(n,0);
        d.clear();
        d.push_back(a);
        d.push_back(b);
        d.push_back(c);
        po=0;
        if(dfs(0,-1)==1)
        {
            return sol;
        }

    }
    while(next_permutation(asd.begin(),asd.end()));
    vector<int> no(n,0);
	return no;
}

Compilation message (stderr)

split.cpp: In function 'std::vector<int> find_split(int, int, int, int, std::vector<int>, std::vector<int>)':
split.cpp:47:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |     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