fork download
copy 
  1. import java.io.InputStream;
  2. import java.io.OutputStream;
  3. import java.io.PrintWriter;
  4. import java.util.Scanner;
  5.  
  6. public class Main {
  7.  
  8.     public static void main(String[] args) {
  9.         new Resolver(System.in, System.out).solve();
  10.     }
  11.  
  12.     public static class Resolver {
  13.  
  14.         private Scanner scanner;
  15.         private PrintWriter writer;
  16.  
  17.         public Resolver(InputStream is, OutputStream os) {
  18.             this.scanner = new Scanner(is);
  19.             this.writer = new PrintWriter(os);
  20.         }
  21.  
  22.         public void solve() {
  23.             int rowCount = scanner.nextInt();
  24.             int columnCount = scanner.nextInt();
  25.             int[][] chocolate = new int[rowCount][columnCount];
  26.             for (int i = 0; i < rowCount; i++) {
  27.                 for (int j = 0; j < columnCount; j++) chocolate[i][j] = scanner.nextInt();
  28.             }
  29.             check(chocolate, rowCount, columnCount);
  30.             writer.flush(); writer.close();
  31.         }
  32.  
  33.         private void check(int[][] chocolate, int rowCount, int columnCount) {
  34.             if (mayBreakByRow(chocolate, rowCount, columnCount) || mayBreakByColumn(chocolate, rowCount, columnCount)) writer.println("Yes");
  35.             else writer.println("No");
  36.         }
  37.         private boolean mayBreakByRow(int[][] chocolate, int rowCount, int columnCount) {
  38.             for (int i = 0; i < rowCount - 1; i++) {
  39.                 boolean okRow = true;
  40.                 for (int j = 0; j < columnCount; j++) {
  41.                     if (chocolate[i][j] == chocolate[i + 1][j]) { okRow = false; break; }
  42.                 }
  43.                 if (okRow) return true;
  44.             }
  45.             return false;
  46.         }
  47.         private boolean mayBreakByColumn(int[][] chocolate, int rowCount, int columnCount) {
  48.             for (int i = 0; i < columnCount - 1; i++) {
  49.                 boolean okColumn = true;
  50.                 for (int j = 0; j < rowCount; j++) {
  51.                     if (chocolate[j][i] == chocolate[j][i + 1]) { okColumn = false; break; }
  52.                 }
  53.                 if (okColumn) return true;
  54.             }
  55.             return false;
  56.         }
  57.     }
  58. }
Success #stdin #stdout 0.06s 2184192KB
comments (?)
stdin
copy 
2 3
1 1 2
3 3 2
stdout
copy 
Yes
https://ideone.com/Dv9Jxb
language:
Java (HotSpot 12)
created:
5 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!