Submission #629735

#	Time	Username	Problem	Language	Result	Execution time	Memory
629735		hy_1	Keys (IOI21_keys)	C++17	0 / 100	19 ms	28884 KiB

keys

#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <cmath>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <unordered_map>
   
using namespace std;


const int mx = 300005;


 
void find_reachable(vector<int> r, vector<int> u, vector<int> v, vector<int> c) {

	//Graph implementatiom
	vector<vector<pair<int , int > > > adj(mx);
	for(int i=0; i <u.size(); i++){
		pair<int, int> vv;
		vv.first = v[i];
		vv.second = c[i];
		adj[u[i]].push_back(vv);
		vv.first = u[i];
		vv.second = c[i];
		adj[v[i]].push_back(vv);
	}
	//BFS
	
	vector<int> conected(r.size());
	vector<vector<int> > hash(mx);

	for(int j = 0; j<r.size(); j++){

		vector<bool> visited( mx, false);
		int source = j;
		queue<int> qu;
		qu.push(source);
		int cnt= 0;
		hash[source].push_back(r[source]);
		
		while(!qu.empty()){
			int cur = qu.front();
			qu.pop();
			visited[cur] = true;
			cnt += 1;
			// cout << 1 << " ";
			for(pair<int , int > i : adj[cur]){
				if(count(hash[source].begin() , hash[source].end() , i.second) != 0 && visited[i.first] == false){
					hash[source].push_back(r[i.first]);
					visited[i.first] = true;
					qu.push(i.first);
				}
			}
		}
		conected[j] = cnt;
	}
	vector<int> ans(r.size() , 0);
	int uu = *min_element(conected.begin() , conected.end());
	for(int i=0; i<r.size(); i++){
		if(conected[i] == uu) ans[i] = 1;
	}
	for(int i : ans)cout << i << " ";
	cout << endl;
}




/*

#1
4
0 1 1 2
5
0 0 1 1 3
1 2 2 3 1
0 0 1 0 2

2 1
0 0
0 1 0


#2
3
0 0 0
1
0
1
0

#3
7
0 1 1 2 2 1 2
10
0 0 1 1 2 3 3 4 4 5
1 2 2 3 3 4 5 5 6 6
0 0 1 0 0 1 2 0 2 1

*/

Compilation message (stderr)

keys.cpp: In function 'void find_reachable(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
keys.cpp:48:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |  for(int i=0; i <u.size(); i++){
      |               ~~^~~~~~~~~
keys.cpp:62:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |  for(int j = 0; j<r.size(); j++){
      |                 ~^~~~~~~~~
keys.cpp:89:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   89 |  for(int i=0; i<r.size(); i++){
      |               ~^~~~~~~~~

• Subtask 1: 0 / 9
• Subtask 2: 0 / 11
• Subtask 3: 0 / 17
• Subtask 4: 0 / 30
• Subtask 5: 0 / 33