Submission #839796

#	Time	Username	Problem	Language	Result	Execution time	Memory
839796		mircea_007	Soccer Stadium (IOI23_soccer)	C++17	1.50 / 100	271 ms	35336 KiB

soccer

#include <stdio.h>
#include <vector>

int biggest_stadium( int N, std::vector<std::vector<int>> F ){
  int nempty = 0, l, c, border, prev;

  for( l = 0 ; l < N ; l++ )
    for( c = 0 ; c < N ; c++ )
      if( !F[l][c] )
        nempty++;

  for( l = 0 ; l < N ; l++ ){
    prev = 1;
    border = 0;
    for( c = 0 ; c < N ; c++ ){
      if( F[l][c] != prev ){
        prev = F[l][c];
        border++;
      }
    }

    if( border > 2 )
      return 1;
  }

  for( c = 0 ; c < N ; c++ ){
    prev = 1;
    border = 0;
    for( l = 0 ; l < N ; l++ ){
      if( F[l][c] != prev ){
        prev = F[l][c];
        border++;
      }
    }

    if( border > 2 )
      return 1;
  }

  return nempty;
}

• Subtask 0: 0 / 0
• Subtask 1: 1.5 / 6
• Subtask 2: 0 / 8
• Subtask 3: 0 / 22
• Subtask 4: 0 / 18
• Subtask 5: 0 / 16
• Subtask 6: 0 / 30