oj.uz

Submission #1001002

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

const int Nmax=2010;
int S[Nmax][Nmax], L[Nmax][Nmax], R[Nmax][Nmax], D[Nmax][Nmax], U[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];
    for(int i=0; i<N; i++) {
        bool a=false, b=false;
        for(int j=1; j<N; j++) {
            if(F[i][j-1] && !F[i][j]) a=true;
            if(!F[i][j-1] && F[i][j]) b=true;
        }
        if(a && b) return 0;
    }
    for(int j=0; j<N; j++) {
        bool a=false, b=false;
        for(int i=1; i<N; i++) {
            if(F[i-1][j] && !F[i][j]) a=true;
            if(!F[i-1][j] && F[i][j]) b=true;
        }
        if(a && b) return 0;
    }
    return N*N-cnt;
}

Subtask #0
0.0 / 0.0

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

Subtask #1
1.5 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB ok
2 Correct 0 ms 348 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 0 ms 348 KB ok
5 Correct 0 ms 348 KB ok
6 Partially correct 0 ms 348 KB partial
7 Partially correct 1 ms 348 KB partial
8 Partially correct 12 ms 2864 KB partial
9 Partially correct 196 ms 35660 KB partial

Subtask #2
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB ok
2 Correct 0 ms 348 KB ok
3 Partially correct 0 ms 348 KB partial
4 Partially correct 1 ms 348 KB partial
5 Incorrect 0 ms 348 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 344 KB partial
2 Correct 0 ms 348 KB ok
3 Correct 0 ms 348 KB ok
4 Partially correct 0 ms 348 KB partial
5 Partially correct 1 ms 348 KB partial
6 Incorrect 0 ms 348 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 344 KB partial
2 Correct 0 ms 348 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 0 ms 348 KB ok
5 Correct 0 ms 348 KB ok
6 Partially correct 0 ms 348 KB partial
7 Partially correct 1 ms 348 KB partial
8 Incorrect 0 ms 348 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 344 KB partial
2 Correct 0 ms 348 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 0 ms 348 KB ok
5 Correct 0 ms 348 KB ok
6 Partially correct 0 ms 348 KB partial
7 Partially correct 1 ms 348 KB partial
8 Incorrect 0 ms 348 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 344 KB partial
2 Correct 0 ms 348 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 0 ms 348 KB ok
5 Correct 0 ms 348 KB ok
6 Correct 0 ms 348 KB ok
7 Partially correct 0 ms 348 KB partial
8 Partially correct 1 ms 348 KB partial
9 Partially correct 12 ms 2864 KB partial
10 Partially correct 196 ms 35660 KB partial
11 Partially correct 0 ms 348 KB partial
12 Partially correct 1 ms 348 KB partial
13 Incorrect 0 ms 348 KB wrong
14 Halted 0 ms 0 KB -