제출 #894825

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
894825		Faisal_Saqib	Fountain Parks (IOI21_parks)	C++17	5 / 100	69 ms	15868 KiB

parks

#include <vector>
#include <algorithm>
using namespace std;
void build(std::vector<int> u, std::vector<int> v, std::vector<int> a, std::vector<int> b);
int construct_roads(std::vector<int> x, std::vector<int> y)
{
	int n=x.size();
	vector<int> u,v,a,b;
	vector<vector<int>> cp;
	for(int i=0;i<n;i++)
		cp.push_back({y[i],x[i],i});
	sort(begin(cp),end(cp));
	for(int i=0;(i+1)<n;i++)
	{
		// go from y[i] to y[i+1]
		if((cp[i+1][0]-cp[i][0]) != 2)
			return 0;
		u.push_back(cp[i][2]);
		v.push_back(cp[i+1][2]);
		a.push_back(cp[i][1]-1);
		b.push_back(cp[i][0]+1);
	}
	build(u,v,a,b);
	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