zoukankan      html  css  js  c++  java
  • One-Dimensional Battle Ships CodeForces

    lice and Bob love playing one-dimensional battle ships. They play on the field in the form of a line consisting of n square cells (that is, on a 1 × n table).

    At the beginning of the game Alice puts k ships on the field without telling their positions to Bob. Each ship looks as a 1 × a rectangle (that is, it occupies a sequence of a consecutive squares of the field). The ships cannot intersect and even touch each other.

    After that Bob makes a sequence of "shots". He names cells of the field and Alice either says that the cell is empty ("miss"), or that the cell belongs to some ship ("hit").

    But here's the problem! Alice like to cheat. May be that is why she responds to each Bob's move with a "miss".

    Help Bob catch Alice cheating — find Bob's first move, such that after it you can be sure that Alice cheated.

    Input

    The first line of the input contains three integers: nk and a (1 ≤ n, k, a ≤ 2·105) — the size of the field, the number of the ships and the size of each ship. It is guaranteed that the nk and a are such that you can put k ships of size a on the field, so that no two ships intersect or touch each other.

    The second line contains integer m (1 ≤ m ≤ n) — the number of Bob's moves.

    The third line contains m distinct integers x1, x2, ..., xm, where xi is the number of the cell where Bob made the i-th shot. The cells are numbered from left to right from1 to n.

    Output

    Print a single integer — the number of such Bob's first move, after which you can be sure that Alice lied. Bob's moves are numbered from 1 to m in the order the were made. If the sought move doesn't exist, then print "-1".

    Example

    Input
    11 3 3
    5
    4 8 6 1 11
    Output
    3
    找大的和小的 然后巴拉巴拉一处理
     1 #include <iostream>
     2 using namespace std;
     3 #include<string.h>
     4 #include<stdio.h>
     5 #include<set>
     6 #include<map>
     7 #include<algorithm>
     8 #include<math.h>
     9 set<int>TM;
    10 int main()
    11 {
    12      #ifndef ONLINE_JUDGE
    13      #endif // ONLINE_JUDGE
    14     int haichang,chuanshu,chuanchang;
    15     int t,CNM,i;
    16     int temp;
    17     while(cin>>haichang>>chuanshu>>chuanchang>>t)
    18     {
    19         TM.clear();
    20         int flag=1;
    21         TM.insert(0);
    22         TM.insert(haichang+1);
    23         temp=-1;
    24         int sum=(haichang+1)/(chuanchang+1);
    25         for(i=1;i<=t;i++)
    26         {
    27             cin>>CNM;
    28             int wei,tou;
    29              set<int>::iterator it = TM.upper_bound(CNM);
    30              wei=*it;
    31 
    32              tou=*(--it);
    33             sum = sum - (wei-tou)/(chuanchang+1) +(CNM-tou)/(chuanchang+1) + (wei-CNM)/(chuanchang+1);
    34             if(sum<chuanshu&&flag)
    35             {
    36                 flag=0;
    37                 temp=i;
    38             }
    39             TM.insert(CNM);
    40         }
    41         cout<<temp<<endl;
    42     }
    43     return 0;
    44 }
    View Code
    Input
    5 1 3
    2
    1 5
    Output
    -1
    Input
    5 1 3
    1
    3
    Output
    1
  • 相关阅读:
    http请求头和响应头详细解释
    http协议POST请求头content-type主要的四种取值
    什么是精准测试
    测试管理(管事篇)
    有赞全链路压测方案设计与实施详解
    饿了么全链路压测平台的实现与原理
    京东全链路压测军演系统(ForceBot)架构解密
    java Apache common-io 讲解
    CentOS 7.0 安装go 1.3.1
    异常
  • 原文地址:https://www.cnblogs.com/dulute/p/7272587.html
Copyright © 2011-2022 走看看