IOI '23 P2 - Longest Trip - DMOJ: Modern Online Judge

IOI '23 P2 - Longest Trip

View as PDF

Submit solution

All submissions

Best submissions

Points: 25 (partial)

Time limit: 1.0s

Memory limit: 1G

Problem types

Allowed languages

C++

The IOI 2023 organizers are in big trouble! They forgot to plan the trip to Ópusztaszer for the upcoming day. But maybe it is not yet too late $\ldots$ ~\ldots~

There are $N$ ~N~ landmarks at Ópusztaszer indexed from $0$ ~0~ to $N - 1$ ~N - 1~. Some pairs of these landmarks are connected by bidirectional roads. Each pair of landmarks is connected by at most one road. The organizers don't know which landmarks are connected by roads.

We say that the density of the road network at Ópusztaszer is at least $\delta$ ~\delta~ if every $3$ ~3~ distinct landmarks have at least $\delta$ ~\delta~ roads among them. In other words, for each triplet of landmarks $(u, v, w)$ ~(u, v, w)~ such that $0 \le u < v < w < N$ ~0 \le u < v < w < N~, among the pairs of landmarks $(u, v)$ ~(u, v)~, $(v, w)$ ~(v, w)~ and $(u, w)$ ~(u, w)~ at least $\delta$ ~\delta~ pairs are connected by a road.

The organizers know a positive integer $D$ ~D~ such that the density of the road network is at least $D$ ~D~. Note that the value of $D$ ~D~ cannot be greater than $3$ ~3~.

The organizers can make calls to the phone dispatcher at Ópusztaszer to gather information about the road connections between certain landmarks. In each call, two nonempty arrays of landmarks $[A[0], \ldots, A[P - 1]]$ ~[A[0], \ldots, A[P - 1]]~ and $[B[0], \ldots,B[R - 1]]$ ~[B[0], \ldots,B[R - 1]]~ must be specified. The landmarks must be pairwise distinct, that is,

$A[i] \ne A[j]$ ~A[i] \ne A[j]~ for each $i$ ~i~ and $j$ ~j~ such that $0 \le i < j < P$ ~0 \le i < j < P~;
$B[i] \ne B[j]$ ~B[i] \ne B[j]~ for each $i$ ~i~ and $j$ ~j~ such that $0 \le i < j < R$ ~0 \le i < j < R~;
$A[i] \ne B[j]$ ~A[i] \ne B[j]~ for each $i$ ~i~ and $j$ ~j~ such that $0 \le i < P$ ~0 \le i < P~ and $0 \le j < R$ ~0 \le j < R~.

For each call, the dispatcher reports whether there is a road connecting a landmark from $A$ ~A~ and a landmark from $B$ ~B~. More precisely, the dispatcher iterates over all pairs $i$ ~i~ and $j$ ~j~ such that $0 \le i < P$ ~0 \le i < P~ and $0 \le j < R$ ~0 \le j < R~. If, for any of them, the landmarks $A[i]$ ~A[i]~ and $B[j]$ ~B[j]~ are connected by a road, the dispatcher returns true. Otherwise, the dispatcher returns false.

A trip of length $l$ ~l~ is a sequence of distinct landmarks $t[0], t[1], \ldots, t[l - 1]$ ~t[0], t[1], \ldots, t[l - 1]~, where for each $i$ ~i~ between $0$ ~0~ and $l - 2$ ~l - 2~, inclusive, landmark $t[i]$ ~t[i]~ and landmark $t[i + 1]$ ~t[i + 1]~ are connected by a road. A trip of length $l$ ~l~ is called a longest trip if there does not exist any trip of length at least $l + 1$ ~l + 1~.

Your task is to help the organizers to find a longest trip at Ópusztaszer by making calls to the dispatcher.

Implementation Details

You should implement the following procedure:

std::vector<int> longest_trip(int N, int D)

$N$ ~N~: the number of landmarks at Ópusztaszer.
$D$ ~D~: the guaranteed minimum density of the road network.
This procedure should return an array $t = [t[0],t[1], \ldots,t[l - 1]]$ ~t = [t[0],t[1], \ldots,t[l - 1]]~, representing a longest trip.
This procedure may be called multiple times in each test case.

The above procedure can make calls to the following procedure:

bool are_connected(std::vector<int> A, std::vector<int> B)

$A$ ~A~: a nonempty array of distinct landmarks.
$B$ ~B~: a nonempty array of distinct landmarks.
$A$ ~A~ and $B$ ~B~ should be disjoint.
This procedure returns true if there is a landmark from $A$ ~A~ and a landmark from $B$ ~B~ connected by a road. Otherwise, it returns false.
This procedure can be called at most $32\,640$ ~32\,640~ times in each invocation of longest_trip, and at most $150\,000$ ~150\,000~ times in total.
The total length of arrays $A$ ~A~ and $B$ ~B~ passed to this procedure over all of its invocations cannot exceed $1\,500\,000$ ~1\,500\,000~.

The grader is not adaptive. Each submission is graded on the same set of test cases. That is, the values of $N$ ~N~ and $D$ ~D~, as well as the pairs of landmarks connected by roads, are fixed for each call of longest_trip within each test case.

Examples

Example 1

Consider a scenario in which $N = 5, D = 1$ ~N = 5, D = 1~, and the road connections are as shown in the following figure:

The procedure longest_trip is called in the following way:

longest_trip(5, 1)

The procedure may make calls to are_connected as follows.

Call	Pairs connected by a road	Return value
`are_connected([0], [1, 2, 4, 3])`	$(0, 1)$ ~(0, 1)~ and $(0, 2)$ ~(0, 2)~	`true`
`are_connected([2], [0])`	$(2, 0)$ ~(2, 0)~	`true`
`are_connected([2], [3])`	$(2, 3)$ ~(2, 3)~	`true`
`are_connected([1, 0], [4, 3])`	none	`false`

After the fourth call, it turns out that none of the pairs $(1, 4), (0, 4), (1, 3)$ ~(1, 4), (0, 4), (1, 3)~ and $(0, 3)$ ~(0, 3)~ is connected by a road. As the density of the network is at least $D = 1$ ~D = 1~, we see that from the triplet $(0, 3, 4)$ ~(0, 3, 4)~, the pair $(3, 4)$ ~(3, 4)~ must be connected by a road. Similarly to this, landmarks $0$ ~0~ and $1$ ~1~ must be connected.

At this point, it can be concluded that $t = [1, 0, 2, 3, 4]$ ~t = [1, 0, 2, 3, 4]~ is a trip of length $5$ ~5~, and that there does not exist a trip of length greater than $5$ ~5~. Therefore, the procedure longest_trip may return $[1, 0, 2, 3, 4]$ ~[1, 0, 2, 3, 4]~. Consider another scenario in which $N = 4, D = 1,$ ~N = 4, D = 1,~ and the roads between the landmarks are as shown in the following figure:

The procedure longest_trip is called in the following way:

longest_trip(4, 1)

In this scenario, the length of a longest trip is $2$ ~2~. Therefore, after a few calls to procedure are_connected, the procedure longest_trip may return one of $[0, 1], [1, 0], [2, 3]$ ~[0, 1], [1, 0], [2, 3]~ or $[3, 2]$ ~[3, 2]~.

Example 2

Subtask $0$ ~0~ contains an additional example test case with $N = 256$ ~N = 256~ landmarks. This test case is included in the attachment package that you can download from the contest system.

Constraints

$3 \le N \le 256$ ~3 \le N \le 256~
The sum of $N$ ~N~ over all calls to longest_trip does not exceed $1\,024$ ~1\,024~ in each test case.
$1 \le D \le 3$ ~1 \le D \le 3~

Subtasks

( $5$ ~5~ points) $D = 3$ ~D = 3~
( $10$ ~10~ points) $D = 2$ ~D = 2~
( $25$ ~25~ points) $D = 1$ ~D = 1~. Let $l^{*}$ ~l^{*}~ denote the length of a longest trip. Procedure longest_trip does not have to return a trip of length $l^{*}$ ~l^{*}~. Instead, it should return a trip of length at least $\lceil \frac{l^{*}}{2} \rceil$ ~\lceil \frac{l^{*}}{2} \rceil~.
( $60$ ~60~ points) $D = 1$ ~D = 1~

In subtask $4$ ~4~, your score is determined based on the number of calls to procedure are_connected over a single invocation of longest_trip. Let $q$ ~q~ be the maximum number of calls among all invocations of longest_trip over every test case of the subtask. Your score for this subtask is calculated according to the following table:

Condition	Points
$2\,750 < q \le 32\,640$ ~2\,750 < q \le 32\,640~	$20$ ~20~
$550 < q \le 2\,750$ ~550 < q \le 2\,750~	$30$ ~30~
$400 < q \le 550$ ~400 < q \le 550~	$45$ ~45~
$q \le 400$ ~q \le 400~	$60$ ~60~

If, in any of the test cases, the calls to the procedure are_connected do not conform to the constraints described in Implementation Details, or the array returned by longest_trip is incorrect, the score of your solution for that subtask will be $0$ ~0~.

Sample Grader

Let $C$ ~C~ denote the number of scenarios, that is, the number of calls to longest_trip. The sample grader reads the input in the following format:

line $1$ ~1~: $C$ ~C~

The descriptions of $C$ ~C~ scenarios follow.

The sample grader reads the description of each scenario in the following format:

line $1$ ~1~: $N$ ~N~ $D$ ~D~
line $1 + i$ ~1 + i~ $(1 \le i < N)$ ~(1 \le i < N)~: $U[0]$ ~U[0]~ $U[1]$ ~U[1]~ $\ldots$ ~\ldots~ $U[i - 1]$ ~U[i - 1]~

Here, each $U$ ~U~ $(1 \le i < N)$ ~(1 \le i < N)~ is an array of size $i$ ~i~, describing which pairs of landmarks are connected by a road. For each $i$ ~i~ and $j$ ~j~ such that $1 \le i < N$ ~1 \le i < N~ and $0 \le j < i$ ~0 \le j < i~:

if landmarks $j$ ~j~ and $i$ ~i~ are connected by a road, then the value of $U[j]$ ~U[j]~ should be $1$ ~1~;
if there is no road connecting landmarks $j$ ~j~ and $i$ ~i~, then the value of $U[j]$ ~U[j]~ should be $0$ ~0~.

In each scenario, before calling longest_trip, the sample grader checks whether the density of the road network is at least $D$ ~D~. If this condition is not met, it prints the message Insufficient Density and terminates.

If the sample grader detects a protocol violation, the output of the sample grader is Protocol Violation: <MSG>, where <MSG> is one of the following error messages:

invalid array: in a call to are_connected, at least one of arrays $A$ ~A~ and $B$ ~B~
- is empty, or
- contains an element that is not an integer between $0$ ~0~ and $N - 1$ ~N - 1~, inclusive, or
- contains the same element at least twice.
non-disjoint arrays: in a call to are_connected, arrays $A$ ~A~ and $B$ ~B~ are not disjoint.
too many calls: the number of calls made to are_connected exceeds $32\,640$ ~32\,640~ over the current invocation of longest trip, or exceeds $150\,000$ ~150\,000~ in total.
too many elements: the total number of landmarks passed to are_connected over all calls exceeds $1\,500\,000$ ~1\,500\,000~.

Otherwise, let the elements of the array returned by longest_trip in a scenario be $t[0],t[1], \ldots,t[l - 1]$ ~t[0],t[1], \ldots,t[l - 1]~ for some nonnegative $l$ ~l~. The sample grader prints three lines for this scenario in the following format:

line $1$ ~1~: $l$ ~l~
line $2$ ~2~: $t[0]$ ~t[0]~ $t[1]$ ~t[1]~ $\ldots$ ~\ldots~ $t[l - 1]$ ~t[l - 1]~
line $3$ ~3~: the number of calls to are_connected over this scenario

Finally, the sample grader prints:

line $1 + 3 \cdot C$ ~1 + 3 \cdot C~: the maximum number of calls to are_connected over all calls to longest_trip

Attachment Package

The sample grader along with sample test cases are available here.

Comments

There are no comments at the moment.