Submission #300360

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
300360	2020-09-17T05:51:52 Z	nadidadit	Connecting Supertrees (IOI20_supertrees)	C++17	0 / 100	1 ms	256 KB

supertrees

#include "supertrees.h"
#include <bits/stdc++.h>
#define fi first
#define se second
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define rmin(r, x) r = min(r, x)
#define rmax(r, x) r = max(r, x)
#define ends ' '
#define endl '\n'
#define fastio ios_base::sync_with_stdio(0), cin.tie(0)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 
const int maxn = 1e3 + 10;
 
int n;
vector<vector<int>> b;
 
int construct(vector<std::vector<int>> p) {
	n = p.size();
	b.resize(n);
	for(int i = 0; i < n; ++i)	b[i].resize(n);
	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(b);
	return 1;
}

Subtask #1
0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Incorrect	1 ms	256 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	256 KB	Output is correct
2	Incorrect	1 ms	256 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	256 KB	Output is correct
2	Correct	1 ms	256 KB	Output is correct
3	Correct	0 ms	256 KB	Output is correct
4	Incorrect	0 ms	256 KB	Answer gives possible 1 while actual possible 0
5	Halted	0 ms	0 KB	-