Submission #1245107

#	Time	Username	Problem	Language	Result	Execution time	Memory
1245107		nicolo_010	Fountain Parks (IOI21_parks)	C++20	5 / 100	40 ms	8260 KiB

parks

#include <bits/stdc++.h>
#include "parks.h"
using namespace std;
template <typename T>
using v = vector<T>;
using pii = pair<int, int>;
#define rep(i, k, n) for (int i = k; i < n; i++)

int construct_roads(v<int> x, v<int> y) {
	int n = x.size();
	v<pii> ys(n);
	rep(i, 0, n) ys[i] = {y[i], i};
	sort(ys.begin(), ys.end());
	v<int> a(n-1), b(n-1);
	v<int> fa(n-1), fb(n-1);
	bool can = true;
	rep(i, 0, n-1) {
		a[i] = ys[i].second;
		b[i] = ys[i+1].second;
		if (ys[i+1].first-ys[i].first != 2) can = false;
		fa[i] = 1;
		fb[i] = ys[i].first+1;
	}
	if (can ==  false) return 0;
	build(a, b, fa, fb);
	return 1;
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 10
• Subtask 3: 0 / 15
• Subtask 4: 0 / 20
• Subtask 5: 0 / 20
• Subtask 6: 0 / 30