Submission #1037966

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1037966	2024-07-29T11:26:11 Z	Zicrus	Soccer Stadium (IOI23_soccer)	C++17	3.5 / 100	190 ms	31776 KB

soccer

#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};
    bool dec = false;
    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];
            continue;
        }
        if (v[i].first == -1) continue;
        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;
        if (dec && (v[i].first < prev.first || v[i].second > prev.second)) return 0;
        if (!dec && (v[i].first > prev.first || v[i].second < prev.second)) dec = true;
    }
    num = 0;
    done = false;
    prev = {-1, -1};
    dec = false;
    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];
            continue;
        }
        if (h[i].first == -1) continue;
        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;
        if (dec && (h[i].first < prev.first || h[i].second > prev.second)) return 0;
        if (!dec && (h[i].first > prev.first || h[i].second < prev.second)) dec = true;
    }

    return num;
}

Subtask #0

0.0 / 0.0

#	Verdict	Execution time	Memory	Grader output
1	Partially correct	1 ms	348 KB	partial

Subtask #1

1.5 / 6.0

#	Verdict	Execution time	Memory	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	Partially correct	0 ms	348 KB	partial
7	Partially correct	1 ms	348 KB	partial
8	Partially correct	13 ms	2200 KB	partial
9	Partially correct	190 ms	31776 KB	partial

Subtask #2

2.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	ok
2	Correct	0 ms	348 KB	ok
3	Partially correct	0 ms	344 KB	partial
4	Partially correct	0 ms	344 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	348 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

0.0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Partially correct	1 ms	348 KB	partial
2	Correct	0 ms	344 KB	ok
3	Correct	0 ms	348 KB	ok
4	Partially correct	0 ms	344 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	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	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	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	0 ms	348 KB	partial
25	Incorrect	0 ms	348 KB	wrong
26	Halted	0 ms	0 KB	-

Subtask #4

0.0 / 18.0

#	Verdict	Execution time	Memory	Grader output
1	Partially correct	1 ms	348 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	344 KB	partial
7	Partially correct	0 ms	344 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	348 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	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	0 ms	348 KB	partial
27	Incorrect	0 ms	348 KB	wrong
28	Halted	0 ms	0 KB	-

Subtask #5

0.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Partially correct	1 ms	348 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	344 KB	partial
7	Partially correct	0 ms	344 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	348 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	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	0 ms	348 KB	partial
27	Incorrect	0 ms	348 KB	wrong
28	Halted	0 ms	0 KB	-

Subtask #6

0.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Partially correct	1 ms	348 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	Partially correct	0 ms	348 KB	partial
8	Partially correct	1 ms	348 KB	partial
9	Partially correct	13 ms	2200 KB	partial
10	Partially correct	190 ms	31776 KB	partial
11	Partially correct	0 ms	344 KB	partial
12	Partially correct	0 ms	344 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	348 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	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	0 ms	348 KB	partial
32	Incorrect	0 ms	348 KB	wrong
33	Halted	0 ms	0 KB	-