oj.uz

Submission #1000938

# Submission time Handle Problem Language Result Execution time Memory
1000938 2024-06-18T11:35:39 Z 변재우(#10901) Soccer Stadium (IOI23_soccer) C++17
0 / 100
 0 ms 348 KB 
#include "soccer.h"
#include <bits/stdc++.h>
using namespace std;

const int Nmax=2010;
int cnt, X[Nmax][Nmax], Y[Nmax][Nmax];

int biggest_stadium(int N, std::vector<std::vector<int>> F)
{
    for(int i=1; i<=N; i++) for(int j=1; j<=N; j++) {
        X[i][j]=X[i-1][j]+1-F[i-1][j-1], Y[i][j]=Y[i][j-1]+1-F[i-1][j-1], cnt+=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]) {
        if(X[i-1][j] && X[N][j]-X[i][j]) return 0;
        if(Y[i][j-1] && Y[i][N]-Y[i][j]) 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
0.0 / 6.0

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

Subtask #2
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB wrong
2 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 Incorrect 0 ms 348 KB wrong
3 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 Incorrect 0 ms 348 KB wrong
3 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 Incorrect 0 ms 348 KB wrong
3 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 Incorrect 0 ms 348 KB wrong
3 Halted 0 ms 0 KB -