oj.uz

Submission #1084532

# Submission time Handle Problem Language Result Execution time Memory
1084532 2024-09-06T11:16:38 Z thangdz2k7 Soccer Stadium (IOI23_soccer) C++17
3.5 / 100
 208 ms 39504 KB 
// author : thembululquaUwU
// 3.9.2024

#include <bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define endl '\n'

using namespace std;
using ll = long long;
using ii = pair <int, int>;
using vi = vector <int>;

const int MaxN = 2e5;
const int mod = 1e9 + 7;

void maxl(auto &a, auto b) {a = max(a, b);}
void minl(auto &a, auto b) {a = min(a, b);}

int biggest_stadium(int n, vector <vi> f){
//    if (n > 30){
        int ans = 0;
        vi l(n, -1), r(n, -1);
        int st = -1, ed = n;
        for (int i = 0; i < n; ++ i){
            int nt = 0;
            for (int j = 0; j < n; ++ j) {
                if (!f[i][j]){
                    if (l[i] == -1) l[i] = j;
                    r[i] = j; ++ ans;
                    if (st == -1) st = i; if (i > ed) return 0;
                    if (nt) return 0;
                }
                else if (l[i] != -1) nt = 1;
            }
            if (l[i] == -1) ed = i;
        }
        for (int i = st; i < ed; ++ i){
            for (int j = i + 1; j < ed; ++ j){
                if (l[i] <= l[j] && r[j] <= r[i]) continue;
                if (l[j] <= l[i] && r[i] <= r[j]) continue;
                return 0;
            }
        }
        int h = 0;
        for (int i = st + 1; i < ed; ++ i){
            int j = i - 1;
                if (l[i] <= l[j] && r[j] <= r[i] && h == 0) continue;
                h = 1;
                if (l[j] <= l[i] && r[i] <= r[j] && h == 1) continue;
                return 0;
        }

//        for (int i = 0; i < n; ++ i) l[i] = -1, r[i] = -1;
//        st = -1, ed = n;
//        for (int j = 0; j < n; ++ j){
//            int nt = 0;
//            for (int i = 0; i < n; ++ i) {
//                if (!f[i][j]){
//                    if (l[j] == -1) l[j] = i;
//                    r[j] = i;
//                    if (st == -1) st = j; if (j > ed) return 0;
//                    if (nt) return 0;
//                }
//                else if (l[j] != -1) nt = 1;
//            }
//            if (l[j] == -1) ed = j;
//        }
        return ans;
    //}
}

Compilation message

soccer.cpp:18:11: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   18 | void maxl(auto &a, auto b) {a = max(a, b);}
      |           ^~~~
soccer.cpp:18:20: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   18 | void maxl(auto &a, auto b) {a = max(a, b);}
      |                    ^~~~
soccer.cpp:19:11: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   19 | void minl(auto &a, auto b) {a = min(a, b);}
      |           ^~~~
soccer.cpp:19:20: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   19 | void minl(auto &a, auto b) {a = min(a, b);}
      |                    ^~~~
soccer.cpp: In function 'int biggest_stadium(int, std::vector<std::vector<int> >)':
soccer.cpp:32:21: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   32 |                     if (st == -1) st = i; if (i > ed) return 0;
      |                     ^~
soccer.cpp:32:43: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   32 |                     if (st == -1) st = i; if (i > ed) return 0;
      |                                           ^~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 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 428 KB ok
4 Correct 0 ms 348 KB ok
5 Correct 0 ms 348 KB ok
6 Partially correct 0 ms 436 KB partial
7 Partially correct 1 ms 448 KB partial
8 Partially correct 13 ms 2908 KB partial
9 Partially correct 208 ms 39504 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 1 ms 856 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 1 ms 348 KB ok
9 Correct 0 ms 436 KB ok
10 Partially correct 0 ms 344 KB partial
11 Partially correct 0 ms 344 KB partial
12 Partially correct 0 ms 344 KB partial
13 Correct 0 ms 348 KB ok

Subtask #3
0.0 / 22.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 348 KB partial
2 Correct 0 ms 344 KB ok
3 Correct 0 ms 348 KB ok
4 Partially correct 1 ms 856 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 1 ms 348 KB ok
10 Correct 0 ms 436 KB ok
11 Partially correct 0 ms 344 KB partial
12 Partially correct 0 ms 344 KB partial
13 Partially correct 0 ms 344 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 1 ms 348 KB partial
19 Partially correct 0 ms 344 KB partial
20 Incorrect 0 ms 344 KB wrong
21 Halted 0 ms 0 KB -

Subtask #4
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 348 KB partial
2 Correct 0 ms 344 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 0 ms 428 KB ok
5 Correct 0 ms 348 KB ok
6 Partially correct 1 ms 856 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 1 ms 348 KB ok
12 Correct 0 ms 436 KB ok
13 Partially correct 0 ms 344 KB partial
14 Partially correct 0 ms 344 KB partial
15 Partially correct 0 ms 344 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 1 ms 348 KB partial
21 Partially correct 0 ms 344 KB partial
22 Incorrect 0 ms 344 KB wrong
23 Halted 0 ms 0 KB -

Subtask #5
0.0 / 16.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 348 KB partial
2 Correct 0 ms 344 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 0 ms 428 KB ok
5 Correct 0 ms 348 KB ok
6 Partially correct 1 ms 856 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 1 ms 348 KB ok
12 Correct 0 ms 436 KB ok
13 Partially correct 0 ms 344 KB partial
14 Partially correct 0 ms 344 KB partial
15 Partially correct 0 ms 344 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 1 ms 348 KB partial
21 Partially correct 0 ms 344 KB partial
22 Incorrect 0 ms 344 KB wrong
23 Halted 0 ms 0 KB -

Subtask #6
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 348 KB partial
2 Correct 0 ms 344 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 0 ms 428 KB ok
5 Correct 0 ms 348 KB ok
6 Correct 0 ms 348 KB ok
7 Partially correct 0 ms 436 KB partial
8 Partially correct 1 ms 448 KB partial
9 Partially correct 13 ms 2908 KB partial
10 Partially correct 208 ms 39504 KB partial
11 Partially correct 1 ms 856 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 1 ms 348 KB ok
17 Correct 0 ms 436 KB ok
18 Partially correct 0 ms 344 KB partial
19 Partially correct 0 ms 344 KB partial
20 Partially correct 0 ms 344 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 1 ms 348 KB partial
26 Partially correct 0 ms 344 KB partial
27 Incorrect 0 ms 344 KB wrong
28 Halted 0 ms 0 KB -