Submission #301588

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
301588	2020-09-18T05:04:28 Z	Namnamseo	Connecting Supertrees (IOI20_supertrees)	C++17	0 / 100	1 ms	512 KB

supertrees

#include "supertrees.h"
#include <vector>
#include <numeric>
using namespace std;
#define rep(i, n) for(int i=0; i<n; ++i)
#define pb push_back

int n;

namespace unf {
	int par[1010];
	void init() {
		iota(par, par+n, 0);
	}
	int r(int x) { return (x==par[x]) ? x : (par[x]=r(par[x])); }
	void join(int a, int b) {
		a = r(a); b = r(b);
		if (a == b) return;
		par[a] = b;
	}
	bool same(int a, int b) { return r(a) == r(b); }
};
using namespace unf;

vector<int> g[1010];

int ans[1010][1010];
int gp[1010];
int rg(int x) { return (gp[x] == x) ? x : (gp[x] = rg(gp[x])); }
vector<int> go[1010];
int work(int gi, auto &p) {
	auto &v = g[gi];

	if (v.size() == 1u) return 1;

	for(int x:v) gp[x] = x;
	vector<int> v1;
	for(int x:v) {
		bool ok = 0;
		for(int y:v) if (p[x][y] == 1) gp[rg(x)] = rg(y), ok = 1;
		if (ok) v1.pb(x);
	}

	for(int x:v1) go[rg(x)].pb(x);
	for(int x:v1) if (gp[x] == x) {
		auto &t = go[x];
		int gs = t.size();
		for(int i=0; i+1<gs; ++i) {
			ans[t[i]][t[i+1]] = 1;
			ans[t[i+1]][t[i]] = 1;
		}
		for(int a:t) for(int b:t) if (p[a][b] != 1) return 0;
	}
	vector<int> cyc;
	for(int x:v) if (!gp[x] || gp[x] == x) cyc.pb(x);
	for(int i=0, s=cyc.size(); i<s-1; ++i) ans[cyc[i]][cyc[i+1]] = ans[cyc[i+1]][cyc[i]] = 1;
	ans[cyc[0]][cyc.back()] = ans[cyc.back()][cyc[0]] = 1;

	return 1;
}

int construct(vector<vector<int>> p) {
	n = p.size();

	unf::init();

	rep(i, n) rep(j, n) if (p[i][j]) { if (p[i][j] == 3) return 0; join(i, j); }
	rep(i, n) rep(j, n) if (same(i, j) != !!p[i][j]) return 0;

	rep(i, n) g[r(i)].pb(i);

	rep(i, n) if (par[i] == i) if (!work(i, p)) return 0;

	rep(i, n) rep(j, n) p[i][j] = ans[i][j];
	build(p);

	return 1;
}

Compilation message

supertrees.cpp:31:18: warning: use of 'auto' in parameter declaration only available with '-fconcepts'
   31 | int work(int gi, auto &p) {
      |                  ^~~~

Subtask #1
0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Incorrect	1 ms	384 KB	b[1][1] is not 0
3	Halted	0 ms	0 KB	-

Subtask #2
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Incorrect	1 ms	384 KB	b[1][1] is not 0
3	Halted	0 ms	0 KB	-

Subtask #3
0 / 19.0

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