Submission #300328

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
300328	2020-09-17T05:21:58 Z	nadidadit	Connecting Supertrees (IOI20_supertrees)	C++17	0 / 100	1 ms	384 KB

supertrees

#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
 
#define all(c) ((c).begin()), ((c).end())
int construct(vector<vector<int>> p) {
	int n = p.size();
	vector<vector<int>> adj(n, vector<int>(n, 0));
	function<void(int, int)> add_edge = [&](int x, int y){
		adj[x][y] = adj[y][x] = 1;
	};
	for(int i = 0; i < n; i++){
		if(p[i][i] != 1) return 0;
		for(int j = i + 1; j < n; j++){
			if(p[i][j] != p[j][i]) return 0;
		}
	}
	for(int i=0;i<n;i++)
    {
    	for(int j=0;j<n;j++)
    	{
    		if(i-j==1 || j-i==1)
    		{
    			p[i][j]=1;
			}
		}
	}
	build(adj);
	return 1;
}

Subtask #1
0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Incorrect	1 ms	384 KB	Too few ways to get from 0 to 1, should be 1 found 0
3	Halted	0 ms	0 KB	-

Subtask #2
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Incorrect	1 ms	384 KB	Too few ways to get from 0 to 1, should be 1 found 0
3	Halted	0 ms	0 KB	-

Subtask #3
0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	1 ms	256 KB	Output is correct
3	Correct	1 ms	256 KB	Output is correct
4	Incorrect	1 ms	384 KB	Answer gives possible 1 while actual possible 0
5	Halted	0 ms	0 KB	-