Contest Day 1 - JOI Open Contest
In IOI Kingdom, there are cities numbered from
to
. These cities are connected by
roads through which you can pass in both directions. You can travel from any city to any other city by passing through some of these roads.
In IOI Kingdom, there are many companies producing special components. Each company produces only one kind of components. No two companies produce the same kind of components. Each company has at least one factory. Each factory is built in one of the cities. More than one company may have factories in the same city.
Sometimes, a company requires components of another company. Assume the company requires the components of the company
. In this case, they need to transport components from
to
. They may transport components from any of the factories of the company
to any of the factories of the company
. They need to choose factories appropriately to minimize the distance between factories.
Task
First, the number of cities and the information of roads in IOI Kingdom are given. Then, queries are given. Each query is written in the following form: the company
having factories in cities
requires components of the company
having factories in cities
. Write a program which, for each query, returns the minimum distance to transport the components.
Implementation Details
You are to write a program which implements procedures to answer queries.
Your program should include the header file factories.h
by #include "factories.h"
Your program should implement the following procedures.
void Init(int N, int A[], int B[], int D[])
- This procedure is called only once in the beginning. The parameter
is the number of cities in IOI Kingdom. The parameters
,
and
are arrays of length
. The elements
,
and
are three integers
,
and
respectively. This means, for each
, there is a road of length
connecting the city
and the city
.
long long Query(int S, int X[], int T, int Y[])
- This procedure is called for each of
queries. In the query
, the parameters
and
are two integers
and
respectively. These are the numbers of cities where the companies
,
have factories respectively. The parameter
is an array of length
. The company
has factories in cities
. The parameter
is an array of length
. The company
has factories in cities
.
This procedure should return the minimum distance to transport components from the companyto the company
.
Constraints
All input data satisfy the following conditions:
.
.
.
.
.
.
- You can travel from any city to any other city through some of these roads.
.
.
.
.
are different from each other
.
.
.
Subtask 1 [15 points]
The following conditions are satisfied:
.
.
Subtask 2 [18 points]
The following conditions are satisfied.
.
.
Subtask 3 [67 points]
No additional constraints.
Sample Execution
Init(7, {0, 1, 2, 2, 4, 1}, {1, 2, 3, 4, 5, 6}, {4, 4, 5, 6, 5, 3});
Query(2, 2, {0, 6}, {3, 4}); //returns 12.
Query(3, 2, {0, 1, 3}, {4, 6}); //returns 3.
Query(1, 1, {2}, {5}); //returns 11.
Explanation for Sample
These are sample input and sample output of the sample grader.
- In query
, the company
has factories in the cities
,
, and the company
has factories in the cities
,
. The distance from the factory of the company
in the city
to the factory of the company
in the city
is minimum. The minimum distance is
.
- In the query
, the company
has factories in the cities
,
,
, and the company
has factories in the cities
,
. The distance from the factory of the company
in the city
to the factory of the company
in the city
is minimum. The minimum distance is
.
- In the query
, the company
has factories in the city
, and the company
has factories in the city
. The distance from the factory of the company
in the city
to the factory of the company
in the city
is minimum. The minimum distance is
.
Additional Sources
Since the official page does not seem to provide a grader, the following are made available for you to use.
The code in factories.h
includes the prototype functions that you need to implement, but do not write your code in this file.
The code in factories.cpp
includes a sample of the functions you should fill in to solve the problem. You should submit the contents of this file to the judge for grading.
The code in grader.cpp
includes the main function and should be used to run judge your program.
If you are using g++
, then you can compile the program with g++ factories.cpp grader.cpp -std=c++11
. If you are using an IDE, then consult Stack Overflow on how to add files into your project.
Comments