Problem K. KMC Attacks

题目连接:

http://codeforces.com/gym/100714

Description

Warrant VI is a remote planet located in the Koprulu Sector. Warrant VI features a strange huge field,

which was discovered by the Kel-Morian Combine (KMC). The KMC is involved into a conflict with the

Scientific Community, which wishes to study the field, but the KMC intends to hold on to the significant

mineral wealth located there.

The field is represented by a rectangle of size N × M cells. All coordinates are positive integers. The left

upper corner is located at (1, 1) and the right bottom corner is at (N, M). The Scientific Community

have sent a T-280 unit to the field. You are one of the KMC members, your task is to find the unit

and destroy it. You have an orbital base equipped with a scanner at your disposal. You can examine

any single cell and if scan reveals the unit, a detachment is sent to destroy it. After every scan the unit

changes its location (i, j) by moving into one of four (three if the unit is in a border cell or two if it is in

a corner cell) adjacent cells. The unit has a tracking device. For every unit’s move you receive a signal:

‘U’ (for up, i decreases by one), ‘D’ (for down, i increases by one), ‘L’ (for left, j decreases by one), or ‘R’

(for right, j increases by one).

Time is running out so you are allowed to make not greater than 50000 scans to reveal the T-280 location.

Although the initial position of the unit is unknown, each its move provides you with information. You

are forbidden to scan cells, which definitely cannot hold the unit according to the gathered information.

Input

This is an interactive problem. Your program should first read a line with two integers N and M from

the standard input (where N is the height and M is the width of the field, 1 ≤ N, M ≤ 200). Then, for

every scan your program should print a corresponding request to the standard output (see below) and

read a reply from the standard input. Each reply is placed in a separate line and is either ’U’, ’D’, ’L’, ’R’

(meaning that you have missed and the unit has moved in the given direction) or ’DETECTED’ (meaning

that your last scan has revealed the unit’s position).

Output

For each scan print its coordinates i, j in a separate line (where i is the row number and j is the column

number). You have to flush the standard output after printing each request.

Sample Input

1 2

L

DETECTED

Sample Output

1 1

1 1

Hint

题意

交互题,在nm的矩阵,然后你需要找到一个东西。

每次你可以输入一个i,j位置,然后这个东西如果被抓到了,会返回delete,否则就会输出这个东西往哪儿走了。

题解:

暴力枚举这个东西的起点,然后判断现在的路径在哪儿,然后这样一直判断就好了。

注意,中途出界的点也得删去。

代码

#include <bits/stdc++.h>
#define rep(a,b,c) for(int (a)=(b);(a)<=(c);++(a))
#define drep(a,b,c) for(int (a)=(b);(a)>=(c);--(a))
#define pb push_back
#define mp make_pair
#define sf scanf
#define pf printf
#define two(x) (1<<(x))
#define clr(x,y) memset((x),(y),sizeof((x)))
#define dbg(x) cout << #x << "=" << x << endl;
const int mod = 1e9 + 7;
int mul(int x,int y){return 1LL*x*y%mod;}
int qpow(int x , int y){int res=1;while(y){if(y&1) res=mul(res,x) ; y>>=1 ; x=mul(x,x);} return res;}
inline int read(){int x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}return x*f;}
using namespace std;
list < pair < int , int > > s;
char buffer[2048];
list < int > test;
int dx , dy , upx , downx , ly , ry , N , M; bool judge( pair < int , int > p ){
int x = p.first , y = p.second;
if( x - upx <= 0 ) return false;
if( x + downx > N ) return false;
if( y + ry > M ) return false;
if( y - ly <= 0 ) return false;
return true;
} int main(int argc,char *argv[]){
scanf("%d%d",&N,&M);
for(int i = 1 ; i <= N ; ++ i) for(int j = 1 ; j <= M ; ++ j) s.push_back( mp(i , j) );
int ok = 0;
for(int i = 1 ; i <= 50000 ; ++ i){
while( !judge( s.front() ) ) s.pop_front();
printf("%d %d\n" , s.front().first + dx , s.front().second + dy );
s.pop_front();
fflush( stdout );
sf("%s",buffer);
int len = strlen(buffer);
if( len > 1 ){
ok = 1;
break;
}else{
char c = buffer[0];
if( c == 'U' ){
-- dx;
upx = max( upx , - dx );
}else if( c == 'D' ){
++ dx;
downx = max( downx , dx );
}else if( c == 'L' ){
-- dy;
ly = max( ly , -dy );
}else{
++ dy;
ry = max( ry , dy );
}
}
}
assert( ok == 1 );
return 0;
}

2010-2011 ACM-ICPC, NEERC, Moscow Subregional Contest Problem K. KMC Attacks 交互题 暴力的更多相关文章

  1. 2010-2011 ACM-ICPC, NEERC, Moscow Subregional Contest Problem I. Interest Targeting 模拟题

    Problem I. Interest Targeting 题目连接: http://codeforces.com/gym/100714 Description A unique display ad ...

  2. 2013-2014 ACM-ICPC, NEERC, Southern Subregional Contest Problem D. Grumpy Cat 交互题

    Problem D. Grumpy Cat 题目连接: http://www.codeforces.com/gym/100253 Description This problem is a littl ...

  3. 2010-2011 ACM-ICPC, NEERC, Moscow Subregional Contest Problem D. Distance 迪杰斯特拉

    Problem D. Distance 题目连接: http://codeforces.com/gym/100714 Description In a large city a cellular ne ...

  4. 2010-2011 ACM-ICPC, NEERC, Moscow Subregional Contest Problem C. Contest 水题

    Problem C. Contest 题目连接: http://codeforces.com/gym/100714 Description The second round of the annual ...

  5. 2016-2017 ACM-ICPC, NEERC, Moscow Subregional Contest Problem L. Lazy Coordinator

    题目来源:http://codeforces.com/group/aUVPeyEnI2/contest/229511 时间限制:1s 空间限制:512MB 题目大意: 给定一个n 随后跟着2n行输入 ...

  6. 2010-2011 ACM-ICPC, NEERC, Moscow Subregional Contest Problem J. Joke 水题

    Problem J. Joke 题目连接: http://codeforces.com/gym/100714 Description The problem is to cut the largest ...

  7. 2010-2011 ACM-ICPC, NEERC, Moscow Subregional Contest Problem H. Hometask 水题

    Problem H. Hometask 题目连接: http://codeforces.com/gym/100714 Description Kolya is still trying to pass ...

  8. 2010-2011 ACM-ICPC, NEERC, Moscow Subregional Contest Problem F. Finance 模拟题

    Problem F. Finance 题目连接: http://codeforces.com/gym/100714 Description The Big Boss Company (BBC) pri ...

  9. 2010-2011 ACM-ICPC, NEERC, Moscow Subregional Contest Problem A. Alien Visit 计算几何

    Problem A. Alien Visit 题目连接: http://codeforces.com/gym/100714 Description Witness: "First, I sa ...

随机推荐

  1. Linux命令(二)关机重启

  2. Guava BiMap

    BiMap主要的就是用于key,value的互相映射,获取相互的结果,还保证值value是唯一的,key相同覆盖原来值. 举例: BiMap<Integer, String> empIDN ...

  3. RTS与CTS的含义【转】

    转自:http://www.cnblogs.com/sunyubo/archive/2010/04/21/2282176.html 一.RS232标准中的RTS与CTS RTS,CTS------请求 ...

  4. Ubuntu+Nginx+uWSGI+Flask应用

    Ubuntu 18.04,Nginx 1.14.0,uWSGI 2.0.17.1,Flask 1.0.2,Python 3.6.5, 多日未更新博客,就是在忙着把自己的Flask应用在Ubuntu上运 ...

  5. 目标检测--Selective Search for Object Recognition(IJCV, 2013)

    Selective Search for Object Recognition 作者: J. R. R. Uijlings, K. E. A. van de Sande, T. Gevers, A. ...

  6. PowerMockRunner和ActiveObjectsJUnitRunner

    Jira的二次开发,需要作单元测试. 测试跟数据库连接的类,比如service类,需要在类上加@RunWith(ActiveObjectsJUnitRunner.class). 有时需要搭配mocki ...

  7. High-Speed Tracking with Kernelized Correlation Filters

          2015年的一篇论文,可参考:http://blog.csdn.net/carrierlxksuper/article/details/46461245.      另参考:http:// ...

  8. JAVA学习(二) String使用equals方法和==分别比较的是什么?(转)

    String使用的equals方法和==的区别 equals方法和==的区别   首先大家知道,String既可以作为一个对象来使用,又可以作为一个基本类型来使用.这里指的作为一个基本类型来使用只是指 ...

  9. bootstrap fileinput插件使用感悟

    bootstrap fileinput 的填坑感悟              这个插件在demo的网站地址http://plugins.krajee.com/file-preview-icons-de ...

  10. .NetCore生产环境下构建Consul(单个DC数据中心)的服务器健康检查

    下载最新的consul程序 consul 启动方式有两种 server 和client 默认是client 如果你不需要记录数据可以用 consul agent -dev 来启动 consul age ...