Submission #33815

#	Time	Username	Problem	Language	Result	Execution time	Memory
33815		mohammad_kilani	Simurgh (IOI17_simurgh)	C++14	0 / 100	0 ms	2024 KiB

simurgh

#include "simurgh.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> r , ans , u , v;
int n , m;
void calc(int i){
	if(r.size() >= n) return;
	if(i == m){
		if(r.size() < n -1) return;
		bool can[10] = {0};
		for(int i=0;i<r.size();i++){
			can[u[r[i]]] = 1;
			can[v[r[i]]] = 1;
		}
		for(int i=0;i<n;i++) if(can[i] == false) return;
		int cur = count_common_roads(r);
		if(cur == n-1){
			ans = r;
		}
		return ;
	}
	r.push_back(i);
	calc(i+1);
	r.pop_back();
	calc(i+1);
}

std::vector<int> find_roads(int N, std::vector<int> U, std::vector<int> V) {
	u = U;
	v = V;
	n = N;
	m = u.size();
	r.clear();
	calc(0);
	return ans;
}

Compilation message (stderr)

simurgh.cpp: In function 'void calc(int)':
simurgh.cpp:7:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if(r.size() >= n) return;
              ^
simurgh.cpp:9:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(r.size() < n -1) return;
               ^
simurgh.cpp:11:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0;i<r.size();i++){
                ^

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