Submission #559762

#	Time	Username	Problem	Language	Result	Execution time	Memory
559762		AlperenT	Connecting Supertrees (IOI20_supertrees)	C++17	Compilation error	0 ms	0 KiB

supertrees

#include "supertrees.h"
#include <bits/stdc++.h>
 
using namespace std;
 
const int N = 1000 + 5;
 
struct DSU{
	int par[N], type[N];
	set<int> nodes[N];
 
	void reset(int n){
		for(int i = 0; i < n; i++) par[i] = i, type[i] = 0, nodes[i].insert(i);
	}
 
	int setfind(int a){
		if(par[a] == a) return a;
		else return par[a] = setfind(par[a]);
	}
 
	void setunion(int a, int b){
		a = setfind(a), b = setfind(b);

		// cout << a << " " << b << "+\n";
 
		if(a != b){
			if(nodes[b].size() > nodes[a].size()) swap(a, b);
			par[b] = par[a];
			type[b] = -1;
			for(auto x : nodes[b]) nodes[a].insert(x);
			nodes[b].clear();
		}
	}
};
 
DSU dsu;
 
int construct(vector<vector<int>> graph) {
	int n = graph.size();

	for(auto i : graph){
		for(auto j : graph){
			if(j == 3) return 0;
		}
	}
 
	vector ans(n, vector(n, 0));
 
	dsu.reset(n);
 
	// finding 3 cycles
 
	set<int> curnodes;
 
	for(int i = 0; i < n; i++) curnodes.insert(i);
 
	for(int v = 0; v < n; v++){
		if(curnodes.count(v) && dsu.type[dsu.setfind(v)] == 0){
			curnodes.erase(v);

			vector<int> nodevec;
 
			for(auto u : curnodes){
				if(graph[v][u] == 3){
					bool flag = true;
 
					for(auto w : nodevec){
						if(graph[u][w] != 3) flag = false;
					}
 
					if(flag) nodevec.push_back(u);
				}
			}

			if(nodevec.size() >= 3){
				for(auto u : nodevec) dsu.setunion(v, u);
				dsu.type[dsu.setfind(v)] = 3;
				for(auto u : nodevec) curnodes.erase(u);

				vector<int> tmp;
				for(auto x : dsu.nodes[dsu.setfind(v)]) tmp.push_back(x);
	 
				for(int i = 0; i + 1 < tmp.size(); i++) ans[tmp[i]][tmp[i + 1]] = ans[tmp[i + 1]][tmp[i]] = 1;
				ans[tmp.back()][tmp.front()] = ans[tmp.front()][tmp.back()] = 1;
				ans[0][2] = ans[2][0] = 1;

				nodevec.push_back(v);

				for(auto ww : nodevec){
					vector<int> ones;

					for(int u = 0; u < n; u++){
						if(dsu.setfind(ww) != dsu.setfind(u) && dsu.type[dsu.setfind(u)] == 0){
							if(graph[ww][u] == 1){
								int typeu = dsu.type[dsu.setfind(ww)];
			 
								bool flag = true;
			 
								for(auto x : dsu.nodes[dsu.setfind(ww)]){
									for(auto y : dsu.nodes[dsu.setfind(u)]){
										if(x == ww && graph[x][y] != 1) flag = false;
										else if(x != ww && graph[x][y] != typeu) flag = false; 
									}
								}

								// cout << u << " " << flag << "\n";
			 
								if(flag){
									ones.push_back(u);
									ans[ww][u] = ans[u][ww] = 1;
								}
								else return 0;
							}
						}
					}

					for(auto u : ones){
						// cout << ww << " " << u << "*\n";
						dsu.setunion(ww, u);
					}
				}
			}
			// else curnodes.insert(v);
		}
		else curnodes.erase(v);
	}
 
	// finding 2 cycles
 
	curnodes.clear();
 
	for(int i = 0; i < n; i++) curnodes.insert(i);
 
	for(int v = 0; v < n; v++){
		if(curnodes.count(v) && dsu.type[dsu.setfind(v)] == 0){
			curnodes.erase(v);

			vector<int> nodevec;
 
			for(auto u : curnodes){
				if(graph[v][u] == 2){
					bool flag = true;
 
					for(auto w : nodevec){
						if(graph[u][w] != 2) flag = false;
					}
 
					if(flag) nodevec.push_back(u);
				}
			}

			if(nodevec.size() >= 2){
				for(auto u : nodevec) dsu.setunion(v, u);
				dsu.type[dsu.setfind(v)] = 2;
				for(auto u : nodevec) curnodes.erase(u);

				vector<int> tmp;
				for(auto x : dsu.nodes[dsu.setfind(v)]) tmp.push_back(x);
	 
				for(int i = 0; i + 1 < tmp.size(); i++) ans[tmp[i]][tmp[i + 1]] = ans[tmp[i + 1]][tmp[i]] = 1;
				ans[tmp.back()][tmp.front()] = ans[tmp.front()][tmp.back()] = 1;

				// cout << v << ": ";

				// for(auto u : nodevec) cout << u << " ";

				// cout << "\n";

				nodevec.push_back(v);

				for(auto ww : nodevec){
					vector<int> ones;

					for(int u = 0; u < n; u++){
						if(dsu.setfind(ww) != dsu.setfind(u) && dsu.type[dsu.setfind(u)] == 0){
							if(graph[ww][u] == 1){
								int typeu = dsu.type[dsu.setfind(ww)];
			 
								bool flag = true;
			 
								for(auto x : dsu.nodes[dsu.setfind(ww)]){
									for(auto y : dsu.nodes[dsu.setfind(u)]){
										if(x == ww && graph[x][y] != 1) flag = false;
										else if(x != ww && graph[x][y] != typeu) flag = false; 
									}
								}

								// cout << u << " " << flag << "\n";
			 
								if(flag){
									ones.push_back(u);
									ans[ww][u] = ans[u][ww] = 1;
								}
								else return 0;
							}
						}
					}

					for(auto u : ones){
						// cout << ww << " " << u << "*\n";
						dsu.setunion(ww, u);
					}
				}
			}
			// else curnodes.insert(v);
		}
		else curnodes.erase(v);
	}
 
	// finding 1 cycles
 
	curnodes.clear();
 
	for(int i = 0; i < n; i++) curnodes.insert(i);
 
	for(int v = 0; v < n; v++){
		if(curnodes.count(v) && dsu.type[dsu.setfind(v)] == 0){
			curnodes.erase(v);
			dsu.type[dsu.setfind(v)] = 1;

			vector<int> nodevec;
 
			for(auto u : curnodes){
				if(graph[v][u] == 1){
					bool flag = true;
 
					for(auto w : nodevec){
						if(graph[u][w] != 1) flag = false;
					}
 
					if(flag) nodevec.push_back(u);
				}
			}

			if(nodevec.size() >= 1){
				for(auto u : nodevec) dsu.setunion(v, u);
				dsu.type[dsu.setfind(v)] = 1;
				for(auto u : nodevec) curnodes.erase(u);

				vector<int> tmp;
				for(auto x : dsu.nodes[dsu.setfind(v)]) tmp.push_back(x);
	 
				for(int i = 0; i + 1 < tmp.size(); i++) ans[tmp[i]][tmp[i + 1]] = ans[tmp[i + 1]][tmp[i]] = 1;
			}
			// else curnodes.insert(v);
		}
		else curnodes.erase(v);
	}
 
	// for(int i = 0; i < n; i++){
	// 	cout << i << " " << dsu.type[i] << ": ";
	// 	for(auto v : dsu.nodes[i]) cout << v << " ";
	// 	cout << "\n";
	// }
 
	// creating edges
 
	// connecting 1 cycles to other cycles
 
	for(int v = 0; v < n; v++){
		int cnt = 0;
 
		for(int u = 0; u < n; u++){
			if(dsu.type[dsu.setfind(v)] == 1 && dsu.setfind(v) != dsu.setfind(u)){
				if(graph[v][u] == 1){
					int typeu = dsu.type[dsu.setfind(u)];
 
					bool flag = true;
 
					for(auto x : dsu.nodes[dsu.setfind(v)]){
						for(auto y : dsu.nodes[dsu.setfind(u)]){
							if(y == u && graph[x][y] != 1) flag = false;
							else if(y != u && graph[x][y] != typeu) flag = false; 
						}
					}
 
					if(flag){
						dsu.setunion(v, u);
						ans[v][u] = ans[u][v] = 1;
					}
					else return 0;
 
					cnt++;
				}
			}
		}
 
		if(cnt >= 2) return 0;
	}
 
	for(int v = 0; v < n; v++){
		for(int u = 0; u < n; u++){
			if(dsu.setfind(v) != dsu.setfind(u) && graph[v][u] != 0) return 0;
		}
	}
 
	build(ans);
	return 1;
}

// int main(){
// 	construct({{1, 2, 1, 2, 2, 2, 1}, {2, 1, 2, 1, 2, 2, 2}, {1, 2, 1, 2, 2, 2, 1}, {2, 1, 2, 1, 2, 2, 2}, {2, 2, 2, 2, 1, 1, 2}, {2, 2, 2, 2, 1, 1, 2}, {1, 2, 1, 2, 2, 2, 1}});
// }

Compilation message (stderr)

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:43:9: error: no match for 'operator==' (operand types are 'std::vector<int>' and 'int')
   43 |    if(j == 3) return 0;
      |       ~ ^~ ~
      |       |    |
      |       |    int
      |       std::vector<int>
In file included from /usr/include/c++/10/regex:62,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:110,
                 from supertrees.cpp:2:
/usr/include/c++/10/bits/regex.h:1035:5: note: candidate: 'template<class _BiIter> bool std::__cxx11::operator==(const std::__cxx11::sub_match<_BiIter>&, const std::__cxx11::sub_match<_BiIter>&)'
 1035 |     operator==(const sub_match<_BiIter>& __lhs, const sub_match<_BiIter>& __rhs)
      |     ^~~~~~~~
/usr/include/c++/10/bits/regex.h:1035:5: note:   template argument deduction/substitution failed:
supertrees.cpp:43:12: note:   'std::vector<int>' is not derived from 'const std::__cxx11::sub_match<_BiIter>'
   43 |    if(j == 3) return 0;
      |            ^
In file included from /usr/include/c++/10/regex:62,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:110,
                 from supertrees.cpp:2:
/usr/include/c++/10/bits/regex.h:1131:5: note: candidate: 'template<class _Bi_iter, class _Ch_traits, class _Ch_alloc> bool std::__cxx11::operator==(std::__cxx11::__sub_match_string<_Bi_iter, _Ch_traits, _Ch_alloc>&, const std::__cxx11::sub_match<_BiIter>&)'
 1131 |     operator==(const __sub_match_string<_Bi_iter, _Ch_traits, _Ch_alloc>& __lhs,
      |     ^~~~~~~~
/usr/include/c++/10/bits/regex.h:1131:5: note:   template argument deduction/substitution failed:
supertrees.cpp:43:12: note:   'std::vector<int>' is not derived from 'std::__cxx11::__sub_match_string<_Bi_iter, _Ch_traits, _Ch_alloc>'
   43 |    if(j == 3) return 0;
      |            ^
In file included from /usr/include/c++/10/regex:62,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:110,
                 from supertrees.cpp:2:
/usr/include/c++/10/bits/regex.h:1206:5: note: candidate: 'template<class _Bi_iter, class _Ch_traits, class _Ch_alloc> bool std::__cxx11::operator==(const std::__cxx11::sub_match<_BiIter>&, std::__cxx11::__sub_match_string<_Bi_iter, _Ch_traits, _Ch_alloc>&)'
 1206 |     operator==(const sub_match<_Bi_iter>& __lhs,
      |     ^~~~~~~~
/usr/include/c++/10/bits/regex.h:1206:5: note:   template argument deduction/substitution failed:
supertrees.cpp:43:12: note:   'std::vector<int>' is not derived from 'const std::__cxx11::sub_match<_BiIter>'
   43 |    if(j == 3) return 0;
      |            ^
In file included from /usr/include/c++/10/regex:62,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:110,
                 from supertrees.cpp:2:
/usr/include/c++/10/bits/regex.h:1298:5: note: candidate: 'template<class _Bi_iter> bool std::__cxx11::operator==(const typename std::iterator_traits<_Iter>::value_type*, const std::__cxx11::sub_match<_BiIter>&)'
 1298 |     operator==(typename iterator_traits<_Bi_iter>::value_type const* __lhs,
      |     ^~~~~~~~
/usr/include/c++/10/bits/regex.h:1298:5: note:   template argument deduction/substitution failed:
supertrees.cpp:43:12: note:   mismatched types 'const std::__cxx11::sub_match<_BiIter>' and 'int'
   43 |    if(j == 3) return 0;
      |            ^
In file included from /usr/include/c++/10/regex:62,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:110,
                 from supertrees.cpp:2:
/usr/include/c++/10/bits/regex.h:1373:5: note: candidate: 'template<class _Bi_iter> bool std::__cxx11::operator==(const std::__cxx11::sub_match<_BiIter>&, const typename std::iterator_traits<_Iter>::value_type*)'
 1373 |     operator==(const sub_match<_Bi_iter>& __lhs,
      |     ^~~~~~~~
/usr/include/c++/10/bits/regex.h:1373:5: note:   template argument deduction/substitution failed:
supertrees.cpp:43:12: note:   'std::vector<int>' is not derived from 'const std::__cxx11::sub_match<_BiIter>'
   43 |    if(j == 3) return 0;
      |            ^
In file included from /usr/include/c++/10/regex:62,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:110,
                 from supertrees.cpp:2:
/usr/include/c++/10/bits/regex.h:1466:5: note: candidate: 'template<class _Bi_iter> bool std::__cxx11::operator==(const typename std::iterator_traits<_Iter>::value_type&, const std::__cxx11::sub_match<_BiIter>&)'
 1466 |     operator==(typename iterator_traits<_Bi_iter>::value_type const& __lhs,
      |     ^~~~~~~~
/usr/include/c++/10/bits/regex.h:1466:5: note:   template argument deduction/substitution failed:
supertrees.cpp:43:12: note:   mismatched types 'const std::__cxx11::sub_match<_BiIter>' and 'int'
   43 |    if(j == 3) return 0;
      |            ^
In file included from /usr/include/c++/10/regex:62,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:110,
                 from supertrees.cpp:2:
/usr/include/c++/10/bits/regex.h:1545:5: note: candidate: 'template<class _Bi_iter> bool std::__cxx11::operator==(const std::__cxx11::sub_match<_BiIter>&, const typename std::iterator_traits<_Iter>::value_type&)'
 1545 |     operator==(const sub_match<_Bi_iter>& __lhs,
      |     ^~~~~~~~
/usr/include/c++/10/bits/regex.h:1545:5: note:   template argument deduction/substitution failed:
supertrees.cpp:43:12: note:   'std::vector<int>' is not derived from 'const std::__cxx11::sub_match<_BiIter>'
   43 |    if(j == 3) return 0;
      |            ^
In file included from /usr/include/c++/10/regex:62,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:110,
                 from supertrees.cpp:2:
/usr/include/c++/10/bits/regex.h:2101:5: note: candidate: 'template<class _Bi_iter, class _Alloc> bool std::__cxx11::operator==(const std::__cxx11::match_results<_BiIter, _Alloc>&, const std::__cxx11::match_results<_BiIter, _Alloc>&)'
 2101 |     operator==(const match_results<_Bi_iter, _Alloc>& __m1,
      |     ^~~~~~~~
/usr/include/c++/10/bits/regex.h:2101:5: note:   template argument deduction/substitution failed:
supertrees.cpp:43:12: note:   'std::vector<int>' is not derived from 'const std::__cxx11::match_results<_BiIter, _Alloc>'
   43 |    if(j == 3) return 0;
      |            ^
In file included from /usr/include/c++/10/bits/stl_algobase.h:64,
                 from /usr/include/c++/10/vector:60,
                 from supertrees.h:1,
                 from supertrees.cpp:1:
/usr/include/c++/10/bits/stl_pair.h:466:5: note: candidate: 'template<class _T1, class _T2> constexpr bool std::operator==(const std::pair<_T1, _T2>&, const std::pair<_T1, _T2>&)'
  466 |     operator==(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
      |     ^~~~~~~~
/usr/include/c++/10/bits/stl_pair.h:466:5: note:   template argument deduction/substitution failed:
supertrees.cpp:43:12: note:   'std::vector<int>' is not derived from 'const std::pair<_T1, _T2>'
   43 |    if(j == 3) return 0;
      |            ^
In file included from /usr/include/c++/10/bits/stl_algobase.h:67,
                 from /usr/include/c++/10/vector:60,
                 from supertrees.h:1,
                 from supertrees.cpp:1:
/usr/include/c++/10/bits/stl_iterator.h:360:5: note: candidate: 'template<class _Iterator> constexpr bool std::operator==(const std::reverse_iterator<_Iterator>&, const std::reverse_iterator<_Iterator>&)'
  360 |     operator==(const reverse_iterator<_Iterator>& __x,
      |     ^~~~~~~~
/usr/include/c++/10/bits/stl_iterator.h:360:5: note:   template argument deduction/substitution failed:
supertrees.cpp:43:12: note:   'std::vector<int>' is not derived from 'const std::reverse_iterator<_Iterator>'
   43 |    if(j == 3) return 0;
      |            ^
In file included from /usr/include/c++/10/bits/stl_algobase.h:67,
                 from /usr/include/c++/10/vector:60,
                 from supertrees.h:1,
                 from supertrees.cpp:1:
/usr/include/c++/10/bits/stl_iterator.h:398:5: note: candidate: 'template<class _IteratorL, class _IteratorR> constexpr bool std::operator==(const std::reverse_iterator<_Iterator>&, const std::reverse_iterator<_IteratorR>&)'
  398 |     operator==(const reverse_iterator<_IteratorL>& __x,
      |     ^~~~~~~~
/usr/include/c++/10/bits/stl_iterator.h:398:5: note:   template argument deduction/substitution failed:
supertrees.cpp:43:12: note:   'std::vector<int>' is not derived from 'const std::reverse_iterator<_Iterator>'
   43 |    if(j == 3) return 0;
      |            ^
In file included from /usr/include/c++/10/bits/stl_algobase.h:67,
                 from /usr/include/c++/10/vector:60,
                 from supertrees.h:1,
                 from supertrees.cpp:1:
/usr/include/c++/10/bits/stl_iterator.h:1427:5: note: candidate: 'template<class _IteratorL, class _IteratorR> constexpr bool std::operator==(const std::move_iterator<_IteratorL>&, const std::move_iterator<_IteratorR>&)'
 1427 |     operator==(const move_iterator<_IteratorL>& __x,
      |     ^~~~~~~~
/usr/include/c++/10/bits/stl_iterator.h:1427:5: note:   template argument deduction/substitution failed:
supertrees.cpp:43:12: note:   'std::vector<int>' is not derived from 'const std::move_iterator<_IteratorL>'
   43 |    if(j == 3) return 0;
      |            ^
In file included from /usr/include/c++/10/bits/stl_algobase.h:67,
                 from /usr/include/c++/10/vector:60,
                 from supertrees.h:1,
                 from supertrees.cpp:1:
/usr/include/c++/10/bits/stl_iterator.h:1495:5: note: candidate: 'template<class _Iterator> constexpr bool std::operator==(const std::move_iterator<_IteratorL>&, const std::move_iterator<_IteratorL>&)'
 1495 |     operator==(const move_iterator<_Iterator>& __x,
      |     ^~~~~~~~
/usr/include/c++/10/bits/stl_iterator.h:1495:5: note:   template argument deduction/substitution failed:
supertrees.cpp:43:12: note:   'std::vector<int>' is not derived from 'const std::move_iterator<_IteratorL>'
   43 |    if(j == 3) return 0;
      |            ^
In file included from /usr/include/c++/10/vector:64,
                 from supertrees.h:1,
                 from supertrees.cpp:1:
/usr/include/c++/10/bits/allocator.h:206:5: note: candidate: 'template<class _T1, class _T2> bool std::operator==(const std::allocator<_Tp1>&, const std::allocator<_T2>&)'
  206 |     operator==(const allocator<_T1>&, const allocator<_T2>&)
      |     ^~~~~~~~
/usr/include/c++/10/bits/allocator.h:206:5: note:   template argument deduction/substitution failed:
supertrees.cpp:43:12: note:   'std::vector<int>' is not derived from 'const std::allocator<_Tp1>'
   43 |    if(j == 3) return 0;
      |            ^
In file included from /usr/include/c++/10/vector:67,
                 from supertrees.h:1,
                 from supertrees.cpp:1:
/usr/include/c++/10/bits/stl_vector.h:1892:5: note: candidate: 'template<class _Tp, class _Alloc> bool std::operator==(const std::vector<_Tp, _Alloc>&, const std::vector<_Tp, _Alloc>&)'
 1892 |     operator==(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)
      |     ^~~~~~~~
/usr/include/c++/10/bits/stl_vector.h:1892:5: note:   template argument deduction/substitution failed:
supertrees.cpp:43:12: note:   mismatched types 'const std::vector<_Tp, _Alloc>' and 'int'
   43 |    if(j == 3) return 0;
      |            ^
In file included from /usr/include/c++/10/iosfwd:40,
                 from /usr/include/c++/10/ios:38,
                 from /usr/include/c++/10/istream:38,
                 from /usr/include/c++/10/sstream:38,
                 from /usr/include/c++/10/complex:45,
                 from /usr/include/c++/10/ccomplex:39,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:54,
                 from supertrees.cpp:2:
/usr/include/c++/10/bits/postypes.h:222:5: note: candidate: 'template<class _StateT> bool std::operator==(const std::fpos<_StateT>&, const std::fpos<_StateT>&)'
  222 |     operator==(const fpos<_StateT>& __lhs, const fpos<_StateT>& __rhs)
      |     ^~~~~~~~
/usr/include/c++/10/bits/postypes.h:222:5: note:   template argument deduction/substitution failed:
supertrees.cpp:43:12: note:   'std::vector<int>' is not derived from 'const std::fpos<_StateT>'
   43 |    if(j == 3) return 0;
      |            ^
In file included from /usr/include/c++/10/bits/basic_string.h:48,
                 from /usr/include/c++/10/string:55,
                 from /usr/include/c++/10/bits/locale_classes.h:40,
                 from /usr/include/c++/10/bits/ios_base.h:41,
                 from /usr/include/c++/10/ios:42,
                 from /usr/include/c++/10/istream:38,
                 from /usr/include/c++/10/sstream:38,
                 from /usr/include/c++/10/complex:45,
                 from /usr/include/c++/10/ccomplex:39,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:54,
                 from supertrees.cpp:2:
/usr/include/c++/10/string_view:490:5: note: candidate: 'template<class _CharT, class _Traits> constexpr bool std::operator==(std::basic_string_view<_CharT, _Traits>, std::basic_string_view<_CharT, _Traits>)'
  490 |     operator==(basic_string_view<_CharT, _Traits> __x,
      |     ^~~~~~~~
/usr/include/c++/10/string_view:490:5: note:   template argument deduction/substitution failed:
supertrees.cpp:43:12: note:   'std::vector<int>' is not derived from 'std::basic_string_view<_CharT, _Traits>'
   43 |    if(j == 3) return 0;
      |            ^
In file included from /usr/include/c++/10/bits/basic_string.h:48,
                 from /usr/include/c++/10/string:55,
                 from /usr/include/c++/10/bits/locale_classes.h:40,
                 from /usr/include/c++/10/bits/ios_base.h:41,
                 from /usr/include/c++/10/ios:42,
                 from /usr/include/c++/10/istream:38,
                 from /usr/include/c++/10/sstream:38,
                 from /usr/include/c++/10/complex:45,
                 from /usr/include/c++/10/ccomplex:39,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:54,
                 from supertrees.cpp:2:
/usr/include/c++/10/string_view:496:5: note: candidate: 'template<class _CharT, class _Traits> constexpr bool std::operator==(std::basic_string_view<_CharT, _Traits>, std::__type_identity_t<std::basic_string_view<_CharT, _Traits> >)'
  496 |     operator==(basic_string_view<_CharT, _Traits> __x,
      |     ^~~~~~~~
/usr/include/c++/10/string_view:496:5: note:   template argument deduction/substitution failed:
supertrees.cpp:43:12: note:   'std::vector<int>' is not derived from 'std::basic_string_view<_CharT, _Traits>'
   43 |    if(j == 3) return 0;
      |            ^
In file included from /usr/include/c++/10/bits/basic_string.h:48,
                 from /usr/include/c++/10/string:55,
                 from /usr/include/c++/10/bits/locale_classes.h:40,
                 from /usr/include/c++/10/bits/ios_base.h:41,
                 from /usr/include/c++/10/ios:42,
                 from /usr/include/c++/10/istream:38,
                 from /usr/include/c++/10/sstream:38,
                 from /usr/include/c++/10/complex:45,
                 from /usr/include/c++/10/ccomplex:39,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:54,
                 from supertrees.cpp:2:
/usr/include/c++/10/string_view:519:5: note: candidate: 'template<class _CharT, class _Traits> constexpr bool std::operator==(std::__type_identity_t<std::basic_string_view<_CharT, _Traits> >, std::basic_string_view<_CharT, _Traits>)'
  519 |     operator==(__type_identity_t<basic_string_view<_CharT, _Traits>> __x,
      |     ^~~~~~~~
/usr/include/c++/10/string_view:519:5: note:   template argument deduction/substitution failed:
supertrees.cpp:43:12: note:   mismatched types 'std::basic_string_view<_CharT, _Traits>' and 'int'
   43 |    if(j == 3) return 0;
      |            ^
In file included from /usr/include/c++/10/string:55,
                 from /usr/include/c++/10/bits/locale_classes.h:40,
                 from /usr/include/c++/10/bits/ios_base.h:41,
                 from /usr/include/c++/10/ios:42,
                 from /usr/include/c++/10/istream:38,
                 from /usr/include/c++/10/sstream:38,
                 from /usr/include/c++/10/complex:45,
                 from /usr/include/c++/10/ccomplex:39,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:54,
                 from supertrees.cpp:2:
/usr/include/c++/10/bits/basic_string.h:6153:5: note: candidate: 'template<class _CharT, class _Traits, class _Alloc> bool std::operator==(const std::__cxx11::basic_string<_CharT, _Traits, _Allocator>&, const std::__cxx11::basic_string<_CharT, _Traits, _Allocator>&)'
 6153 |     operator==(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
      |     ^~~~~~~~
/usr/include/c++/10/bits/basic_string.h:6153:5: note:   template argument deduction/substitution failed:
supertrees.cpp:43:12: note:   'std::vector<int>' is not derived from 'const std::__cxx11::basic_string<_CharT, _Traits, _Allocator>'
   43 |    if(j == 3) return 0;
      |            ^
In file included from /usr/include/c++/10/string:55,
                 from /usr/include/c++/10/bits/locale_classes.h:40,
                 from /usr/include/c++/10/bits/ios_base.h:41,
                 from /usr/include/c++/10/ios:42,
                 from /usr/include/c++/10/istream:38,
                 from /usr/include/c++/10/sstream:38,
                 from /usr/include/c++/10/complex:45,
                 from /usr/include/c++/10/ccomplex:39,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:54,
                 from supertrees.cpp:2:
/usr/include/c++/10/bits/basic_string.h:6161:5: note: candidate: 'template<class _CharT> typename __gnu_cxx::__enable_if<std::__is_char<_Tp>::__value, bool>::__type std::operator==(const std::__cxx11::basic_string<_CharT>&, const std::__cxx11::basic_string<_CharT>&)'
 6161 |     operator==(const basic_string<_CharT>& __lhs,
      |     ^~~~~~~~
/usr/include/c++/10/bits/basic_string.h:6161:5: note:   template argument deduction/substitution failed:
supertrees.cpp:43:12: note:   'std::vector<int>' is not derived from 'const std::__cxx11::basic_string<_CharT>'
   43 |    if(j == 3) return 0;
      |            ^
In file included from /usr/include/c++/10/string:55,
                 from /usr/include/c++/10/bits/locale_classes.h:40,
                 from /usr/include/c++/10/bits/ios_base.h:41,
                 from /usr/include/c++/10/ios:42,
                 from /usr