oj.uz

Submission #839796

# Submission time Handle Problem Language Result Execution time Memory
839796 2023-08-30T16:09:26 Z mircea_007 Soccer Stadium (IOI23_soccer) C++17
1.5 / 100
 271 ms 35336 KB 
#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 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB partial

Subtask #1
1.5 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB ok
2 Correct 1 ms 212 KB ok
3 Correct 0 ms 212 KB ok
4 Correct 1 ms 212 KB ok
5 Correct 1 ms 212 KB ok
6 Partially correct 0 ms 212 KB partial
7 Partially correct 1 ms 340 KB partial
8 Partially correct 17 ms 2640 KB partial
9 Partially correct 271 ms 35336 KB partial

Subtask #2
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB ok
2 Correct 1 ms 212 KB ok
3 Partially correct 1 ms 212 KB partial
4 Partially correct 0 ms 212 KB partial
5 Incorrect 0 ms 284 KB wrong
6 Halted 0 ms 0 KB -

Subtask #3
0.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB partial
2 Correct 0 ms 212 KB ok
3 Correct 1 ms 212 KB ok
4 Partially correct 1 ms 212 KB partial
5 Partially correct 0 ms 212 KB partial
6 Incorrect 0 ms 284 KB wrong
7 Halted 0 ms 0 KB -

Subtask #4
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB partial
2 Correct 0 ms 212 KB ok
3 Correct 1 ms 212 KB ok
4 Correct 0 ms 212 KB ok
5 Correct 1 ms 212 KB ok
6 Partially correct 1 ms 212 KB partial
7 Partially correct 0 ms 212 KB partial
8 Incorrect 0 ms 284 KB wrong
9 Halted 0 ms 0 KB -

Subtask #5
0.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB partial
2 Correct 0 ms 212 KB ok
3 Correct 1 ms 212 KB ok
4 Correct 0 ms 212 KB ok
5 Correct 1 ms 212 KB ok
6 Partially correct 1 ms 212 KB partial
7 Partially correct 0 ms 212 KB partial
8 Incorrect 0 ms 284 KB wrong
9 Halted 0 ms 0 KB -

Subtask #6
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB partial
2 Correct 0 ms 212 KB ok
3 Correct 1 ms 212 KB ok
4 Correct 0 ms 212 KB ok
5 Correct 1 ms 212 KB ok
6 Correct 1 ms 212 KB ok
7 Partially correct 0 ms 212 KB partial
8 Partially correct 1 ms 340 KB partial
9 Partially correct 17 ms 2640 KB partial
10 Partially correct 271 ms 35336 KB partial
11 Partially correct 1 ms 212 KB partial
12 Partially correct 0 ms 212 KB partial
13 Incorrect 0 ms 284 KB wrong
14 Halted 0 ms 0 KB -