oj.uz

답안 #1080541

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1080541 2024-08-29T10:50:42 Z shmax 축구 경기장 (IOI23_soccer) C++17
1.5 / 100
 231 ms 32256 KB 
#include "soccer.h"
#include "bits/stdc++.h"

using namespace std;
using i32 = int;
#define int long long
#define len(x) (int)(x.size())
#define all(x) x.begin(), x.end()
#define inf 1000'000'000'000'000'000LL
#define bit(x, i) (((x) >> i) & 1)


template<typename T>
using vec = vector<T>;

i32 biggest_stadium(i32 n, std::vector<std::vector<i32>> F) {
    int cnt = 0;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            cnt += F[i][j] == 0;
        }
    }
    vec<vec<bool>> used(n, vec<bool>(n, false));
    for (int i = 1; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (used[i][j]) continue;
            if (!F[i][j]) continue;
            if (F[i - 1][j] == 0) {
                for (int k = i; k < n; k++) {
                    if (F[k][j] == 0) return 0;
                    used[k][j] = true;
                }
            }
        }
    }
    used = vec<vec<bool>>(n, vec<bool>(n, false));
    for (int i = 0; i < n; i++) {
        for (int j = 1; j < n; j++) {
            if (used[i][j]) continue;
            if (!F[i][j]) continue;
            if (F[i][j - 1] == 0) {
                for (int k = j; k < n; k++) {
                    if (F[i][k] == 0) return 0;
                    used[i][k] = true;
                }
            }
        }
    }
    return cnt;
}

Subtask #0
0.0 / 0.0

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

Subtask #1
1.5 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB ok
2 Correct 0 ms 432 KB ok
3 Correct 1 ms 344 KB ok
4 Correct 0 ms 348 KB ok
5 Correct 0 ms 344 KB ok
6 Partially correct 1 ms 348 KB partial
7 Partially correct 2 ms 348 KB partial
8 Partially correct 16 ms 2452 KB partial
9 Partially correct 231 ms 32256 KB partial

Subtask #2
0.0 / 8.0

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

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

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

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

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