oj.uz

답안 #1056279

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1056279 2024-08-13T08:36:44 Z Forested 송신탑 (IOI22_towers) C++17
41 / 100
 4000 ms 8032 KB 
#include <bits/stdc++.h>
using namespace std;

using i32 = int;
using i64 = long long;
template <typename T>
using V = vector<T>;
template <typename T>
using VV = V<V<T>>;
template <typename T>
using VVV = V<V<V<T>>>;

template <typename T>
bool chmin(T &x, const T &y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}
template <typename T>
bool chmax(T &x, const T &y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}

#define OVERRIDE4(a, b, c, d, ...) d
#define REP2(i, n) for (i32 i = 0; i < (i32)(n); ++i)
#define REP3(i, l, r) for (i32 i = (i32)(l); i < (i32)(r); ++i)
#define REP(...) OVERRIDE4(__VA_ARGS__, REP3, REP2)(__VA_ARGS__)
#define PER2(i, n) for (i32 i = (i32)(n)-1; i >= 0; --i)
#define PER3(i, l, r) for (i32 i = (i32)(r)-1; i >= (i32)(l); --i)
#define PER(...) OVERRIDE4(__VA_ARGS__, PER3, PER2)(__VA_ARGS__)
#define ALL(x) begin(x), end(x)
#define LEN(x) (i32) size(x)

void dbg(i32 x) { cerr << x; }
void dbg(i64 x) { cerr << x; }
template <typename T, typename U>
void dbg(pair<T, U> p) {
    cerr << '(' << p.first << ", " << p.second << ')';
}
template <typename T>
void dbg(V<T> arr) {
    cerr << '[';
    REP(i, LEN(arr)) {
        if (i) {
            cerr << ", ";
        }
        dbg(arr[i]);
    }
    cerr << ']';
}
void debug() { cerr << '\n'; }
template <typename Head, typename... Tail>
void debug(Head head, Tail... tail) {
    dbg(head);
    cerr << ", ";
    debug(tail...);
}
#ifdef DEBUGF
#define DBG(...)                       \
    do {                               \
        cerr << #__VA_ARGS__ << " : "; \
        debug(__VA_ARGS__);            \
    } while (false)
#else
#define DBG(...) (void)0
#endif

#include "towers.h"

constexpr i32 INF = 1001001001;

template <typename T>
i32 lob(const V<T> &arr, T v) {
    return (i32)(lower_bound(ALL(arr), v) - begin(arr));
}
template <typename T>
i32 upb(const V<T> &arr, T v) {
    return (i32)(upper_bound(ALL(arr), v) - begin(arr));
}


struct RMQ {
    i32 n;
    V<i32> dat;
    
    RMQ(i32 n) : n(n), dat(2 * n, -INF) {}
    
    void update(i32 idx, i32 val) {
        idx += n;
        dat[idx] = val;
        while ((idx /= 2) >= 1) {
            dat[idx] = max(dat[2 * idx], dat[2 * idx + 1]);
        }
    }
    
    i32 rmq(i32 l, i32 r) const {
        l += n;
        r += n;
        i32 m = -INF;
        while (l < r) {
            if (l & 1) {
                chmax(m, dat[l++]);
            }
            if (r & 1) {
                chmax(m, dat[--r]);
            }
            l /= 2;
            r /= 2;
        }
        return m;
    }
    
    void trc() const {
        V<i32> arr(n + ALL(dat));
        DBG(arr);
    }
};

i32 n;
V<i32> h;
V<i32> psum;
i32 peak;

void init(i32 _n, V<i32> _h) {
    n = _n;
    h = _h;
    
    psum.resize(n + 1, 0);
    REP(i, n) {
        psum[i + 1] = psum[i] + (0 < i && i < n - 1 && h[i - 1] < h[i] && h[i] > h[i + 1]);
    }
    
    {
        i32 mi = (i32)(max_element(ALL(h)) - begin(h));
        peak = mi;
        REP(i, mi) {
            if (h[i] > h[i + 1]) {
                peak = -1;
            }
        }
        REP(i, mi, n - 1) {
            if (h[i] < h[i + 1]) {
                peak = -1;
            }
        }
    }
}

i32 max_towers(i32 l, i32 r, i32 delta) {
    ++r;
    if (r - l == 1) {
        return 1;
    }
    
    if (delta == 1) {
        i32 ans = psum[r - 1] - psum[l + 1] + 1;
        return ans;
    }
    
    if (peak != -1) {
        if (l <= peak && peak < r && max(h[l], h[r - 1]) + delta <= h[peak]) {
            return 2;
        } else {
            return 1;
        }
    }
    
    V<i32> g(begin(h) + l, begin(h) + r);
    i32 m = r - l;
    
    V<i32> hs;
    hs.reserve(3 * m);
    REP(i, m) {
        hs.push_back(g[i] - delta);
        hs.push_back(g[i]);
        hs.push_back(g[i] + delta);
    }
    sort(ALL(hs));
    hs.erase(unique(ALL(hs)), end(hs));
    i32 k = LEN(hs);
    RMQ down(k);
    RMQ up(k);
    
    REP(i, m) {
        i32 d = max(1, up.rmq(lob(hs, g[i] + delta), k) + 1);
        i32 u = down.rmq(0, lob(hs, g[i] - delta) + 1);
        i32 idx = lob(hs, g[i]);
        down.update(idx, d);
        up.update(idx, u);
    }
    i32 ans = down.rmq(0, k);
    return ans;
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 259 ms 1368 KB Output is correct
2 Correct 485 ms 1880 KB Output is correct
3 Correct 530 ms 1880 KB Output is correct
4 Correct 517 ms 1848 KB Output is correct
5 Correct 455 ms 1880 KB Output is correct
6 Correct 509 ms 1880 KB Output is correct
7 Correct 500 ms 1880 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 576 KB Output is correct
31 Correct 2 ms 340 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 576 KB Output is correct
31 Correct 2 ms 340 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 15 ms 2368 KB Output is correct
37 Correct 31 ms 3848 KB Output is correct
38 Correct 15 ms 2256 KB Output is correct
39 Correct 27 ms 3616 KB Output is correct
40 Correct 14 ms 2256 KB Output is correct
41 Correct 71 ms 6804 KB Output is correct
42 Correct 8 ms 1880 KB Output is correct
43 Correct 7 ms 1880 KB Output is correct
44 Correct 7 ms 1856 KB Output is correct
45 Correct 15 ms 1880 KB Output is correct
46 Correct 8 ms 1880 KB Output is correct
47 Correct 15 ms 1856 KB Output is correct
48 Correct 8 ms 1880 KB Output is correct
49 Correct 15 ms 1880 KB Output is correct
50 Correct 14 ms 1856 KB Output is correct
51 Correct 7 ms 2132 KB Output is correct
52 Correct 8 ms 1856 KB Output is correct
53 Correct 7 ms 1964 KB Output is correct
54 Correct 7 ms 1880 KB Output is correct
55 Correct 11 ms 1968 KB Output is correct
56 Correct 7 ms 1876 KB Output is correct
57 Correct 71 ms 7392 KB Output is correct
58 Correct 79 ms 7632 KB Output is correct
59 Correct 78 ms 7796 KB Output is correct
60 Correct 79 ms 7888 KB Output is correct
61 Correct 87 ms 7856 KB Output is correct
62 Correct 79 ms 7632 KB Output is correct
63 Correct 89 ms 7632 KB Output is correct
64 Correct 17 ms 1880 KB Output is correct
65 Correct 7 ms 1880 KB Output is correct
66 Correct 43 ms 7632 KB Output is correct
67 Correct 44 ms 8032 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 369 ms 1880 KB Output is correct
2 Correct 522 ms 1880 KB Output is correct
3 Correct 474 ms 1880 KB Output is correct
4 Correct 545 ms 1880 KB Output is correct
5 Correct 527 ms 1856 KB Output is correct
6 Correct 453 ms 1880 KB Output is correct
7 Correct 516 ms 1880 KB Output is correct
8 Correct 500 ms 1880 KB Output is correct
9 Correct 501 ms 1880 KB Output is correct
10 Correct 536 ms 2132 KB Output is correct
11 Correct 547 ms 1880 KB Output is correct
12 Correct 531 ms 2132 KB Output is correct
13 Correct 557 ms 1880 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 8 ms 1880 KB Output is correct
18 Correct 7 ms 1856 KB Output is correct
19 Correct 8 ms 1880 KB Output is correct
20 Correct 7 ms 1860 KB Output is correct
21 Correct 7 ms 1880 KB Output is correct
22 Correct 8 ms 1880 KB Output is correct
23 Correct 8 ms 1880 KB Output is correct
24 Correct 7 ms 1968 KB Output is correct
25 Correct 7 ms 1880 KB Output is correct
26 Correct 7 ms 1880 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 1 ms 344 KB Output is correct

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4056 ms 2312 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 576 KB Output is correct
31 Correct 2 ms 340 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 15 ms 2368 KB Output is correct
37 Correct 31 ms 3848 KB Output is correct
38 Correct 15 ms 2256 KB Output is correct
39 Correct 27 ms 3616 KB Output is correct
40 Correct 14 ms 2256 KB Output is correct
41 Correct 71 ms 6804 KB Output is correct
42 Correct 8 ms 1880 KB Output is correct
43 Correct 7 ms 1880 KB Output is correct
44 Correct 7 ms 1856 KB Output is correct
45 Correct 15 ms 1880 KB Output is correct
46 Correct 8 ms 1880 KB Output is correct
47 Correct 15 ms 1856 KB Output is correct
48 Correct 8 ms 1880 KB Output is correct
49 Correct 15 ms 1880 KB Output is correct
50 Correct 14 ms 1856 KB Output is correct
51 Correct 7 ms 2132 KB Output is correct
52 Correct 8 ms 1856 KB Output is correct
53 Correct 7 ms 1964 KB Output is correct
54 Correct 7 ms 1880 KB Output is correct
55 Correct 11 ms 1968 KB Output is correct
56 Correct 7 ms 1876 KB Output is correct
57 Correct 71 ms 7392 KB Output is correct
58 Correct 79 ms 7632 KB Output is correct
59 Correct 78 ms 7796 KB Output is correct
60 Correct 79 ms 7888 KB Output is correct
61 Correct 87 ms 7856 KB Output is correct
62 Correct 79 ms 7632 KB Output is correct
63 Correct 89 ms 7632 KB Output is correct
64 Correct 17 ms 1880 KB Output is correct
65 Correct 7 ms 1880 KB Output is correct
66 Correct 43 ms 7632 KB Output is correct
67 Correct 44 ms 8032 KB Output is correct
68 Correct 369 ms 1880 KB Output is correct
69 Correct 522 ms 1880 KB Output is correct
70 Correct 474 ms 1880 KB Output is correct
71 Correct 545 ms 1880 KB Output is correct
72 Correct 527 ms 1856 KB Output is correct
73 Correct 453 ms 1880 KB Output is correct
74 Correct 516 ms 1880 KB Output is correct
75 Correct 500 ms 1880 KB Output is correct
76 Correct 501 ms 1880 KB Output is correct
77 Correct 536 ms 2132 KB Output is correct
78 Correct 547 ms 1880 KB Output is correct
79 Correct 531 ms 2132 KB Output is correct
80 Correct 557 ms 1880 KB Output is correct
81 Correct 0 ms 344 KB Output is correct
82 Correct 1 ms 344 KB Output is correct
83 Correct 0 ms 344 KB Output is correct
84 Correct 8 ms 1880 KB Output is correct
85 Correct 7 ms 1856 KB Output is correct
86 Correct 8 ms 1880 KB Output is correct
87 Correct 7 ms 1860 KB Output is correct
88 Correct 7 ms 1880 KB Output is correct
89 Correct 8 ms 1880 KB Output is correct
90 Correct 8 ms 1880 KB Output is correct
91 Correct 7 ms 1968 KB Output is correct
92 Correct 7 ms 1880 KB Output is correct
93 Correct 7 ms 1880 KB Output is correct
94 Correct 0 ms 344 KB Output is correct
95 Correct 0 ms 344 KB Output is correct
96 Correct 0 ms 344 KB Output is correct
97 Correct 0 ms 344 KB Output is correct
98 Correct 1 ms 344 KB Output is correct
99 Correct 1 ms 344 KB Output is correct
100 Correct 0 ms 344 KB Output is correct
101 Correct 0 ms 344 KB Output is correct
102 Correct 0 ms 344 KB Output is correct
103 Correct 1 ms 344 KB Output is correct
104 Execution timed out 4051 ms 6920 KB Time limit exceeded
105 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 259 ms 1368 KB Output is correct
2 Correct 485 ms 1880 KB Output is correct
3 Correct 530 ms 1880 KB Output is correct
4 Correct 517 ms 1848 KB Output is correct
5 Correct 455 ms 1880 KB Output is correct
6 Correct 509 ms 1880 KB Output is correct
7 Correct 500 ms 1880 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 1 ms 344 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 1 ms 344 KB Output is correct
40 Correct 1 ms 576 KB Output is correct
41 Correct 2 ms 340 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 0 ms 344 KB Output is correct
44 Correct 1 ms 344 KB Output is correct
45 Correct 1 ms 344 KB Output is correct
46 Correct 15 ms 2368 KB Output is correct
47 Correct 31 ms 3848 KB Output is correct
48 Correct 15 ms 2256 KB Output is correct
49 Correct 27 ms 3616 KB Output is correct
50 Correct 14 ms 2256 KB Output is correct
51 Correct 71 ms 6804 KB Output is correct
52 Correct 8 ms 1880 KB Output is correct
53 Correct 7 ms 1880 KB Output is correct
54 Correct 7 ms 1856 KB Output is correct
55 Correct 15 ms 1880 KB Output is correct
56 Correct 8 ms 1880 KB Output is correct
57 Correct 15 ms 1856 KB Output is correct
58 Correct 8 ms 1880 KB Output is correct
59 Correct 15 ms 1880 KB Output is correct
60 Correct 14 ms 1856 KB Output is correct
61 Correct 7 ms 2132 KB Output is correct
62 Correct 8 ms 1856 KB Output is correct
63 Correct 7 ms 1964 KB Output is correct
64 Correct 7 ms 1880 KB Output is correct
65 Correct 11 ms 1968 KB Output is correct
66 Correct 7 ms 1876 KB Output is correct
67 Correct 71 ms 7392 KB Output is correct
68 Correct 79 ms 7632 KB Output is correct
69 Correct 78 ms 7796 KB Output is correct
70 Correct 79 ms 7888 KB Output is correct
71 Correct 87 ms 7856 KB Output is correct
72 Correct 79 ms 7632 KB Output is correct
73 Correct 89 ms 7632 KB Output is correct
74 Correct 17 ms 1880 KB Output is correct
75 Correct 7 ms 1880 KB Output is correct
76 Correct 43 ms 7632 KB Output is correct
77 Correct 44 ms 8032 KB Output is correct
78 Correct 369 ms 1880 KB Output is correct
79 Correct 522 ms 1880 KB Output is correct
80 Correct 474 ms 1880 KB Output is correct
81 Correct 545 ms 1880 KB Output is correct
82 Correct 527 ms 1856 KB Output is correct
83 Correct 453 ms 1880 KB Output is correct
84 Correct 516 ms 1880 KB Output is correct
85 Correct 500 ms 1880 KB Output is correct
86 Correct 501 ms 1880 KB Output is correct
87 Correct 536 ms 2132 KB Output is correct
88 Correct 547 ms 1880 KB Output is correct
89 Correct 531 ms 2132 KB Output is correct
90 Correct 557 ms 1880 KB Output is correct
91 Correct 0 ms 344 KB Output is correct
92 Correct 1 ms 344 KB Output is correct
93 Correct 0 ms 344 KB Output is correct
94 Correct 8 ms 1880 KB Output is correct
95 Correct 7 ms 1856 KB Output is correct
96 Correct 8 ms 1880 KB Output is correct
97 Correct 7 ms 1860 KB Output is correct
98 Correct 7 ms 1880 KB Output is correct
99 Correct 8 ms 1880 KB Output is correct
100 Correct 8 ms 1880 KB Output is correct
101 Correct 7 ms 1968 KB Output is correct
102 Correct 7 ms 1880 KB Output is correct
103 Correct 7 ms 1880 KB Output is correct
104 Correct 0 ms 344 KB Output is correct
105 Correct 0 ms 344 KB Output is correct
106 Correct 0 ms 344 KB Output is correct
107 Correct 0 ms 344 KB Output is correct
108 Correct 1 ms 344 KB Output is correct
109 Correct 1 ms 344 KB Output is correct
110 Correct 0 ms 344 KB Output is correct
111 Correct 0 ms 344 KB Output is correct
112 Correct 0 ms 344 KB Output is correct
113 Correct 1 ms 344 KB Output is correct
114 Execution timed out 4056 ms 2312 KB Time limit exceeded
115 Halted 0 ms 0 KB -