oj.uz

Submission #1001004

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

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=1; i<=N; i++) {
        for(int j=1; j<=N; j++) if(F[i-1][j-1]) {
            bool a=false, b=false;
            for(int k=1; k<i; k++) if(!F[k-1][j-1]) a=true;
            for(int k=i+1; k<=N; k++) if(!F[k-1][j-1]) b=true;
            if(a && b) return 0;
            a=b=false;
            for(int k=1; k<j; k++) if(!F[i-1][k-1]) a=true;
            for(int k=j+1; k<=N; k++) if(!F[i-1][k-1]) 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 1 ms 344 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 13 ms 2396 KB partial
9 Partially correct 187 ms 31828 KB partial

Subtask #2
0.0 / 8.0

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