Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <cstdio>
- #include <algorithm>
- #include <cstring>
- #include <string>
- #include <cctype>
- #include <stack>
- #include <bitset>
- #include <queue>
- #include <list>
- #include <vector>
- #include <map>
- #include <set>
- #include <iterator>
- #include <sstream>
- #include <stdlib.h>
- #include <cmath>
- #define FOR(i,A) for(typeof (A).begin() i = (A).begin() ; i != (A).end() ; i++)
- #define debug( x ) cout << #x << " = " << x << endl
- #define clr(v,x) memset( v, x , sizeof v )
- #define all(x) (x).begin() , (x).end()
- #define rall(x) (x).rbegin() , (x).rend()
- #define TAM 110
- using namespace std;
- typedef pair<int,int> ii ;
- typedef long long ll ;
- typedef long double ld ;
- typedef pair<int,ii> pii ;
- int n,r,c,k;int arr[101][101];
- bool es_enemigo(int org,int cnt){
- if((org+1)==cnt ) return true;
- else if(org==n-1 && cnt==0) return true;
- else return false;
- }
- void batallar(){
- int arr1[101][101];
- for(int i=0;i<r;i++){
- for(int j=0;j<c;j++){
- arr1[i][j]=arr[i][j];
- }
- }
- for(int i=0;i<r;i++){
- for(int j=0;j<c;j++){
- if(i-1>=0){
- if(es_enemigo(arr[i][j],arr[i-1][j])){
- arr1[i-1][j]=arr[i][j];
- }
- }
- if(j-1>=0){
- if(es_enemigo(arr[i][j],arr[i][j-1])){
- arr1[i][j-1]=arr[i][j];
- }
- }
- if(i+1<r){
- if(es_enemigo(arr[i][j],arr[i+1][j])){
- arr1[i+1][j]=arr[i][j];
- }
- }
- if(j+1<c){
- if(es_enemigo(arr[i][j],arr[i][j+1])){
- arr1[i][j+1]=arr[i][j];
- }
- }
- }
- }
- for(int i=0;i<r;i++){
- for(int j=0;j<c;j++){
- arr[i][j]=arr1[i][j];
- }
- }
- }
- int main() {
- while(scanf("%d %d %d %d",&n,&r,&c,&k)){
- if(n==0 && r==0 && c==0 && k==0) break;
- //memset(arr,0,sizeof(arr));
- for(int i=0;i<r;i++){
- for(int j=0;j<c;j++){
- scanf("%d",&arr[i][j]);
- }
- }
- for(int i=0;i<k;i++){
- batallar();
- }
- for(int i=0;i<r;i++){
- for(int j=0;j<c;j++){
- if(j!=c-1)printf("%d ",arr[i][j]);
- else printf("%d\n",arr[i][j]);
- }
- }
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement