CodeForces 508A Pasha and Pixels
来源:互联网 发布:teamview linux无桌面 编辑:程序博客网 时间:2024/05/24 00:14
Pasha loves his phone and also putting his hair up... But the hair is now irrelevant.
Pasha has installed a new game to his phone. The goal of the game is following. There is a rectangular field consisting ofn row with m pixels in each row. Initially, all the pixels are colored white. In one move, Pasha can choose any pixel and color it black. In particular, he can choose the pixel that is already black, then after the boy's move the pixel does not change, that is, it remains black. Pasha loses the game when a2 × 2 square consisting of black pixels is formed.
Pasha has made a plan of k moves, according to which he will paint pixels. Each turn in his plan is represented as a pair of numbersi and j, denoting respectively the row and the column of the pixel to be colored on the current move.
Determine whether Pasha loses if he acts in accordance with his plan, and if he does, on what move the2 × 2 square consisting of black pixels is formed.
The first line of the input contains three integers n, m, k (1 ≤ n, m ≤ 1000,1 ≤ k ≤ 105) — the number of rows, the number of columns and the number of moves that Pasha is going to perform.
The next k lines contain Pasha's moves in the order he makes them. Each line contains two integersi and j (1 ≤ i ≤ n,1 ≤ j ≤ m), representing the row number and column number of the pixel that was painted during a move.
If Pasha loses, print the number of the move when the 2 × 2 square consisting of black pixels is formed.
If Pasha doesn't lose, that is, no 2 × 2 square consisting of black pixels is formed during the givenk moves, print 0.
2 2 41 11 22 12 2
4
2 3 62 32 21 32 21 21 1
5
5 3 72 31 21 14 13 15 33 2
0#include<cstdio>#include<algorithm>#include<cstring>#include<iostream> using namespace std;int map[1111][1111];int main(){int n,m,k;int x,y;while(cin>>n>>m>>k){int index=0;memset(map,0,sizeof(map));for(int i=0;i<k;i++){scanf("%d %d",&x,&y);map[x][y]=1;if(map[x+1][y+1]==1&&map[x+1][y]==1&&map[x][y+1]==1&&index==0){index=i+1;continue;}if(map[x-1][y-1]==1&&map[x-1][y]==1&&map[x][y-1]==1&&index==0){index=i+1;continue;}if(map[x-1][y+1]==1&&map[x-1][y]==1&&map[x][y+1]==1&&index==0){index=i+1;continue;}if(map[x+1][y-1]==1&&map[x+1][y]==1&&map[x][y-1]==1&&index==0){index=i+1;continue;}}printf("%d\n",index);}return 0;}
- codeforces #508A# Pasha and Pixels
- codeforces 508 A Pasha and Pixels
- CodeForces 508A Pasha and Pixels
- CodeForces 508A Pasha and Pixels
- codeforces - 508A - Pasha and Pixels(暴力模拟)
- A. Pasha and Pixels
- A. Pasha and Pixels
- CF 508A(Pasha and Pixels-暴力)
- Codeforces Round #288 (Div. 2) A. Pasha and Pixels
- Codeforces Round #288 (Div. 2) A. Pasha and Pixels
- Codeforces Round #288 (Div. 2) A. Pasha and Pixels
- A. Pasha and Pixels(Codeforces Round #288 (Div. 2))
- A. Pasha and Pixels(Codeforces Round #288 (Div. 2))
- codeforce A. Pasha and Pixels
- codeforces--A - Pasha and Pixels--B - Anton and currency you all know
- Codeforces 610A Pasha and Stick 【水题】
- codeforces 610A Pasha and Stick
- 【CodeForces】[610A]Pasha and Stick
- WSDL文件详解
- 腾讯移动前端一面(不会的题)
- POJ 1000 A+B Problem
- 通过Ajax方式提交含有文件的表单
- tomcat服务器启动后,但是使用默认端口打不开网页
- CodeForces 508A Pasha and Pixels
- oracle查看视图引用表及视图内容
- QSettings用法详解
- 代理模式和装饰模式的差别
- NoSQL
- Java Array和Arrays
- 二进制中1的个数统计
- ios null
- STL笔记(6)——Traits编程技法(一)