oj.uz

Submission #1001007

# Submission time Handle Problem Language Result Execution time Memory
1001007 2024-06-18T12:44:07 Z 변재우(#10901) Soccer Stadium (IOI23_soccer) C++17
1.5 / 100
 317 ms 132556 KB 
#include "soccer.h"
#include <bits/stdc++.h>
using namespace std;

const int Nmax=2010;
int L[Nmax][Nmax], R[Nmax][Nmax], D[Nmax][Nmax];
int X[Nmax][Nmax], Y[Nmax][Nmax], S[Nmax][Nmax];

int biggest_stadium(int N, std::vector<std::vector<int>> F)
{
    int cnt=0;
    for(int i=1; i<=N; i++) for(int j=1; j<=N; j++) {
        cnt+=F[i-1][j-1], X[i][j]=X[i][j-1]+1-F[i-1][j-1], Y[i][j]=Y[i-1][j]+1-F[i-1][j-1];
        S[i][j]=S[i][j-1]+S[i-1][j]-S[i-1][j-1]+1-F[i-1][j-1];
    }
    for(int i=1; i<=N; i++) {
        for(int j=1; j<=N; j++) {
            if(F[i-1][j-1]) L[i][j]=j;
            else L[i][j]=L[i][j-1];
        }
        for(int j=N; j>=1; j--) {
            if(F[i-1][j-1]) R[i][j]=j;
            else R[i][j]=R[i][j+1];
        }
    }
    for(int j=1; j<=N; j++) {
        for(int i=N; i>=1; i--) {
            if(F[i-1][j-1]) D[i][j]=i;
            else D[i][j]=D[i][j+1];
        }
    }
    for(int i=1; i<=N; i++) for(int j=1; j<=N; j++) if(!F[i-1][j-1]) {
        int l=L[i][j], r=R[i][j], d=D[i][j];
        if(l && d && S[N][l]-S[d-1][l]) return 0;
        if(r && d && S[N][N]-S[N][r-1]-S[d-1][N]+S[d-1][r-1]) return 0;
        if(l && X[i][l-1]) return 0;
        if(d && Y[N][j]-Y[N][d]) return 0;
    }
    return N*N-cnt;
}

Subtask #0
0.0 / 0.0

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

Subtask #1
1.5 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB ok
2 Correct 0 ms 2396 KB ok
3 Correct 1 ms 2500 KB ok
4 Correct 0 ms 2652 KB ok
5 Correct 0 ms 348 KB ok
6 Partially correct 0 ms 348 KB partial
7 Partially correct 2 ms 5180 KB partial
8 Partially correct 21 ms 24668 KB partial
9 Partially correct 317 ms 132556 KB partial

Subtask #2
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB ok
2 Correct 0 ms 2396 KB ok
3 Partially correct 1 ms 348 KB partial
4 Incorrect 0 ms 348 KB wrong
5 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 1 ms 348 KB ok
3 Correct 0 ms 2396 KB ok
4 Partially correct 1 ms 348 KB partial
5 Incorrect 0 ms 348 KB wrong
6 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 1 ms 348 KB ok
3 Correct 0 ms 2396 KB ok
4 Correct 1 ms 2500 KB ok
5 Correct 0 ms 2652 KB ok
6 Partially correct 1 ms 348 KB partial
7 Incorrect 0 ms 348 KB wrong
8 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 1 ms 348 KB ok
3 Correct 0 ms 2396 KB ok
4 Correct 1 ms 2500 KB ok
5 Correct 0 ms 2652 KB ok
6 Partially correct 1 ms 348 KB partial
7 Incorrect 0 ms 348 KB wrong
8 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 1 ms 348 KB ok
3 Correct 0 ms 2396 KB ok
4 Correct 1 ms 2500 KB ok
5 Correct 0 ms 2652 KB ok
6 Correct 0 ms 348 KB ok
7 Partially correct 0 ms 348 KB partial
8 Partially correct 2 ms 5180 KB partial
9 Partially correct 21 ms 24668 KB partial
10 Partially correct 317 ms 132556 KB partial
11 Partially correct 1 ms 348 KB partial
12 Incorrect 0 ms 348 KB wrong
13 Halted 0 ms 0 KB -