fork download
copy 
  1.     //TITLE :
  2.     //DATE: 
  3.     //Platform: 
  4.     import java.io.*;
  5.     import java.math.*;
  6.     import java.util.*;
  7.     class Solution
  8.     {
  9.     public static int temp=0,k;
  10.     public static void main (String[] args)throws IOException
  11.     {
  12.     try{
  13.     BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
  14.     int t=Integer.parseInt(br.readLine());
  15.     while(t!=0)
  16.     {
  17.     temp=0;
  18.     String ip[]=new String[2];
  19.     ip=br.readLine().split(" ");
  20.     int n=Integer.parseInt(ip[0]);
  21.     k=Integer.parseInt(ip[1]);
  22.  
  23.     char arr[][]=new char[n][n];
  24.  
  25.     int i,j;
  26.     i=0;
  27.     while(i<n){
  28.     	String st=br.readLine();
  29.     	for(j=0;j<n;j++){
  30.     		arr[i][j]=st.charAt(j);
  31.     	}
  32.     	i++;
  33.     }
  34.  
  35.     checkrow(arr,n);
  36.     if(temp==1)
  37.     System.out.println("YES");
  38.     else{
  39.     checkcol(arr,n);
  40.     if(temp==1)
  41.     System.out.println("YES");
  42.     else{
  43.     checkmaind(arr,n);
  44.     if(temp==1)
  45.     System.out.println("YES");
  46.     else{
  47.     checkantid(arr,n);
  48.     if(temp==1)
  49.     System.out.println("YES");
  50.     else
  51.     System.out.println("NO");
  52.     }
  53.     }
  54.     }
  55.     t--;
  56.     }
  57.  
  58.     }catch(Exception e)
  59.     {return;}
  60.     }
  61.     public static void checkrow(char a[][], int n){
  62.     	int i,j,count=0,free=0;
  63.     	for(i=0;i<n;i++){
  64.     		count=0;
  65.     		free=0;
  66.     		for(j=0;j<n;j++){
  67.     			if(a[i][j]=='X')
  68.     			count++;
  69.     			if(a[i][j]=='O')
  70.     			count=0;
  71.     			if(a[i][j]=='.'){
  72.     			free++;
  73.     			count++;
  74.     			}
  75.     			if(free>1){
  76.     			count=1;
  77.     			free=1;
  78.     			}
  79.     			if(count==k){
  80.     				temp=1;
  81.     				return;
  82.     			}
  83.     		}
  84.     	}
  85.     }
  86.     public static void checkcol(char a[][], int n){
  87.     	int i,j,count=0,free=0;
  88.     	for(i=0;i<n;i++){
  89.     		count=0;
  90.     		free=0;
  91.     		for(j=0;j<n;j++){
  92.     			if(a[j][i]=='X')
  93.     			count++;
  94.     			if(a[j][i]=='O')
  95.     			count=0;
  96.     			if(a[j][i]=='.'){
  97.     				free++;
  98.     				count++;
  99.     			}
  100.     			if(free>1){
  101.     				count=1;
  102.     				free=1;
  103.     			}
  104.     			if(count==k){
  105.     				temp=1;
  106.     				return;
  107.     			}
  108.     		}
  109.     	}
  110.     }
  111.     public static void checkmaind(char a[][], int n){
  112.     int i,j,count=0,free=0,p=0;
  113.     for(p=n-1;p>=-(n-1);p--){
  114.     		free=0;
  115.     	count=0;
  116.     for(i=0;i<n;i++){
  117.  
  118.     	for(j=0;j<n;j++){
  119.     		if((i-j)==p){
  120.     			if(a[j][i]=='X')
  121.     			count++;
  122.     			if(a[j][i]=='O')
  123.     			count=0;
  124.     			if(a[j][i]=='.'){
  125.     				free++;
  126.     				count++;
  127.     			}
  128.     			if(free>1){
  129.     				count=1;
  130.     				free=1;
  131.     			}
  132.     			if(count==k){
  133.     				temp=1;
  134.     				return;
  135.     			}
  136.     		}
  137.     	}
  138.     }
  139.     }
  140.     }
  141.     public static void checkantid(char a[][], int n){
  142.     int i,j,count=0,free=0,p=0;
  143.     for(p=0;p<=(2*n-2);p++){
  144.     		free=0;
  145.     	count=0;
  146.     for(i=0;i<n;i++){
  147.  
  148.     	for(j=0;j<n;j++){
  149.     		if((i+j)==p){
  150.     			if(a[j][i]=='X')
  151.     			count++;
  152.     			if(a[j][i]=='O')
  153.     			count=0;
  154.     			if(a[j][i]=='.'){
  155.     				free++;
  156.     				count++;
  157.     			}
  158.     			if(free>1){
  159.     				count=1;
  160.     				free=1;
  161.     			}
  162.     			if(count==k){
  163.     				temp=1;
  164.     				return;
  165.     			}
  166.     		}
  167.     	}
  168.     }
  169.     }
  170.     }
  171.     }//class
  172.     //status:  
  173.  
Success #stdin #stdout 0.12s 320576KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/6DkKJq
language:
Java (HotSpot 12)
created:
7 years ago
visibility:
secret

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!