1109 : Nearest Maintenance Point

时间限制Time Limit 2 秒Sec 内存限制Memory Limit 128 兆MB 提交次数Submitted 326 次Times 通过次数Solved 83 次Times

标准评测 Standard

从标准输入读入，结果写到标准输出。评测将输出拆成 token，与标准答案逐项比较，不按整段逐字节比对。 Read from standard input and write to standard output. The judge splits the output into tokens and compares them with the official answer; it does not compare raw bytes.

比对Compare	token 相同即通过。中间的空格、制表符、换行可多可少。Matching tokens pass. Extra spaces, tabs, or newlines between them are ignored.
不同则错Differs	token 个数或内容不同即错误。23 与 2 3、02 与 2、2.0 与 2 均视为不同。A different token count or value is wrong. 23 vs 2 3, 02 vs 2, and 2.0 vs 2 all differ.
输入Input	标准输入，格式见题面。Standard input; format as in the statement.
输出Output	标准输出。Standard output.

模板Template

C++ C Java Python

#include <iostream>
using namespace std;
int main() {
    int a, b;
    cin >> a >> b;
    cout << (a + b) << endl;
    return 0;
}

#include <stdio.h>
int main() {
    int a, b;
    scanf("%d%d", &a, &b);
    printf("%d\n", a + b);
    return 0;
}

import java.util.Scanner;
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int a = in.nextInt();
        int b = in.nextInt();
        System.out.println(a + b);
    }
}

a, b = map(int, input().split())
print(a + b)

题目描述Description

A county consists of n cities (labeled 1, 2, …, n) connected by some bidirectional roads. Each road connects a pair of distinct cities. A robot company has built maintenance points in some cities. Now, they need your help to write a program to query the nearest maintenance point to a specific city.

输入格式Input

There will be at most 200 test cases. Each case begins with four integers n, m, s, q(2 ≤ n ≤ 10⁴, 1 ≤ m ≤ 5 × 10⁴, 1 ≤ s ≤ min {n, 1000}, 1 ≤ q ≤ min {n, 1000}), the number of cities, the number of roads, the number of cities which have maintenance points and the number of queries. Then m lines contain the descriptions of roads. Each of them contains three integers u_i, v_i, w_i(1 ≤ u_i, v_i ≤ n, u_i ≠ v_i, 1 ≤ w_i ≤ 1000), denoting there is a road of length w_i which connects city u_i and v_i. The next line contains s integers, denoting the cities which have maintenance points. Then q lines contain the descriptions of queries. Each of them contains one integer denoting a specific city. The size of the whole input file does not exceed 6MB.

输出格式Output

For each query, print the nearest city which has a maintenance point. If there are multiple such cities, print all of them in increasing order separated by a single space. It is guaranteed that there will be at least one such city.

CSGCPC

1109 : Nearest Maintenance Point

题目描述Description

输入格式Input

输出格式Output

样例Sample

出题Author

来源Source