oj.uz

답안 #1000943

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1000943 2024-06-18T11:39:24 Z 변재우(#10901) 축구 경기장 (IOI23_soccer) C++17
0 / 100
 1 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]+F[i-1][j-1], Y[i][j]=Y[i][j-1]+F[i-1][j-1], 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]) {
        if(X[N][j] && Y[i][N]) return 0;
    }
    return N*N-cnt;
}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 344 KB partial

Subtask #1
0.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 Incorrect 0 ms 348 KB wrong
7 Halted 0 ms 0 KB -

Subtask #2
0.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB ok
2 Correct 0 ms 348 KB ok
3 Partially correct 0 ms 348 KB partial
4 Partially correct 0 ms 344 KB partial
5 Partially correct 0 ms 344 KB partial
6 Partially correct 0 ms 344 KB partial
7 Partially correct 0 ms 348 KB partial
8 Correct 0 ms 348 KB ok
9 Correct 0 ms 348 KB ok
10 Partially correct 0 ms 348 KB partial
11 Partially correct 1 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 -

Subtask #3
0.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 344 KB partial
2 Correct 0 ms 344 KB ok
3 Correct 0 ms 348 KB ok
4 Partially correct 0 ms 348 KB partial
5 Partially correct 0 ms 344 KB partial
6 Partially correct 0 ms 344 KB partial
7 Partially correct 0 ms 344 KB partial
8 Partially correct 0 ms 348 KB partial
9 Correct 0 ms 348 KB ok
10 Correct 0 ms 348 KB ok
11 Partially correct 0 ms 348 KB partial
12 Partially correct 1 ms 348 KB partial
13 Partially correct 1 ms 348 KB partial
14 Incorrect 0 ms 348 KB wrong
15 Halted 0 ms 0 KB -

Subtask #4
0.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 344 KB partial
2 Correct 0 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 0 ms 348 KB partial
7 Partially correct 0 ms 344 KB partial
8 Partially correct 0 ms 344 KB partial
9 Partially correct 0 ms 344 KB partial
10 Partially correct 0 ms 348 KB partial
11 Correct 0 ms 348 KB ok
12 Correct 0 ms 348 KB ok
13 Partially correct 0 ms 348 KB partial
14 Partially correct 1 ms 348 KB partial
15 Partially correct 1 ms 348 KB partial
16 Incorrect 0 ms 348 KB wrong
17 Halted 0 ms 0 KB -

Subtask #5
0.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 344 KB partial
2 Correct 0 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 0 ms 348 KB partial
7 Partially correct 0 ms 344 KB partial
8 Partially correct 0 ms 344 KB partial
9 Partially correct 0 ms 344 KB partial
10 Partially correct 0 ms 348 KB partial
11 Correct 0 ms 348 KB ok
12 Correct 0 ms 348 KB ok
13 Partially correct 0 ms 348 KB partial
14 Partially correct 1 ms 348 KB partial
15 Partially correct 1 ms 348 KB partial
16 Incorrect 0 ms 348 KB wrong
17 Halted 0 ms 0 KB -

Subtask #6
0.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 344 KB partial
2 Correct 0 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 Incorrect 0 ms 348 KB wrong
8 Halted 0 ms 0 KB -