oj.uz

Submission #1038394

# Submission time Handle Problem Language Result Execution time Memory
1038394 2024-07-29T18:37:05 Z Zicrus Soccer Stadium (IOI23_soccer) C++17
25 / 100
 248 ms 37464 KB 
#include <bits/stdc++.h>
#include "soccer.h"
using namespace std;

typedef long long ll;

int biggest_stadium(int n, vector<vector<int>> f) {
    vector<pair<ll, ll>> v(n, {-1, -1}), h(n, {-1, -1});
    ll num = 0;
    bool done = false;
    pair<ll, ll> prev = {-1, -1}, mn = {-1, -1};
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (!f[i][j]) {
                if (done)
                    return 0;
                if (v[i].first == -1) v[i].first = j;
                if (j - v[i].second > 1 && v[i].second != -1)
                    return 0;
                v[i].second = j;
                num++;
            }
        }
        if (v[i].first == -1 && num > 0) done = true;
        if (prev.first == -1) {
            prev = v[i];
            mn = v[i];
            continue;
        }
        if (v[i].first == -1) continue;
        if (v[i].first > mn.first && v[i].second > mn.second)
            return 0;
        if (v[i].first < mn.first && v[i].second < mn.second)
            return 0;
        mn.first = max(mn.first, v[i].first);
        mn.second = min(mn.second, v[i].second);
        if (v[i].first > prev.first && v[i].second > prev.second)
            return 0;
        if (v[i].first < prev.first && v[i].second < prev.second)
            return 0;
        prev = v[i];
    }
    num = 0;
    done = false;
    prev = {-1, -1};
    mn = {-1, -1};
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (!f[j][i]) {
                if (done)
                    return 0;
                if (h[i].first == -1) h[i].first = j;
                if (j - h[i].second > 1 && h[i].second != -1)
                    return 0;
                h[i].second = j;
                num++;
            }
        }
        if (h[i].first == -1 && num > 0) done = true;
        if (prev.first == -1) {
            prev = h[i];
            mn = h[i];
            continue;
        }
        if (h[i].first == -1) continue;
        if (h[i].first > mn.first && h[i].second > mn.second)
            return 0;
        if (h[i].first < mn.first && h[i].second < mn.second)
            return 0;
        mn.first = max(mn.first, h[i].first);
        mn.second = min(mn.second, h[i].second);
        if (h[i].first > prev.first && h[i].second > prev.second)
            return 0;
        if (h[i].first < prev.first && h[i].second < prev.second)
            return 0;
        prev = h[i];
    }

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (h[i].first == -1 || h[j].first == -1) continue;
            if (h[i].first < h[j].first && h[i].second < h[j].second) return 0;
            if (h[i].first > h[j].first && h[i].second > h[j].second) return 0;
        }
    }

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (v[i].first == -1 || v[j].first == -1) continue;
            if (v[i].first < v[j].first && v[i].second < v[j].second) return 0;
            if (v[i].first > v[j].first && v[i].second > v[j].second) return 0;
        }
    }

    return num;
}

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 0 ms 436 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 496 KB partial
8 Partially correct 13 ms 2908 KB partial
9 Partially correct 194 ms 37200 KB partial

Subtask #2
2.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB ok
2 Correct 0 ms 436 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 0 ms 348 KB partial
7 Partially correct 0 ms 348 KB partial
8 Correct 0 ms 344 KB ok
9 Correct 0 ms 348 KB ok
10 Partially correct 0 ms 348 KB partial
11 Partially correct 0 ms 348 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 0 ms 436 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 0 ms 348 KB partial
8 Partially correct 0 ms 348 KB partial
9 Correct 0 ms 344 KB ok
10 Correct 0 ms 348 KB ok
11 Partially correct 0 ms 348 KB partial
12 Partially correct 0 ms 348 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 344 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 344 KB ok
22 Partially correct 0 ms 348 KB partial
23 Partially correct 0 ms 344 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

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 0 ms 436 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 348 KB partial
8 Partially correct 0 ms 348 KB partial
9 Partially correct 0 ms 348 KB partial
10 Partially correct 0 ms 348 KB partial
11 Correct 0 ms 344 KB ok
12 Correct 0 ms 348 KB ok
13 Partially correct 0 ms 348 KB partial
14 Partially correct 0 ms 348 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 344 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 344 KB ok
24 Partially correct 0 ms 348 KB partial
25 Partially correct 0 ms 344 KB partial
26 Partially correct 0 ms 348 KB partial
27 Partially correct 0 ms 348 KB partial
28 Partially correct 0 ms 348 KB partial
29 Partially correct 0 ms 348 KB partial
30 Partially correct 0 ms 348 KB partial
31 Partially correct 0 ms 344 KB partial
32 Partially correct 0 ms 440 KB partial
33 Partially correct 0 ms 348 KB partial
34 Correct 0 ms 348 KB ok
35 Correct 0 ms 432 KB ok
36 Partially correct 0 ms 344 KB partial
37 Partially correct 0 ms 348 KB partial
38 Partially correct 1 ms 348 KB partial
39 Partially correct 0 ms 344 KB partial
40 Partially correct 0 ms 348 KB partial
41 Partially correct 1 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 0 ms 436 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 348 KB partial
8 Partially correct 0 ms 348 KB partial
9 Partially correct 0 ms 348 KB partial
10 Partially correct 0 ms 348 KB partial
11 Correct 0 ms 344 KB ok
12 Correct 0 ms 348 KB ok
13 Partially correct 0 ms 348 KB partial
14 Partially correct 0 ms 348 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 344 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 344 KB ok
24 Partially correct 0 ms 348 KB partial
25 Partially correct 0 ms 344 KB partial
26 Partially correct 0 ms 348 KB partial
27 Partially correct 0 ms 348 KB partial
28 Partially correct 0 ms 348 KB partial
29 Partially correct 0 ms 348 KB partial
30 Partially correct 0 ms 348 KB partial
31 Partially correct 0 ms 344 KB partial
32 Partially correct 0 ms 440 KB partial
33 Partially correct 0 ms 348 KB partial
34 Correct 0 ms 348 KB ok
35 Correct 0 ms 432 KB ok
36 Partially correct 0 ms 344 KB partial
37 Partially correct 0 ms 348 KB partial
38 Partially correct 1 ms 348 KB partial
39 Partially correct 0 ms 344 KB partial
40 Partially correct 0 ms 348 KB partial
41 Partially correct 1 ms 348 KB partial
42 Partially correct 13 ms 2732 KB partial
43 Partially correct 12 ms 2820 KB partial
44 Partially correct 12 ms 2904 KB partial
45 Partially correct 12 ms 2904 KB partial
46 Partially correct 17 ms 2908 KB partial
47 Partially correct 12 ms 2908 KB partial
48 Correct 14 ms 2904 KB ok
49 Partially correct 12 ms 2908 KB partial
50 Partially correct 12 ms 2908 KB partial
51 Partially correct 12 ms 2908 KB partial
52 Partially correct 12 ms 2908 KB partial
53 Partially correct 12 ms 2908 KB partial
54 Partially correct 12 ms 2904 KB partial
55 Partially correct 12 ms 2908 KB partial
56 Partially correct 12 ms 2688 KB partial
57 Partially correct 19 ms 2908 KB partial
58 Partially correct 15 ms 2820 KB partial
59 Partially correct 12 ms 2908 KB partial

Subtask #6
7.5 / 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 0 ms 436 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 496 KB partial
9 Partially correct 13 ms 2908 KB partial
10 Partially correct 194 ms 37200 KB partial
11 Partially correct 0 ms 348 KB partial
12 Partially correct 0 ms 348 KB partial
13 Partially correct 0 ms 348 KB partial
14 Partially correct 0 ms 348 KB partial
15 Partially correct 0 ms 348 KB partial
16 Correct 0 ms 344 KB ok
17 Correct 0 ms 348 KB ok
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 Correct 0 ms 348 KB ok
22 Partially correct 0 ms 348 KB partial
23 Partially correct 0 ms 344 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 344 KB ok
29 Partially correct 0 ms 348 KB partial
30 Partially correct 0 ms 344 KB partial
31 Partially correct 0 ms 348 KB partial
32 Partially correct 0 ms 348 KB partial
33 Partially correct 0 ms 348 KB partial
34 Partially correct 0 ms 348 KB partial
35 Partially correct 0 ms 348 KB partial
36 Partially correct 0 ms 344 KB partial
37 Partially correct 0 ms 440 KB partial
38 Partially correct 0 ms 348 KB partial
39 Correct 0 ms 348 KB ok
40 Correct 0 ms 432 KB ok
41 Partially correct 0 ms 344 KB partial
42 Partially correct 0 ms 348 KB partial
43 Partially correct 1 ms 348 KB partial
44 Partially correct 0 ms 344 KB partial
45 Partially correct 0 ms 348 KB partial
46 Partially correct 1 ms 348 KB partial
47 Partially correct 13 ms 2732 KB partial
48 Partially correct 12 ms 2820 KB partial
49 Partially correct 12 ms 2904 KB partial
50 Partially correct 12 ms 2904 KB partial
51 Partially correct 17 ms 2908 KB partial
52 Partially correct 12 ms 2908 KB partial
53 Correct 14 ms 2904 KB ok
54 Partially correct 12 ms 2908 KB partial
55 Partially correct 12 ms 2908 KB partial
56 Partially correct 12 ms 2908 KB partial
57 Partially correct 12 ms 2908 KB partial
58 Partially correct 12 ms 2908 KB partial
59 Partially correct 12 ms 2904 KB partial
60 Partially correct 12 ms 2908 KB partial
61 Partially correct 12 ms 2688 KB partial
62 Partially correct 19 ms 2908 KB partial
63 Partially correct 15 ms 2820 KB partial
64 Partially correct 12 ms 2908 KB partial
65 Partially correct 191 ms 37200 KB partial
66 Partially correct 210 ms 37204 KB partial
67 Partially correct 196 ms 37200 KB partial
68 Partially correct 192 ms 37196 KB partial
69 Partially correct 192 ms 37132 KB partial
70 Partially correct 212 ms 37092 KB partial
71 Partially correct 196 ms 37292 KB partial
72 Partially correct 224 ms 37304 KB partial
73 Correct 248 ms 37172 KB ok
74 Correct 229 ms 37464 KB ok
75 Partially correct 193 ms 37200 KB partial
76 Partially correct 189 ms 37204 KB partial
77 Partially correct 193 ms 37204 KB partial
78 Partially correct 193 ms 36180 KB partial
79 Partially correct 195 ms 36260 KB partial
80 Partially correct 194 ms 36176 KB partial
81 Partially correct 222 ms 36176 KB partial
82 Partially correct 197 ms 36176 KB partial
83 Partially correct 205 ms 36140 KB partial
84 Partially correct 199 ms 36176 KB partial
85 Partially correct 198 ms 36176 KB partial
86 Partially correct 198 ms 36120 KB partial
87 Partially correct 195 ms 36212 KB partial
88 Partially correct 209 ms 36080 KB partial
89 Partially correct 186 ms 36180 KB partial
90 Partially correct 183 ms 36140 KB partial
91 Partially correct 206 ms 36088 KB partial
92 Partially correct 195 ms 36140 KB partial
93 Partially correct 228 ms 36244 KB partial
94 Partially correct 189 ms 36176 KB partial
95 Partially correct 184 ms 36176 KB partial
96 Partially correct 184 ms 36184 KB partial
97 Partially correct 189 ms 36176 KB partial
98 Partially correct 188 ms 36172 KB partial
99 Partially correct 183 ms 36176 KB partial
100 Partially correct 189 ms 36176 KB partial
101 Partially correct 231 ms 36180 KB partial
102 Partially correct 190 ms 36180 KB partial
103 Partially correct 192 ms 36180 KB partial
104 Partially correct 186 ms 36116 KB partial
105 Partially correct 187 ms 36176 KB partial
106 Partially correct 182 ms 36248 KB partial
107 Partially correct 191 ms 36064 KB partial
108 Partially correct 188 ms 36248 KB partial
109 Partially correct 192 ms 36256 KB partial