Submission #1228289

#	Time	Username	Problem	Language	Result	Execution time	Memory
1228289		Ludissey	Connecting Supertrees (IOI20_supertrees)	C++20	Compilation error	0 ms	0 KiB

supertrees

#include "supertrees.h"
#include <bits/stdc++.h>
 
using namespace std;
 
#define all(a) (a.begin(), a.end())
#define sz(a) (int)a.size()

int n;

int construct(std::vector<std::vector<int>> p) {
	n=sz(p);
	vector<vector<int>> groups;
	vector<int> id(n);
	for (int i = 0; i < n; i++)
	{
		int g=-1;
		for (int j = 0; j < i; j++)
		{
			if(p[i][j]>=1) {
				if(g>-1&&id[j]!=g) return 0;
				g=id[j]; 
			}
		}
		if(g==-1) { groups.push_back({i}); id[i]=sz(groups)-1; }
		else {
			id[i]=g;
			groups[g].push_back(i);
		}
	}
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < n; j++)
		{
			if((bool)p[i][j]!=(bool)(id[i]==id[j])) return 0;
		}
	}
	vector<vector<int>> bridge(n,vector<int>(n));
	/*for (int i = 0; i < sz(groups); i++)
	{
		for (int j = 1; j < sz(groups[i]); j++)
		{
			bridge[groups[i][j-1]][groups[i][j]]=bridge[groups[i][j]][groups[i][j-1]]=1;
		}
	}*/

	for (int i = 0; i < sz(groups); i++)
	{
		if(sz(groups[i])==1) continue;
		set<int> al;
		for (int j = 0; j < sz(groups[i]); j++)
		{
			int sm=0;
			for (int k = 0; k < sz(groups[i]); k++)
			{
				if(j==k) continue;
				if(p[groups[i][j]][groups[i][k]]==2) sm++;
			}
			if(sm==sz(groups[i])-1) al.insert(groups[i][j]);
		}
		for (int j = 0; j < sz(groups[i]); j++)
		{
			if(al.find(groups[i][j])!=al.end()) continue;
			int sm=0;
			for (int k = 0; k < sz(groups[i]); k++)
			{
				if(j==k) continue;
				if(p[groups[i][j]][groups[i][k]]==2&&al.find(groups[i][k])=al.end()) return 0; 
			}
		}
		int prev=-1;
		for (int j = 0; j < sz(groups[i]); j++)
		{
			if(al.find(groups[i][j])!=al.end()) continue;
			if(prev!=-1) bridge[prev][groups[i][j]]=bridge[groups[i][j]][prev]=1;
			prev=groups[i][j];
		}
		if(sz(al)==1) return 0;
		if(sz(al)==2&&sz(groups[i])==2) return 0;
		if(sz(al)>0){
			if(prev==-1) bridge[*al.begin()][*al.rbegin()]=bridge[*al.rbegin()][*al.begin()]=1;
			else bridge[prev][*(al.rbegin())]=bridge[*(al.rbegin())][prev]=1;
		}
		for (auto u : al)
		{
			if(prev!=-1) bridge[prev][u]=bridge[u][prev]=1;
			prev=u;
		}
	}
	build(bridge);		
	return 1;
}

Compilation message (stderr)

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:68:68: error: no match for 'operator&&' (operand types are 'bool' and 'std::set<int>::iterator' {aka 'std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::const_iterator'})
   68 |                                 if(p[groups[i][j]][groups[i][k]]==2&&al.find(groups[i][k])=al.end()) return 0;
      |                                                                    ^~~~~~~~~~~~~~~~~~~~~~~
      |                                                                             |
      |                                                                             std::set<int>::iterator {aka std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::const_iterator}
supertrees.cpp:68:68: note: candidate: 'operator&&(bool, bool)' (built-in)
   68 |                                 if(p[groups[i][j]][groups[i][k]]==2&&al.find(groups[i][k])=al.end()) return 0;
supertrees.cpp:68:68: note:   no known conversion for argument 2 from 'std::set<int>::iterator' {aka 'std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::const_iterator'} to 'bool'
In file included from /usr/include/c++/11/valarray:603,
                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:95,
                 from supertrees.cpp:2:
/usr/include/c++/11/bits/valarray_after.h:415:5: note: candidate: 'template<class _Dom1, class _Dom2> std::_Expr<std::__detail::_BinClos<std::__logical_and, std::_Expr, std::_Expr, _Dom1, _Dom2>, typename std::__fun<std::__logical_and, typename _Dom1::value_type>::result_type> std::operator&&(const std::_Expr<_Dom1, typename _Dom1::value_type>&, const std::_Expr<_Dom2, typename _Dom2::value_type>&)'
  415 |     _DEFINE_EXPR_BINARY_OPERATOR(&&, struct std::__logical_and)
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/11/bits/valarray_after.h:415:5: note:   template argument deduction/substitution failed:
supertrees.cpp:68:90: note:   mismatched types 'const std::_Expr<_Dom1, typename _Dom1::value_type>' and 'bool'
   68 |                                 if(p[groups[i][j]][groups[i][k]]==2&&al.find(groups[i][k])=al.end()) return 0;
      |                                                                                          ^
In file included from /usr/include/c++/11/valarray:603,
                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:95,
                 from supertrees.cpp:2:
/usr/include/c++/11/bits/valarray_after.h:415:5: note: candidate: 'template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__logical_and, std::_Expr, std::_Constant, _Dom, typename _Dom::value_type>, typename std::__fun<std::__logical_and, typename _Dom1::value_type>::result_type> std::operator&&(const std::_Expr<_Dom1, typename _Dom1::value_type>&, const typename _Dom::value_type&)'
  415 |     _DEFINE_EXPR_BINARY_OPERATOR(&&, struct std::__logical_and)
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/11/bits/valarray_after.h:415:5: note:   template argument deduction/substitution failed:
supertrees.cpp:68:90: note:   mismatched types 'const std::_Expr<_Dom1, typename _Dom1::value_type>' and 'bool'
   68 |                                 if(p[groups[i][j]][groups[i][k]]==2&&al.find(groups[i][k])=al.end()) return 0;
      |                                                                                          ^
In file included from /usr/include/c++/11/valarray:603,
                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:95,
                 from supertrees.cpp:2:
/usr/include/c++/11/bits/valarray_after.h:415:5: note: candidate: 'template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__logical_and, std::_Constant, std::_Expr, typename _Dom::value_type, _Dom>, typename std::__fun<std::__logical_and, typename _Dom1::value_type>::result_type> std::operator&&(const typename _Dom::value_type&, const std::_Expr<_Dom1, typename _Dom1::value_type>&)'
  415 |     _DEFINE_EXPR_BINARY_OPERATOR(&&, struct std::__logical_and)
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/11/bits/valarray_after.h:415:5: note:   template argument deduction/substitution failed:
supertrees.cpp:68:90: note:   'std::set<int>::iterator' {aka 'std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::const_iterator'} is not derived from 'const std::_Expr<_Dom1, typename _Dom1::value_type>'
   68 |                                 if(p[groups[i][j]][groups[i][k]]==2&&al.find(groups[i][k])=al.end()) return 0;
      |                                                                                          ^
In file included from /usr/include/c++/11/valarray:603,
                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:95,
                 from supertrees.cpp:2:
/usr/include/c++/11/bits/valarray_after.h:415:5: note: candidate: 'template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__logical_and, std::_Expr, std::_ValArray, _Dom, typename _Dom::value_type>, typename std::__fun<std::__logical_and, typename _Dom1::value_type>::result_type> std::operator&&(const std::_Expr<_Dom1, typename _Dom1::value_type>&, const std::valarray<typename _Dom::value_type>&)'
  415 |     _DEFINE_EXPR_BINARY_OPERATOR(&&, struct std::__logical_and)
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/11/bits/valarray_after.h:415:5: note:   template argument deduction/substitution failed:
supertrees.cpp:68:90: note:   mismatched types 'const std::_Expr<_Dom1, typename _Dom1::value_type>' and 'bool'
   68 |                                 if(p[groups[i][j]][groups[i][k]]==2&&al.find(groups[i][k])=al.end()) return 0;
      |                                                                                          ^
In file included from /usr/include/c++/11/valarray:603,
                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:95,
                 from supertrees.cpp:2:
/usr/include/c++/11/bits/valarray_after.h:415:5: note: candidate: 'template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__logical_and, std::_ValArray, std::_Expr, typename _Dom::value_type, _Dom>, typename std::__fun<std::__logical_and, typename _Dom1::value_type>::result_type> std::operator&&(const std::valarray<typename _Dom::value_type>&, const std::_Expr<_Dom1, typename _Dom1::value_type>&)'
  415 |     _DEFINE_EXPR_BINARY_OPERATOR(&&, struct std::__logical_and)
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/11/bits/valarray_after.h:415:5: note:   template argument deduction/substitution failed:
supertrees.cpp:68:90: note:   'std::set<int>::iterator' {aka 'std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::const_iterator'} is not derived from 'const std::_Expr<_Dom1, typename _Dom1::value_type>'
   68 |                                 if(p[groups[i][j]][groups[i][k]]==2&&al.find(groups[i][k])=al.end()) return 0;
      |                                                                                          ^
In file included from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:95,
                 from supertrees.cpp:2:
/usr/include/c++/11/valarray:1196:1: note: candidate: 'template<class _Tp> std::_Expr<std::__detail::_BinClos<std::__logical_and, std::_ValArray, std::_ValArray, _Tp, _Tp>, typename std::__fun<std::__logical_and, _Tp>::result_type> std::operator&&(const std::valarray<_Tp>&, const std::valarray<_Tp>&)'
 1196 | _DEFINE_BINARY_OPERATOR(&&, __logical_and)
      | ^~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/11/valarray:1196:1: note:   template argument deduction/substitution failed:
supertrees.cpp:68:90: note:   mismatched types 'const std::valarray<_Tp>' and 'bool'
   68 |                                 if(p[groups[i][j]][groups[i][k]]==2&&al.find(groups[i][k])=al.end()) return 0;
      |                                                                                          ^
In file included from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:95,
                 from supertrees.cpp:2:
/usr/include/c++/11/valarray:1196:1: note: candidate: 'template<class _Tp> std::_Expr<std::__detail::_BinClos<std::__logical_and, std::_ValArray, std::_Constant, _Tp, _Tp>, typename std::__fun<std::__logical_and, _Tp>::result_type> std::operator&&(const std::valarray<_Tp>&, const typename std::valarray<_Tp>::value_type&)'
 1196 | _DEFINE_BINARY_OPERATOR(&&, __logical_and)
      | ^~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/11/valarray:1196:1: note:   template argument deduction/substitution failed:
supertrees.cpp:68:90: note:   mismatched types 'const std::valarray<_Tp>' and 'bool'
   68 |                                 if(p[groups[i][j]][groups[i][k]]==2&&al.find(groups[i][k])=al.end()) return 0;
      |                                                                                          ^
In file included from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:95,
                 from supertrees.cpp:2:
/usr/include/c++/11/valarray:1196:1: note: candidate: 'template<class _Tp> std::_Expr<std::__detail::_BinClos<std::__logical_and, std::_Constant, std::_ValArray, _Tp, _Tp>, typename std::__fun<std::__logical_and, _Tp>::result_type> std::operator&&(const typename std::valarray<_Tp>::value_type&, const std::valarray<_Tp>&)'
 1196 | _DEFINE_BINARY_OPERATOR(&&, __logical_and)
      | ^~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/11/valarray:1196:1: note:   template argument deduction/substitution failed:
supertrees.cpp:68:90: note:   'std::set<int>::iterator' {aka 'std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::const_iterator'} is not derived from 'const std::valarray<_Tp>'
   68 |                                 if(p[groups[i][j]][groups[i][k]]==2&&al.find(groups[i][k])=al.end()) return 0;
      |                                                                                          ^