제출 #1242591

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1242591		franuch	분수 공원 (IOI21_parks)	C++20	0 / 100	0 ms	324 KiB

parks

#include "parks.h"
#include <bits/stdc++.h>
using namespace std;
typedef int ll;
typedef pair<ll, ll> pll;
#define vc vector
#define st first
#define nd second
#define all(a) a.begin(), a.end()
#define sz(a) (ll)a.size()
#define pub push_back
#define pob pop_back

ll construct_roads(std::vc<ll> x, std::vc<ll> y) {
	ll n = sz(x);
    vc<pll> a(n);
	for (ll i = 0; i < n; i++)
		a[i] = {y[i], i};
	sort(all(a));
	vc<ll> ru, rv, rx, ry;
	for (ll i = 0; i + 1 < n; i++) {
		if (a[i].st + 2 < a[i + 1].st)
			continue;
		ru.pub(a[i].nd);
		rv.pub(a[i + 1].nd);
		rx.pub(3);
		ry.pub(a[i].st + 1);
	}
	build(ru, rv, rx, ry);
	return 1;
}

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