oj.uz

Submission #1107845

# Submission time Handle Problem Language Result Execution time Memory
1107845 2024-11-02T07:48:35 Z coolboy19521 Soccer Stadium (IOI23_soccer) C++17
1.5 / 100
 279 ms 47432 KB 
#include "soccer.h"

using namespace std;

int biggest_stadium(int N, std::vector<std::vector<int>> F)
{
    bool f = true;
    int c = 0;
    vector<vector<int>> d(N, vector<int>(N));
    if (1 == F[0][0]) {
        d[0][0] = 2;
    }
    if (1 == F[0][N - 1]) {
        d[0][N - 1] = 2;
    }
    if (1 == F[N - 1][0]) {
        d[N - 1][0] = 2;
    }
    if (1 == F[N - 1][N - 1]) {
        d[N - 1][N - 1] = 2;
    }
    for (int i = 0; i < N; i ++) {
        for (int j = 0; j < N; j ++) {
            if (0 < i) {
                d[i][j] = max(d[i][j], d[i - 1][j]);
            }
            if (0 < j) {
                d[i][j] = max(d[i][j - 1], d[i][j]);
            }
            if (i < N - 1) {
                d[i][j] = max(d[i + 1][j], d[i][j]);
            }
            if (j < N - 1) {
                d[i][j] = max(d[i][j + 1], d[i][j]);
            }
        }
        for (int j = N - 1; 0 <= j; j --) {
            if (0 < i) {
                d[i][j] = max(d[i][j], d[i - 1][j]);
            }
            if (0 < j) {
                d[i][j] = max(d[i][j - 1], d[i][j]);
            }
            if (i < N - 1) {
                d[i][j] = max(d[i + 1][j], d[i][j]);
            }
            if (j < N - 1) {
                d[i][j] = max(d[i][j + 1], d[i][j]);
            }
        }
    }
    for (int i = N - 1; 0 <= i; i --) {
        for (int j = 0; j < N; j ++) {
            if (0 < i) {
                d[i][j] = max(d[i][j], d[i - 1][j]);
            }
            if (0 < j) {
                d[i][j] = max(d[i][j - 1], d[i][j]);
            }
            if (i < N - 1) {
                d[i][j] = max(d[i + 1][j], d[i][j]);
            }
            if (j < N - 1) {
                d[i][j] = max(d[i][j + 1], d[i][j]);
            }
        }
        for (int j = N - 1; 0 <= j; j --) {
            if (0 < i) {
                d[i][j] = max(d[i][j], d[i - 1][j]);
            }
            if (0 < j) {
                d[i][j] = max(d[i][j - 1], d[i][j]);
            }
            if (i < N - 1) {
                d[i][j] = max(d[i + 1][j], d[i][j]);
            }
            if (j < N - 1) {
                d[i][j] = max(d[i][j + 1], d[i][j]);
            }
        }
    }
    for (int i = 0; i < N; i ++) {
        for (int j = 0; j < N; j ++) {
            if (F[i][j] == 1) {
                if (0 == d[i][j]) {
                    f = false;
                }
            } else {
                c ++;
            }
        }
    }
    if (f) {
        return c;
    }
    return 0;
}

Subtask #0
0.0 / 0.0

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

Subtask #1
1.5 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB ok
2 Correct 1 ms 512 KB ok
3 Correct 1 ms 336 KB ok
4 Correct 1 ms 336 KB ok
5 Correct 1 ms 336 KB ok
6 Partially correct 0 ms 336 KB partial
7 Partially correct 2 ms 336 KB partial
8 Partially correct 18 ms 3216 KB partial
9 Partially correct 279 ms 47432 KB partial

Subtask #2
0.0 / 8.0

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

Subtask #3
0.0 / 22.0

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

Subtask #4
0.0 / 18.0

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

Subtask #5
0.0 / 16.0

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

Subtask #6
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 336 KB partial
2 Correct 0 ms 336 KB ok
3 Correct 1 ms 512 KB ok
4 Correct 1 ms 336 KB ok
5 Correct 1 ms 336 KB ok
6 Correct 1 ms 336 KB ok
7 Partially correct 0 ms 336 KB partial
8 Partially correct 2 ms 336 KB partial
9 Partially correct 18 ms 3216 KB partial
10 Partially correct 279 ms 47432 KB partial
11 Incorrect 1 ms 336 KB wrong
12 Halted 0 ms 0 KB -