oj.uz

Submission #841152

# Submission time Handle Problem Language Result Execution time Memory
841152 2023-09-01T09:54:52 Z Gurban Soccer Stadium (IOI23_soccer) C++17
1.5 / 100
 267 ms 34068 KB 
#include "soccer.h"
#include <bits/stdc++.h>
using namespace std;

int biggest_stadium(int N, std::vector<std::vector<int>> F)
{
    vector<vector<bool>>up(N,vector<bool>(N,0));
    vector<vector<bool>>dw(N,vector<bool>(N,0));
    vector<vector<bool>>lf(N,vector<bool>(N,0));
    vector<vector<bool>>rg(N,vector<bool>(N,0));
    int ans = 0;
    for(int i = 0;i < N;i++){
        for(int j = 0;j < N;j++){
            if(!F[i][j]){
                up[i][j] = lf[i][j] = 1;
                ans++;
            }
            else {
                if(i > 0) up[i][j] = up[i-1][j];
                if(j > 0) lf[i][j] = lf[i][j-1];
            }
        }
    }

    for(int i = N-1;i >= 0;i--){
        for(int j = N-1;j >= 0;j--){
            if(!F[i][j]) dw[i][j] = rg[i][j] = 1;
            else {
                if(i < N-1) dw[i][j] = dw[i + 1][j];
                if(j < N-1) rg[i][j] = rg[i][j + 1];
            }
        }
    }

    for(int i = 0;i < N;i++){
        for(int j = 0;j < N;j++){
            if(F[i][j] == 1){
                if(lf[i][j] and rg[i][j]) return -1;
                if(up[i][j] and dw[i][j]) return -1;
            }
        }
    }

    return ans;
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Partially 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 1 ms 212 KB ok
4 Correct 0 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 16 ms 2448 KB partial
9 Partially correct 267 ms 34068 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 0 ms 212 KB partial
4 Partially correct 0 ms 212 KB partial
5 Incorrect 0 ms 212 KB wrong
6 Halted 0 ms 0 KB -

Subtask #3
0.0 / 22.0

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

Subtask #4
0.0 / 18.0

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

Subtask #5
0.0 / 16.0

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

Subtask #6
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 212 KB partial
2 Correct 0 ms 212 KB ok
3 Correct 1 ms 212 KB ok
4 Correct 1 ms 212 KB ok
5 Correct 0 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 16 ms 2448 KB partial
10 Partially correct 267 ms 34068 KB partial
11 Partially correct 0 ms 212 KB partial
12 Partially correct 0 ms 212 KB partial
13 Incorrect 0 ms 212 KB wrong
14 Halted 0 ms 0 KB -