#include <bits/stdc++.h> #include "supertrees.h" using namespace std; #define pb push_back const int N=1050; vector<int> E[N]; vector<vector<int>> p; void AddEdge(int u,int v){E[u].pb(v);E[v].pb(u);} vector<int> Euler; bool was[N]; void DFS1(int u){ was[u]=true,Euler.pb(u); for(int v:E[u])if(!was[v]&&p[u][v]==1)DFS1(v); } int construct(vector<vector<int>> P){ p=P;int n=(int)P.size(); bool one=false,two=false; for(int i=0;i<n;i++)for(int j=0;j<n;j++)if(p[i][j]==1)one=true; for(int i=0;i<n;i++)for(int j=0;j<n;j++)if(p[i][j]==2)two=true; int ans[n][n]; if(!one&&!two){build(ans);return 1;} if(one&&!two){ for(int i=0;i<n;i++){ if(!was[i]){ DFS1(i); if((int)Euler.size()==1)continue; for(int x:Euler)for(int y:Euler)if(x!=y&&p[x][y]==0)return 0; for(int i=1;i<(int)Euler.size();i++){ int x=Euler[i],y=Euler[i-1]; ans[x][y]=ans[y][x]=1; } Euler.clear(); } } build(ans); return 1; } }

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:21:23: error: could not convert '(int (*)[n])(& ans)' from 'int (*)[n]' to 'std::vector<std::vector<int> >'
   21 |  if(!one&&!two){build(ans);return 1;}
      |                       ^~~
      |                       |
      |                       int (*)[n]
supertrees.cpp:35:9: error: could not convert '(int (*)[n])(& ans)' from 'int (*)[n]' to 'std::vector<std::vector<int> >'
   35 |   build(ans);
      |         ^~~
      |         |
      |         int (*)[n]
supertrees.cpp:38:1: warning: control reaches end of non-void function [-Wreturn-type]
   38 | }
      | ^