zoukankan      html  css  js  c++  java
  • Educational Codeforces Round 15_C. Cellular Network

    C. Cellular Network
    time limit per test
    3 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    You are given n points on the straight line — the positions (x-coordinates) of the cities and m points on the same line — the positions (x-coordinates) of the cellular towers. All towers work in the same way — they provide cellular network for all cities, which are located at the distance which is no more than r from this tower.

    Your task is to find minimal r that each city has been provided by cellular network, i.e. for each city there is at least one cellular tower at the distance which is no more than r.

    If r = 0 then a tower provides cellular network only for the point where it is located. One tower can provide cellular network for any number of cities, but all these cities must be at the distance which is no more than r from this tower.

    Input

    The first line contains two positive integers n and m (1 ≤ n, m ≤ 105) — the number of cities and the number of cellular towers.

    The second line contains a sequence of n integers a1, a2, ..., an ( - 109 ≤ ai ≤ 109) — the coordinates of cities. It is allowed that there are any number of cities in the same point. All coordinates ai are given in non-decreasing order.

    The third line contains a sequence of m integers b1, b2, ..., bm ( - 109 ≤ bj ≤ 109) — the coordinates of cellular towers. It is allowed that there are any number of towers in the same point. All coordinates bj are given in non-decreasing order.

    Output

    Print minimal r so that each city will be covered by cellular network.

    Examples
    input
    3 2
    -2 2 4
    -3 0
    output
    4
    input
    5 3
    1 5 10 14 17
    4 11 15
    output
    3

    题意:

    让你给每一个城市找一个塔来覆盖,然后叫你求出最小的覆盖半径,城市和塔都在一条直线上

    题解:

    我们直接枚举每一个城市,然后二分找一个最近的塔来覆盖

     1 #include<bits/stdc++.h>
     2 #define F(i,a,b) for(int i=a;i<=b;++i)
     3 using namespace std;
     4 typedef long long ll;
     5 
     6 const int N=1E5+7;
     7 int a[N],b[N];
     8 
     9 void up(int &a,int b){if(a<b)a=b;}
    10 
    11 int main(){
    12     int n,m,eda=1,edb=1;
    13     scanf("%d%d",&n,&m);
    14     F(i,1,n)scanf("%d",a+i);
    15     F(i,1,m)scanf("%d",b+i);
    16     F(i,2,n)if(a[i]!=a[eda])a[++eda]=a[i];//去重
    17     F(i,2,m)if(b[i]!=b[edb])b[++edb]=b[i];//去重
    18     int ans=0;
    19     F(i,1,eda){
    20         int pos=lower_bound(b+1,b+1+edb,a[i])-b-1;
    21         int tp=INT_MAX;//找一个最近的塔来更新答案
    22         if(pos>=1)tp=min(tp,a[i]-b[pos]);
    23         if(pos<edb)tp=min(tp,b[pos+1]-a[i]);
    24         up(ans,tp);
    25     }
    26     printf("%d
    ",ans);
    27     return 0;
    28 }
    View Code
  • 相关阅读:
    梯度提升树算法GBDT
    优先队列 priority_queue
    谭平 Vision Course Note 1~2 Recommended Textbook and Camera Basics
    侯捷老师C++基础课程笔记7-栈、堆和内存管理
    侯捷老师C++基础课程笔记6-三大特殊函数
    侯捷老师C++基础课程笔记5-操作符重载与临时对象
    侯捷老师C++基础课程笔记4-参数传递与返回值
    侯捷老师C++基础课程笔记3-构造函数(不含指针变量的class)
    侯捷老师C++基础课程笔记1-2
    C文件处理之24/32位bmp图像的旋转
  • 原文地址:https://www.cnblogs.com/bin-gege/p/5720055.html
Copyright © 2011-2022 走看看