Submission #426942

#	Time	Username	Problem	Language	Result	Execution time	Memory
426942		MOUF_MAHMALAT	Simurgh (IOI17_simurgh)	C++14	0 / 100	16 ms	296 KiB

simurgh

#include "simurgh.h"
#include<bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef int ll;
vector<ll>op,v,w;
ll n,b[509];
bool is;
void best(ll d,ll cnt)
{
    if(cnt==n-1)
    {
        ll ans=count_common_roads(op);
        if(ans==n-1)
            is=1;
        return;
    }
    if(d==v.size())
        return;
    best(d+1,cnt);
    if(is||min(b[v[d]],b[w[d]]))
        return;
    b[v[d]]++,b[w[d]]++;
    op.push_back(d);
    best(d+1,cnt+1);
    if(is)
        return;
    op.pop_back();
    b[v[d]]--,b[w[d]]--;
}
vector<int> find_roads(int N, vector<int> u1, vector<int> u2)
{
    n=N;
    v=u1,w=u2;
    best(0,0);
    return op;
}

Compilation message (stderr)

simurgh.cpp: In function 'void best(ll, ll)':
simurgh.cpp:19:9: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |     if(d==v.size())
      |        ~^~~~~~~~~~

• Subtask 1: 0 / 13
• Subtask 2: 0 / 17
• Subtask 3: 0 / 21
• Subtask 4: 0 / 19
• Subtask 5: 0 / 30