Submission #576126

#	Time	Username	Problem	Language	Result	Execution time	Memory
576126		2fat2code	Connecting Supertrees (IOI20_supertrees)	C++17	11 / 100	163 ms	25880 KiB

supertrees

#include <bits/stdc++.h>
#include "supertrees.h"
#define fr first
#define sc second
#define all(s) s.begin(), s.end()

using namespace std;

const int nmax = 1005;

int n, adj[nmax][nmax];
vector<vector<int>>ans;

void lol(){
    for(int i=1;i<=n;i++){
        vector<int>tz;
        for(int j=1;j<=n;j++){
            tz.push_back(adj[i][j]);
        }
        ans.push_back(tz);
        tz.clear();
    }
    build(ans);
}

int construct(vector<vector<int>> p) {
	n = p.size();
	for(int i=1;i<n;i++){
            adj[i][i+1] = adj[i+1][i] = 1;
	}
	lol();
	return 1;
}

• Subtask 1: 11 / 11
• Subtask 2: 0 / 10
• Subtask 3: 0 / 19
• Subtask 4: 0 / 35
• Subtask 5: 0 / 21
• Subtask 6: 0 / 4