oj.uz

Submission #1007033

# Submission time Handle Problem Language Result Execution time Memory
1007033 2024-06-24T11:01:12 Z NeroZein Soccer Stadium (IOI23_soccer) C++17
0 / 100
 0 ms 348 KB 
#include "soccer.h"
#include <bits/stdc++.h>
using namespace std;

int biggest_stadium(int n, vector<vector<int>> F) {
  int r = -1, c = -1;
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
      if (F[i][j] == 1) {
        r = i, c = j; 
      }
    }
  }
  if (c == -1) {
    return n * n;
  }
  int ans = (c + 1) * (r) + c; //top left
  ans = max(ans, (c + 1) * (n - r - 1) + c);//bot left
  ans = max(ans, (n - r - 1) * (r) + n - c - 1);//top right
  ans = max(ans, (n - r - 1) * (n - c - 1) + n - c - 1); //bot right
  return ans; 
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 348 KB partial

Subtask #1
0.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB ok
2 Incorrect 0 ms 348 KB wrong
3 Halted 0 ms 0 KB -

Subtask #2
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB ok
2 Incorrect 0 ms 348 KB wrong
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 22.0

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

Subtask #4
0.0 / 18.0

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

Subtask #5
0.0 / 16.0

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

Subtask #6
0.0 / 30.0

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