A. Pasha and Pixels
来源:互联网 发布:龙腾手机数据恢复软件 编辑:程序博客网 时间:2024/05/22 14:34
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 integersn, 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 the2 × 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 given k 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<stdio.h>#include<string.h> int d[1001][1001];int main(){ int i,a,b,k; int x,y; scanf("%d%d%d",&a,&b,&k); memset(d,0,sizeof(d)); for(i=1;i<=k;i++) { scanf("%d%d",&x,&y);//一个个接受 d[x][y]=1; if((d[x-1][y]&&d[x][y-1]&&d[x-1][y-1])||(d[x+1][y]&&d[x][y+1]&&d[x+1][y+1])||(d[x+1][y]&&d[x][y-1]&&d[x+1][y-1])||(d[x-1][y]&&d[x][y+1]&&d[x-1][y+1])) break;//若满足自己四周全为1,就直接跳出,不在接受 } if(i<=k) printf("%d\n",i); else printf("0\n"); return 0;}
- A. Pasha and Pixels
- A. Pasha and Pixels
- codeforce A. Pasha and Pixels
- codeforces #508A# Pasha and Pixels
- CF 508A(Pasha and Pixels-暴力)
- codeforces 508 A Pasha and Pixels
- CodeForces 508A Pasha and Pixels
- CodeForces 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))
- codeforces - 508A - Pasha and Pixels(暴力模拟)
- codeforces--A - Pasha and Pixels--B - Anton and currency you all know
- A. Pasha and Stick
- 610A Pasha and Stick
- Codeforces 610A Pasha and Stick 【水题】
- RSA加密算法加密与解密过程解析
- OCJP(310-065)精选笔记之-声明接口(Declare Interface)
- Make your Android Virtual Devices (AVD) run fast
- RSA加密与解密
- IOS 使用 ZbarSDK 二维码扫描
- A. Pasha and Pixels
- 中断处理过程
- OCJP(310-065)精选笔记之-访问控制修饰符 (Access Modifiers)
- sp_help的使用
- Tracert命令详解
- EF框架step by step(2)—Model-First
- PHP面向对象(OOP)编程完全教程:2.什么是类,什么是对象,类和对象这间的关系
- 关于 项目版本 标识意义Alpha,beta,rc,ga,release
- OCJP(310-065)精选笔记之-非访问控制修饰符 (Nonaccess Method Modifiers)