Submission #302185

#	Time	Username	Problem	Language	Result	Execution time	Memory
302185		Bitmasking	Connecting Supertrees (IOI20_supertrees)	C++14	Compilation error	0 ms	0 KiB

supertrees

#include <bits/stdc++.h>
 
#define f(i,a,b) for( ll i = a; i < b ; i++ )
#define af(i,a,b) for( ll i = a; i >= b ; i--)
#define rep(i,a,b,k) for(ll i = a; i < b ; i+= k )
#define arep(i,a,b,k) for( ll i = a; i >= b ; i-= k)
#define ones(x) (ll) __builtin_popcount(x)
#define fs first
#define sc second
#define pb push_back
#define po pop_back
#define mp make_pair 
#define sz(a) (ll) a.size()
#define all(a) a.begin(), a.end()
#define sor(a) sort( a.begin(), a.end() )
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ller ios::sync_with_stdio(false);cin.tsie(nullptr);cout.tie(nullptr)
#define watch(x) cout << (#x) << " is " << (x) <<"\n"
#define PI 3.1415926535
using namespace std;
typedef long long ll;
typedef long double ld; 
typedef pair<ll,ll> ii ;
typedef vector<ll>  vi ;
typedef vector<ii> vii ;
const ll mod = 1e9;
const ll MAX = 1e3+10;
const ll inf = 1e18+7;
ll n;
int p[MAX][MAX];
int b[MAX][MAX];
int construct(){
	return 1;
}
void build(){
	f(i,0,n-1){
		b[i][i+1]=1;
	}
	f(i,0,n){
		f(j,0,n){
			cout<<b[i][j]<<" ";
		}
		cout<<"\n";
	}
}
int main(){
	fastio;
	cin>>n;


	f(i,0,n){
		f(j,0,n){
			cin>>p[i][j];
		}
	}

	cout<<construct()<<"\n";
	if(construct()){
		build();
	}
    return 0; 
}

Compilation message (stderr)

/tmp/cchG2nQA.o: In function `main':
grader.cpp:(.text.startup+0x0): multiple definition of `main'
/tmp/cch1GakJ.o:supertrees.cpp:(.text.startup+0x0): first defined here
/tmp/cchG2nQA.o: In function `main':
grader.cpp:(.text.startup+0x3a2): undefined reference to `construct(std::vector<std::vector<int, std::allocator<int> >, std::allocator<std::vector<int, std::allocator<int> > > >)'
collect2: error: ld returned 1 exit status