oj.uz

Submission #848779

# Submission time Handle Problem Language Result Execution time Memory
848779 2023-09-13T13:37:13 Z d4xn Soccer Stadium (IOI23_soccer) C++17
17.5 / 100
 2199 ms 47696 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;
    vector<bool> vis[2];
    vis[0].resize(n, 0);
    vis[1].resize(n, 0);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            e += !f[i][j];
            if (f[i][j] == 1) {
                if (!vis[0][j]) {
                    vis[0][j] = 1;
                    for (int x = 0; x < i; x++) {
                        for (int y = i+1; y < n; y++) {
                            if (!f[x][j] && !f[y][j]) ok = 0;
                        }
                    }
                }

                if (!vis[1][i]) {
                    vis[1][i] = 1;
                    for (int x = 0; x < j; x++) {
                        for (int y = j+1; y < n; y++) {
                            if (!f[i][x] && !f[i][y]) ok = 0;
                        }
                    }
                }
            }
        }
    }

    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);

        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 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?

    // bruteforce?
    

    return 1e9;
}

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 348 KB ok
2 Correct 1 ms 348 KB ok
3 Correct 0 ms 344 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 16 ms 3228 KB partial
9 Partially correct 259 ms 47440 KB partial

Subtask #2
2.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB ok
2 Correct 1 ms 348 KB ok
3 Partially correct 1 ms 348 KB partial
4 Partially correct 0 ms 348 KB partial
5 Partially correct 0 ms 344 KB partial
6 Partially correct 0 ms 348 KB partial
7 Partially correct 0 ms 348 KB partial
8 Correct 1 ms 348 KB ok
9 Correct 0 ms 348 KB ok
10 Partially correct 0 ms 424 KB partial
11 Partially correct 1 ms 344 KB partial
12 Partially correct 0 ms 348 KB partial
13 Correct 0 ms 348 KB ok

Subtask #3
5.5 / 22.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 344 KB partial
2 Correct 1 ms 348 KB ok
3 Correct 1 ms 348 KB ok
4 Partially correct 1 ms 348 KB partial
5 Partially correct 0 ms 348 KB partial
6 Partially correct 0 ms 344 KB partial
7 Partially correct 0 ms 348 KB partial
8 Partially correct 0 ms 348 KB partial
9 Correct 1 ms 348 KB ok
10 Correct 0 ms 348 KB ok
11 Partially correct 0 ms 424 KB partial
12 Partially correct 1 ms 344 KB partial
13 Partially correct 0 ms 348 KB partial
14 Correct 0 ms 348 KB ok
15 Partially correct 0 ms 348 KB partial
16 Partially correct 0 ms 348 KB partial
17 Partially correct 0 ms 348 KB partial
18 Partially correct 0 ms 348 KB partial
19 Partially correct 0 ms 348 KB partial
20 Correct 0 ms 348 KB ok
21 Correct 0 ms 348 KB ok
22 Partially correct 0 ms 348 KB partial
23 Partially correct 0 ms 348 KB partial
24 Partially correct 1 ms 344 KB partial
25 Partially correct 0 ms 348 KB partial
26 Partially correct 1 ms 348 KB partial

Subtask #4
4.5 / 18.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 344 KB partial
2 Correct 1 ms 348 KB ok
3 Correct 1 ms 348 KB ok
4 Correct 0 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 Partially correct 0 ms 344 KB partial
9 Partially correct 0 ms 348 KB partial
10 Partially correct 0 ms 348 KB partial
11 Correct 1 ms 348 KB ok
12 Correct 0 ms 348 KB ok
13 Partially correct 0 ms 424 KB partial
14 Partially correct 1 ms 344 KB partial
15 Partially correct 0 ms 348 KB partial
16 Correct 0 ms 348 KB ok
17 Partially correct 0 ms 348 KB partial
18 Partially correct 0 ms 348 KB partial
19 Partially correct 0 ms 348 KB partial
20 Partially correct 0 ms 348 KB partial
21 Partially correct 0 ms 348 KB partial
22 Correct 0 ms 348 KB ok
23 Correct 0 ms 348 KB ok
24 Partially correct 0 ms 348 KB partial
25 Partially correct 0 ms 348 KB partial
26 Partially correct 1 ms 344 KB partial
27 Partially correct 0 ms 348 KB partial
28 Partially correct 1 ms 348 KB partial
29 Partially correct 1 ms 564 KB partial
30 Partially correct 0 ms 348 KB partial
31 Partially correct 1 ms 348 KB partial
32 Partially correct 1 ms 344 KB partial
33 Partially correct 1 ms 348 KB partial
34 Correct 0 ms 348 KB ok
35 Correct 1 ms 344 KB ok
36 Partially correct 1 ms 348 KB partial
37 Partially correct 0 ms 348 KB partial
38 Partially correct 0 ms 348 KB partial
39 Partially correct 0 ms 348 KB partial
40 Partially correct 0 ms 348 KB partial
41 Partially correct 0 ms 348 KB partial

Subtask #5
4.0 / 16.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 344 KB partial
2 Correct 1 ms 348 KB ok
3 Correct 1 ms 348 KB ok
4 Correct 0 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 Partially correct 0 ms 344 KB partial
9 Partially correct 0 ms 348 KB partial
10 Partially correct 0 ms 348 KB partial
11 Correct 1 ms 348 KB ok
12 Correct 0 ms 348 KB ok
13 Partially correct 0 ms 424 KB partial
14 Partially correct 1 ms 344 KB partial
15 Partially correct 0 ms 348 KB partial
16 Correct 0 ms 348 KB ok
17 Partially correct 0 ms 348 KB partial
18 Partially correct 0 ms 348 KB partial
19 Partially correct 0 ms 348 KB partial
20 Partially correct 0 ms 348 KB partial
21 Partially correct 0 ms 348 KB partial
22 Correct 0 ms 348 KB ok
23 Correct 0 ms 348 KB ok
24 Partially correct 0 ms 348 KB partial
25 Partially correct 0 ms 348 KB partial
26 Partially correct 1 ms 344 KB partial
27 Partially correct 0 ms 348 KB partial
28 Partially correct 1 ms 348 KB partial
29 Partially correct 1 ms 564 KB partial
30 Partially correct 0 ms 348 KB partial
31 Partially correct 1 ms 348 KB partial
32 Partially correct 1 ms 344 KB partial
33 Partially correct 1 ms 348 KB partial
34 Correct 0 ms 348 KB ok
35 Correct 1 ms 344 KB ok
36 Partially correct 1 ms 348 KB partial
37 Partially correct 0 ms 348 KB partial
38 Partially correct 0 ms 348 KB partial
39 Partially correct 0 ms 348 KB partial
40 Partially correct 0 ms 348 KB partial
41 Partially correct 0 ms 348 KB partial
42 Partially correct 20 ms 3436 KB partial
43 Partially correct 21 ms 3416 KB partial
44 Partially correct 39 ms 3220 KB partial
45 Partially correct 41 ms 3416 KB partial
46 Partially correct 23 ms 3228 KB partial
47 Partially correct 16 ms 3420 KB partial
48 Correct 19 ms 3216 KB ok
49 Partially correct 15 ms 3420 KB partial
50 Partially correct 15 ms 3420 KB partial
51 Partially correct 16 ms 3420 KB partial
52 Partially correct 15 ms 3416 KB partial
53 Partially correct 15 ms 3228 KB partial
54 Partially correct 28 ms 3472 KB partial
55 Partially correct 16 ms 3420 KB partial
56 Partially correct 37 ms 3164 KB partial
57 Partially correct 42 ms 3160 KB partial
58 Partially correct 46 ms 3224 KB partial
59 Partially correct 47 ms 3420 KB partial

Subtask #6
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 344 KB partial
2 Correct 1 ms 348 KB ok
3 Correct 1 ms 348 KB ok
4 Correct 0 ms 344 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 16 ms 3228 KB partial
10 Partially correct 259 ms 47440 KB partial
11 Partially correct 1 ms 348 KB partial
12 Partially correct 0 ms 348 KB partial
13 Partially correct 0 ms 344 KB partial
14 Partially correct 0 ms 348 KB partial
15 Partially correct 0 ms 348 KB partial
16 Correct 1 ms 348 KB ok
17 Correct 0 ms 348 KB ok
18 Partially correct 0 ms 424 KB partial
19 Partially correct 1 ms 344 KB partial
20 Partially correct 0 ms 348 KB partial
21 Correct 0 ms 348 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 0 ms 348 KB partial
27 Correct 0 ms 348 KB ok
28 Correct 0 ms 348 KB ok
29 Partially correct 0 ms 348 KB partial
30 Partially correct 0 ms 348 KB partial
31 Partially correct 1 ms 344 KB partial
32 Partially correct 0 ms 348 KB partial
33 Partially correct 1 ms 348 KB partial
34 Partially correct 1 ms 564 KB partial
35 Partially correct 0 ms 348 KB partial
36 Partially correct 1 ms 348 KB partial
37 Partially correct 1 ms 344 KB partial
38 Partially correct 1 ms 348 KB partial
39 Correct 0 ms 348 KB ok
40 Correct 1 ms 344 KB ok
41 Partially correct 1 ms 348 KB partial
42 Partially correct 0 ms 348 KB partial
43 Partially correct 0 ms 348 KB partial
44 Partially correct 0 ms 348 KB partial
45 Partially correct 0 ms 348 KB partial
46 Partially correct 0 ms 348 KB partial
47 Partially correct 20 ms 3436 KB partial
48 Partially correct 21 ms 3416 KB partial
49 Partially correct 39 ms 3220 KB partial
50 Partially correct 41 ms 3416 KB partial
51 Partially correct 23 ms 3228 KB partial
52 Partially correct 16 ms 3420 KB partial
53 Correct 19 ms 3216 KB ok
54 Partially correct 15 ms 3420 KB partial
55 Partially correct 15 ms 3420 KB partial
56 Partially correct 16 ms 3420 KB partial
57 Partially correct 15 ms 3416 KB partial
58 Partially correct 15 ms 3228 KB partial
59 Partially correct 28 ms 3472 KB partial
60 Partially correct 16 ms 3420 KB partial
61 Partially correct 37 ms 3164 KB partial
62 Partially correct 42 ms 3160 KB partial
63 Partially correct 46 ms 3224 KB partial
64 Partially correct 47 ms 3420 KB partial
65 Partially correct 432 ms 47608 KB partial
66 Partially correct 316 ms 47440 KB partial
67 Partially correct 292 ms 47696 KB partial
68 Partially correct 2199 ms 47608 KB partial
69 Partially correct 1255 ms 47612 KB partial
70 Partially correct 802 ms 47672 KB partial
71 Partially correct 1897 ms 47608 KB partial
72 Partially correct 319 ms 47636 KB partial
73 Correct 253 ms 47644 KB ok
74 Correct 258 ms 47640 KB ok
75 Partially correct 254 ms 47444 KB partial
76 Incorrect 252 ms 47444 KB wrong
77 Halted 0 ms 0 KB -