oj.uz

Submission #911245

# Submission time Handle Problem Language Result Execution time Memory
911245 2024-01-18T16:57:44 Z marvinthang Soccer Stadium (IOI23_soccer) C++17
25 / 100
 270 ms 39896 KB 
/*************************************
*    author: marvinthang             *
*    created: 18.01.2024 23:36:31    *
*************************************/

#include "soccer.h"
#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i-- > 0; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }

// end of template

int biggest_stadium(int N, vector <vector <int>> F) {
    vector <int> left(N), right(N);
    REP(x, N) {
        while (left[x] < N && F[x][left[x]]) ++left[x];
        right[x] = left[x];
        while (right[x] < N && !F[x][right[x]]) ++right[x];
        FOR(i, right[x], N) if (!F[x][i]) return 0;
    }
    int l = 0;
    while (left[l] == N) ++l;
    int r = l;
    while (r < N && left[r] < N) ++r;
    FOR(i, r, N) if (left[i] < N) return 0;
    --r;
    int last = -1;
    while (l <= r) {
        int p = -1;
        if (left[l] <= left[r] && right[r] <= right[l]) p = r;
        else if (left[r] <= left[l] && right[l] <= right[r]) p = l;
        if (p == -1) return 0;
        if (last == -1 || (left[p] <= left[last] && right[last] <= right[p])) {
            last = p;
            if (p == l) ++l;
            else --r;
        } else return 0;
    }
    int cnt = 0;
    REP(i, N) REP(j, N) cnt += !F[i][j];
    return cnt;
}

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 1 ms 348 KB ok
2 Correct 1 ms 436 KB ok
3 Correct 1 ms 348 KB ok
4 Correct 0 ms 348 KB ok
5 Correct 1 ms 348 KB ok
6 Partially correct 1 ms 348 KB partial
7 Partially correct 1 ms 344 KB partial
8 Partially correct 15 ms 2392 KB partial
9 Partially correct 258 ms 32084 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 436 KB ok
3 Partially correct 0 ms 348 KB partial
4 Partially correct 0 ms 344 KB partial
5 Partially correct 1 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 756 KB ok
10 Partially correct 1 ms 348 KB partial
11 Partially correct 1 ms 348 KB partial
12 Partially correct 1 ms 348 KB partial
13 Correct 1 ms 548 KB ok

Subtask #3
5.5 / 22.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 348 KB partial
2 Correct 1 ms 348 KB ok
3 Correct 1 ms 436 KB ok
4 Partially correct 0 ms 348 KB partial
5 Partially correct 0 ms 344 KB partial
6 Partially correct 1 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 756 KB ok
11 Partially correct 1 ms 348 KB partial
12 Partially correct 1 ms 348 KB partial
13 Partially correct 1 ms 348 KB partial
14 Correct 1 ms 548 KB ok
15 Partially correct 1 ms 348 KB partial
16 Partially correct 0 ms 348 KB partial
17 Partially correct 1 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 1 ms 348 KB ok
22 Partially correct 0 ms 348 KB partial
23 Partially correct 1 ms 348 KB partial
24 Partially correct 0 ms 348 KB partial
25 Partially correct 1 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 1 ms 348 KB partial
2 Correct 1 ms 348 KB ok
3 Correct 1 ms 436 KB ok
4 Correct 1 ms 348 KB ok
5 Correct 0 ms 348 KB ok
6 Partially correct 0 ms 348 KB partial
7 Partially correct 0 ms 344 KB partial
8 Partially correct 1 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 756 KB ok
13 Partially correct 1 ms 348 KB partial
14 Partially correct 1 ms 348 KB partial
15 Partially correct 1 ms 348 KB partial
16 Correct 1 ms 548 KB ok
17 Partially correct 1 ms 348 KB partial
18 Partially correct 0 ms 348 KB partial
19 Partially correct 1 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 1 ms 348 KB ok
24 Partially correct 0 ms 348 KB partial
25 Partially correct 1 ms 348 KB partial
26 Partially correct 0 ms 348 KB partial
27 Partially correct 1 ms 348 KB partial
28 Partially correct 1 ms 348 KB partial
29 Partially correct 1 ms 348 KB partial
30 Partially correct 1 ms 348 KB partial
31 Partially correct 1 ms 348 KB partial
32 Partially correct 1 ms 348 KB partial
33 Partially correct 1 ms 348 KB partial
34 Correct 0 ms 348 KB ok
35 Correct 1 ms 348 KB ok
36 Partially correct 1 ms 604 KB partial
37 Partially correct 1 ms 348 KB partial
38 Partially correct 1 ms 348 KB partial
39 Partially correct 1 ms 348 KB partial
40 Partially correct 1 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 1 ms 348 KB partial
2 Correct 1 ms 348 KB ok
3 Correct 1 ms 436 KB ok
4 Correct 1 ms 348 KB ok
5 Correct 0 ms 348 KB ok
6 Partially correct 0 ms 348 KB partial
7 Partially correct 0 ms 344 KB partial
8 Partially correct 1 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 756 KB ok
13 Partially correct 1 ms 348 KB partial
14 Partially correct 1 ms 348 KB partial
15 Partially correct 1 ms 348 KB partial
16 Correct 1 ms 548 KB ok
17 Partially correct 1 ms 348 KB partial
18 Partially correct 0 ms 348 KB partial
19 Partially correct 1 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 1 ms 348 KB ok
24 Partially correct 0 ms 348 KB partial
25 Partially correct 1 ms 348 KB partial
26 Partially correct 0 ms 348 KB partial
27 Partially correct 1 ms 348 KB partial
28 Partially correct 1 ms 348 KB partial
29 Partially correct 1 ms 348 KB partial
30 Partially correct 1 ms 348 KB partial
31 Partially correct 1 ms 348 KB partial
32 Partially correct 1 ms 348 KB partial
33 Partially correct 1 ms 348 KB partial
34 Correct 0 ms 348 KB ok
35 Correct 1 ms 348 KB ok
36 Partially correct 1 ms 604 KB partial
37 Partially correct 1 ms 348 KB partial
38 Partially correct 1 ms 348 KB partial
39 Partially correct 1 ms 348 KB partial
40 Partially correct 1 ms 348 KB partial
41 Partially correct 1 ms 348 KB partial
42 Partially correct 15 ms 2908 KB partial
43 Partially correct 16 ms 2908 KB partial
44 Partially correct 15 ms 2908 KB partial
45 Partially correct 17 ms 2908 KB partial
46 Partially correct 16 ms 2908 KB partial
47 Partially correct 15 ms 2676 KB partial
48 Correct 15 ms 2908 KB ok
49 Partially correct 20 ms 2908 KB partial
50 Partially correct 20 ms 2908 KB partial
51 Partially correct 15 ms 2908 KB partial
52 Partially correct 15 ms 2908 KB partial
53 Partially correct 16 ms 2908 KB partial
54 Partially correct 16 ms 2908 KB partial
55 Partially correct 16 ms 2912 KB partial
56 Partially correct 16 ms 2908 KB partial
57 Partially correct 15 ms 2908 KB partial
58 Partially correct 19 ms 2756 KB partial
59 Partially correct 15 ms 2908 KB partial

Subtask #6
7.5 / 30.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 348 KB partial
2 Correct 1 ms 348 KB ok
3 Correct 1 ms 436 KB ok
4 Correct 1 ms 348 KB ok
5 Correct 0 ms 348 KB ok
6 Correct 1 ms 348 KB ok
7 Partially correct 1 ms 348 KB partial
8 Partially correct 1 ms 344 KB partial
9 Partially correct 15 ms 2392 KB partial
10 Partially correct 258 ms 32084 KB partial
11 Partially correct 0 ms 348 KB partial
12 Partially correct 0 ms 344 KB partial
13 Partially correct 1 ms 348 KB partial
14 Partially correct 1 ms 348 KB partial
15 Partially correct 0 ms 348 KB partial
16 Correct 0 ms 348 KB ok
17 Correct 0 ms 756 KB ok
18 Partially correct 1 ms 348 KB partial
19 Partially correct 1 ms 348 KB partial
20 Partially correct 1 ms 348 KB partial
21 Correct 1 ms 548 KB ok
22 Partially correct 1 ms 348 KB partial
23 Partially correct 0 ms 348 KB partial
24 Partially correct 1 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 1 ms 348 KB ok
29 Partially correct 0 ms 348 KB partial
30 Partially correct 1 ms 348 KB partial
31 Partially correct 0 ms 348 KB partial
32 Partially correct 1 ms 348 KB partial
33 Partially correct 1 ms 348 KB partial
34 Partially correct 1 ms 348 KB partial
35 Partially correct 1 ms 348 KB partial
36 Partially correct 1 ms 348 KB partial
37 Partially correct 1 ms 348 KB partial
38 Partially correct 1 ms 348 KB partial
39 Correct 0 ms 348 KB ok
40 Correct 1 ms 348 KB ok
41 Partially correct 1 ms 604 KB partial
42 Partially correct 1 ms 348 KB partial
43 Partially correct 1 ms 348 KB partial
44 Partially correct 1 ms 348 KB partial
45 Partially correct 1 ms 348 KB partial
46 Partially correct 1 ms 348 KB partial
47 Partially correct 15 ms 2908 KB partial
48 Partially correct 16 ms 2908 KB partial
49 Partially correct 15 ms 2908 KB partial
50 Partially correct 17 ms 2908 KB partial
51 Partially correct 16 ms 2908 KB partial
52 Partially correct 15 ms 2676 KB partial
53 Correct 15 ms 2908 KB ok
54 Partially correct 20 ms 2908 KB partial
55 Partially correct 20 ms 2908 KB partial
56 Partially correct 15 ms 2908 KB partial
57 Partially correct 15 ms 2908 KB partial
58 Partially correct 16 ms 2908 KB partial
59 Partially correct 16 ms 2908 KB partial
60 Partially correct 16 ms 2912 KB partial
61 Partially correct 16 ms 2908 KB partial
62 Partially correct 15 ms 2908 KB partial
63 Partially correct 19 ms 2756 KB partial
64 Partially correct 15 ms 2908 KB partial
65 Partially correct 237 ms 39696 KB partial
66 Partially correct 270 ms 39572 KB partial
67 Partially correct 246 ms 39704 KB partial
68 Partially correct 257 ms 39704 KB partial
69 Partially correct 247 ms 39576 KB partial
70 Partially correct 242 ms 39640 KB partial
71 Partially correct 231 ms 39508 KB partial
72 Partially correct 238 ms 39576 KB partial
73 Correct 248 ms 39700 KB ok
74 Correct 240 ms 39580 KB ok
75 Partially correct 252 ms 39604 KB partial
76 Partially correct 243 ms 39684 KB partial
77 Partially correct 238 ms 39704 KB partial
78 Partially correct 236 ms 39704 KB partial
79 Partially correct 243 ms 39508 KB partial
80 Partially correct 244 ms 39704 KB partial
81 Partially correct 235 ms 39704 KB partial
82 Partially correct 242 ms 39696 KB partial
83 Partially correct 253 ms 39892 KB partial
84 Partially correct 236 ms 39532 KB partial
85 Partially correct 245 ms 39572 KB partial
86 Partially correct 250 ms 39824 KB partial
87 Partially correct 236 ms 39580 KB partial
88 Partially correct 236 ms 39564 KB partial
89 Partially correct 241 ms 39896 KB partial
90 Partially correct 239 ms 39560 KB partial
91 Partially correct 235 ms 39508 KB partial
92 Partially correct 242 ms 39608 KB partial
93 Partially correct 241 ms 39568 KB partial
94 Partially correct 239 ms 39684 KB partial
95 Partially correct 236 ms 39508 KB partial
96 Partially correct 238 ms 39508 KB partial
97 Partially correct 237 ms 39508 KB partial
98 Partially correct 246 ms 39564 KB partial
99 Partially correct 238 ms 39820 KB partial
100 Partially correct 238 ms 39520 KB partial
101 Partially correct 244 ms 39512 KB partial
102 Partially correct 240 ms 39832 KB partial
103 Partially correct 268 ms 39572 KB partial
104 Partially correct 237 ms 39512 KB partial
105 Partially correct 242 ms 39692 KB partial
106 Partially correct 234 ms 39692 KB partial
107 Partially correct 234 ms 39508 KB partial
108 Partially correct 258 ms 39832 KB partial
109 Partially correct 247 ms 39576 KB partial