Submission #788947

#	Time	Username	Problem	Language	Result	Execution time	Memory
788947		YassirSalama	Simurgh (IOI17_simurgh)	C++14	0 / 100	1 ms	212 KiB

simurgh

#include "simurgh.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define all(v) v.begin(),v.end()
#define F first
#define S second
#define OVL(v,s) for(auto x:s) cout<<x<<s;cout<<endl;
const int MAXN=10;
vector<int> ans;
vector<pair<int,int>> edges;
vector<int> par(MAXN+100,0);
int find(int node){
	if(node==par[node]) return node;
	return par[node]=find(par[node]);
}
void make_set(){
	for(int i=0;i<MAXN+100;i++) par[i]=i;
}
int N,M;
bool search(int i){
	if(i==edges.size()) {
		if(ans.size()==N-1){
			if(count_common_roads(ans)==N-1) {
				// for(auto x:ans) cout<<x<<endl;
				return true;
			}
			return false;
		}
		else return false;
	}
	pair<int,int> p=edges[i];
	int a=p.F,b=p.S;
	int A=find(a);
	int B=find(b);
	if(search(i+1)) return true;//without adding that edge
	else if(A!=B){
		//here if we add that edge connect a o b then add the edge o ila makanch ndeconnectiwhum
		//heere nakhdu edge i njrbu bih sinon manakhduhch
		//atkun 2^n possibilité cause take or not take
		par[B]=A;
		ans.push_back(i);
		bool c=search(i+1);
		par[B]=B;
		if(c) return true;
		ans.pop_back();
		// return false;
	}
	return false;
}

vector<int> find_roads(int n, vector<int> u, vector<int> c) {
	M=u.size();
	N=n;
	make_set();
	ans=vector<int>(0);
	for(int i=0;i<M;i++){
		edges.push_back({u[i],c[i]});
	}
	search(0);
	return ans; 

}

Compilation message (stderr)

simurgh.cpp: In function 'bool search(int)':
simurgh.cpp:22:6: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |  if(i==edges.size()) {
      |     ~^~~~~~~~~~~~~~
simurgh.cpp:23:16: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   23 |   if(ans.size()==N-1){
      |      ~~~~~~~~~~^~~~~

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