oj.uz

답안 #848806

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
848806 2023-09-13T14:05:55 Z d4xn 축구 경기장 (IOI23_soccer) C++17
16 / 100
 19 ms 3672 KB 
#include "soccer.h"
#include <bits/stdc++.h>

using namespace std;

const int inf = INT_MAX;

int n, e;
vector<vector<int>> f;

int biggest_stadium(int N, vector<vector<int>> F) {
    n = N;
    f = F;

    // se pueden coger todas las empty cells?
    bool ok = 1;
    e = 0;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            e += !f[i][j];
        }
    }

    vector<pair<int, int>> s[2];
    s[0].resize(n);
    s[1].resize(n);
    for (int i = 0; i < n; i++) {
        int l = inf;
        int r = -inf;
        for (int j = 0; j < n; j++) {
            if (f[i][j] == 1) continue;
            l = min(l, j);
            r = max(r, j);
        }
        s[0][i] = make_pair(l, r);

        for (int j = l; j <= r; j++) {
            if (f[i][j] == 1) ok = 0;
        }

        l = inf;
        r = -inf;
        for (int j = 0; j < n; j++) {
            if (f[j][i] == 1) continue;
            l = min(l, j);
            r = max(r, j);
        }
        s[1][i] = make_pair(l, r);

        for (int j = l; j <= r; j++) {
            if (f[j][i] == 1) ok = 0;
        }
    }

    for (int x = 0; x < n; x++) {
        for (int y = x+1; y < n; y++) {
            pair<int, int> a = s[0][x];
            pair<int, int> b = s[0][y];
            if (!(a.first <= b.first && b.second <= a.second) && !(b.first <= a.first && a.second <= b.second)) {
                ok = 0;
            }

            a = s[1][x];
            b = s[1][y];    
            if (!(a.first <= b.first && b.second <= a.second) && !(b.first <= a.first && a.second <= b.second)) {
                ok = 0;
            }
        }
    }

    if (ok) return e;

    // hay solo un tree?
    if (e == n*n-1) {
        int ans = 0;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                if (f[i][j] == 1) {
                    ans = max(ans, n*n - i*j);
                    ans = max(ans, n*n - (n-i-1)*j);
                    ans = max(ans, n*n - i*(n-j-1));
                    ans = max(ans, n*n - (n-i-1)*(n-j-1));
                    break;
                }
            }
        }
        return ans;
    }

    // else


    

    return 1e9;
}

Subtask #0
0.0 / 0.0

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

Subtask #1
0.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB ok
2 Correct 0 ms 344 KB ok
3 Correct 0 ms 360 KB ok
4 Correct 1 ms 348 KB ok
5 Correct 0 ms 348 KB ok
6 Incorrect 1 ms 348 KB wrong
7 Halted 0 ms 0 KB -

Subtask #2
2.0 / 8.0

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

Subtask #3
5.5 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 348 KB partial
2 Correct 0 ms 348 KB ok
3 Correct 0 ms 344 KB ok
4 Partially correct 0 ms 348 KB partial
5 Partially correct 0 ms 348 KB partial
6 Partially correct 0 ms 348 KB partial
7 Partially correct 1 ms 348 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 1 ms 348 KB partial
12 Partially correct 0 ms 348 KB partial
13 Partially correct 1 ms 348 KB partial
14 Correct 1 ms 348 KB ok
15 Partially correct 0 ms 348 KB partial
16 Partially correct 0 ms 348 KB partial
17 Partially correct 1 ms 344 KB partial
18 Partially correct 0 ms 348 KB partial
19 Partially correct 0 ms 348 KB partial
20 Correct 1 ms 348 KB ok
21 Correct 0 ms 344 KB ok
22 Partially correct 0 ms 348 KB partial
23 Partially correct 0 ms 348 KB partial
24 Partially correct 0 ms 348 KB partial
25 Partially correct 0 ms 348 KB partial
26 Partially correct 1 ms 348 KB partial

Subtask #4
4.5 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 348 KB partial
2 Correct 0 ms 348 KB ok
3 Correct 0 ms 344 KB ok
4 Correct 0 ms 360 KB ok
5 Correct 1 ms 348 KB ok
6 Partially correct 0 ms 348 KB partial
7 Partially correct 0 ms 348 KB partial
8 Partially correct 0 ms 348 KB partial
9 Partially correct 1 ms 348 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 1 ms 348 KB partial
14 Partially correct 0 ms 348 KB partial
15 Partially correct 1 ms 348 KB partial
16 Correct 1 ms 348 KB ok
17 Partially correct 0 ms 348 KB partial
18 Partially correct 0 ms 348 KB partial
19 Partially correct 1 ms 344 KB partial
20 Partially correct 0 ms 348 KB partial
21 Partially correct 0 ms 348 KB partial
22 Correct 1 ms 348 KB ok
23 Correct 0 ms 344 KB ok
24 Partially correct 0 ms 348 KB partial
25 Partially correct 0 ms 348 KB partial
26 Partially correct 0 ms 348 KB partial
27 Partially correct 0 ms 348 KB partial
28 Partially correct 1 ms 348 KB partial
29 Partially correct 1 ms 348 KB partial
30 Partially correct 0 ms 348 KB partial
31 Partially correct 1 ms 560 KB partial
32 Partially correct 0 ms 348 KB partial
33 Partially correct 0 ms 348 KB partial
34 Correct 1 ms 348 KB ok
35 Correct 0 ms 348 KB ok
36 Partially correct 0 ms 600 KB partial
37 Partially correct 1 ms 348 KB partial
38 Partially correct 0 ms 344 KB partial
39 Partially correct 0 ms 348 KB partial
40 Partially correct 1 ms 348 KB partial
41 Partially correct 0 ms 348 KB partial

Subtask #5
4.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 348 KB partial
2 Correct 0 ms 348 KB ok
3 Correct 0 ms 344 KB ok
4 Correct 0 ms 360 KB ok
5 Correct 1 ms 348 KB ok
6 Partially correct 0 ms 348 KB partial
7 Partially correct 0 ms 348 KB partial
8 Partially correct 0 ms 348 KB partial
9 Partially correct 1 ms 348 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 1 ms 348 KB partial
14 Partially correct 0 ms 348 KB partial
15 Partially correct 1 ms 348 KB partial
16 Correct 1 ms 348 KB ok
17 Partially correct 0 ms 348 KB partial
18 Partially correct 0 ms 348 KB partial
19 Partially correct 1 ms 344 KB partial
20 Partially correct 0 ms 348 KB partial
21 Partially correct 0 ms 348 KB partial
22 Correct 1 ms 348 KB ok
23 Correct 0 ms 344 KB ok
24 Partially correct 0 ms 348 KB partial
25 Partially correct 0 ms 348 KB partial
26 Partially correct 0 ms 348 KB partial
27 Partially correct 0 ms 348 KB partial
28 Partially correct 1 ms 348 KB partial
29 Partially correct 1 ms 348 KB partial
30 Partially correct 0 ms 348 KB partial
31 Partially correct 1 ms 560 KB partial
32 Partially correct 0 ms 348 KB partial
33 Partially correct 0 ms 348 KB partial
34 Correct 1 ms 348 KB ok
35 Correct 0 ms 348 KB ok
36 Partially correct 0 ms 600 KB partial
37 Partially correct 1 ms 348 KB partial
38 Partially correct 0 ms 344 KB partial
39 Partially correct 0 ms 348 KB partial
40 Partially correct 1 ms 348 KB partial
41 Partially correct 0 ms 348 KB partial
42 Partially correct 17 ms 3672 KB partial
43 Partially correct 18 ms 3224 KB partial
44 Partially correct 17 ms 3420 KB partial
45 Partially correct 18 ms 3420 KB partial
46 Partially correct 16 ms 3416 KB partial
47 Partially correct 17 ms 3420 KB partial
48 Correct 17 ms 3420 KB ok
49 Partially correct 16 ms 3420 KB partial
50 Partially correct 17 ms 3224 KB partial
51 Partially correct 17 ms 3420 KB partial
52 Partially correct 17 ms 3416 KB partial
53 Partially correct 16 ms 3420 KB partial
54 Partially correct 17 ms 3420 KB partial
55 Partially correct 18 ms 3416 KB partial
56 Partially correct 19 ms 3416 KB partial
57 Partially correct 17 ms 3416 KB partial
58 Partially correct 16 ms 3224 KB partial
59 Partially correct 17 ms 3420 KB partial

Subtask #6
0.0 / 30.0

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