oj.uz

답안 #679530

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
679530 2023-01-08T12:54:14 Z elkernos Fish 2 (JOI22_fish2) C++17
100 / 100
 3173 ms 17728 KB 
// while (clock()<=69*CLOCKS_PER_SEC)
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("O3")
// #pragma GCC target ("avx2")
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// #pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>

using namespace std;

#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x)                                                                    \
    sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<(c i) \
    {
sim > struct rge {
    c b, e;
};
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c *x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef XOX
    ~debug()
    {
        cerr << endl;
    }
    eni(!=) cerr << boolalpha << i;
    ris;
} eni(==) ris << range(begin(i), end(i));
}
sim, class b dor(pair<b, c> d)
{
    ris << "" << d.first << " --> " << d.second << "";
}
sim dor(rge<c> d)
{
    *this << "[";
    for (auto it = d.b; it != d.e; ++it)
        *this << ", " + 2 * (it == d.b) << *it;
    ris << "]";
}
#else
    sim dor(const c &)
    {
        ris;
    }
#endif
}
;
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

#ifdef XOX
#warning Times may differ!!!
#endif

#define endl '\n'
#define pb emplace_back
#define vt vector
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

const int nax = 100 * 1007;
const ll oo = 1e17;

int n;
#define lc 2 * v
#define rc 2 * v + 1
#define m (l + r) / 2
struct CMin {
    struct Node {
        pii p = {0, 1};
        int lazy = 0;
        void dod(int x)
        {
            p.first += x;
            lazy += x;
        }
    };
    Node nothing = {{n + 213, 0}, 0};
    friend Node operator+(const Node &l, const Node &r)
    {
        Node ret;
        ret.p = min(l.p, r.p);
        if (l.p.first == r.p.first) ret.p.second = l.p.second + r.p.second;
        return ret;
    }
    Node tree[4 * nax];
    void push(int v)
    {
        for (auto to : {lc, rc})
            tree[to].dod(tree[v].lazy);
        tree[v].lazy = 0;
    }
    void build(int v = 1, int l = 0, int r = n + 1)
    {
        if (l == r) {
            tree[v].p.second = 1;
            return;
        }
        build(lc, l, m), build(rc, m + 1, r);
        tree[v] = tree[lc] + tree[rc];
    }
    void add(int ql, int qr, int x, int v = 1, int l = 0, int r = n + 1)
    {
        if (r < ql || qr < l) return;
        if (ql <= l && r <= qr) {
            tree[v].dod(x);
            return;
        }
        push(v);
        add(ql, qr, x, lc, l, m);
        add(ql, qr, x, rc, m + 1, r);
        tree[v] = tree[lc] + tree[rc];
    }
    Node query(int ql, int qr, int v = 1, int l = 0, int r = n + 1)
    {
        if (r < ql || qr < l) return nothing;
        if (ql <= l && r <= qr) return tree[v];
        push(v);
        return query(ql, qr, lc, l, m) +
               query(ql, qr, rc, m + 1, r);
    }
};
struct Sum {
    typedef ll T;
    static constexpr T unit = 0;
    T f(T a, T b) { return a + b; } // (any associative fn)
    vector<T> s;
    int n;
    Sum(int nd = nax, T def = unit) : s(2 * nd, def), n(nd) {}
    void update(int pos, T val)
    {
        for (s[pos += n] = val; pos /= 2;)
            s[pos] = f(s[pos * 2], s[pos * 2 + 1]);
    }
    T query(int b, int e)
    {
        T ra = unit, rb = unit;
        for (b += n, e += n + 1; b < e; b /= 2, e /= 2) {
            if (b % 2) ra = f(ra, s[b++]);
            if (e % 2) rb = f(s[--e], rb);
        }
        return f(ra, rb);
    }
};
struct Max {
    ll tree[4 * nax];
    void update(int pos, ll to, int v = 1, int l = 0, int r = n + 1)
    {
        if (pos < l || r < pos) return;
        if (l == r) {
            tree[v] = to;
            return;
        }
        update(pos, to, lc, l, m);
        update(pos, to, rc, m + 1, r);
        tree[v] = max(tree[lc], tree[rc]);
    }
    int maxPrawo(int ogr, ll od, int v = 1, int l = 0, int r = n + 1)
    {
        if (tree[v] <= od) return -1;
        if (l == r) return l;
        if (ogr <= m) return maxPrawo(ogr, od, lc, l, m);
        int ret = maxPrawo(ogr, od, rc, m + 1, r);
        return ret != -1 ? ret : maxPrawo(ogr, od, lc, l, m);
    }
    int maxLewo(int ogr, ll od, int v = 1, int l = 0, int r = n + 1)
    {
        if (tree[v] <= od) return -1;
        if (l == r) return l;
        if (m < ogr) return maxLewo(ogr, od, rc, m + 1, r);
        int ret = maxLewo(ogr, od, lc, l, m);
        return ret != -1 ? ret : maxLewo(ogr, od, rc, m + 1, r);
    }
};

int main()
{
    cin.tie(0)->sync_with_stdio(0);
    cin >> n;
    CMin intervals;
    Sum getsum;
    Max getmax;
    vt<ll> a(n + 2);
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    a[0] = a[n + 1] = oo;
    for (int i = 0; i <= n + 1; i++) {
        getsum.update(i, a[i]);
        getmax.update(i, a[i]);
    }
    intervals.build();
    set<pair<int, int>> alive;
    auto good = [&](int l, int r) {
        if (r - l + 1 <= 2) return false;
        return getsum.query(l + 1, r - 1) < min(a[l], a[r]);
    };
    auto wsadz = [&](int l, int r, int x) {
        if (x == +1) {
            if (!alive.count({l, r})) {
                debug() << imie(l) imie(r) imie(x);
                alive.emplace(l, r);
                intervals.add(l + 1, r - 1, +1);
            }
        }
        if (x == -1) {
            if (alive.count({l, r})) {
                debug() << imie(l) imie(r) imie(x);
                alive.erase({l, r});
                intervals.add(l + 1, r - 1, -1);
            }
        }
    };
    auto wezL = [&](int l, int r) {
        return getmax.maxPrawo(l - 1, getsum.query(l, r - 1));
    };
    auto wezR = [&](int l, int r) {
        return getmax.maxLewo(r + 1, getsum.query(l + 1, r));
    };
    auto findboth = [&](int p, int x) {
        int l = p - 1, r = p + 1;
        while (1) {
            if (good(l, r)) wsadz(l, r, x);
            if (l == 0 && r == n + 1) break;
            if (a[l] < a[r]) l = wezL(l, r);
            else r = wezR(l, r);
        }
    };
    auto findpresuf = [&](int p, int x) {
        int r = wezR(p, p);
        while (1) {
            if (good(p, r)) wsadz(p, r, x);
            if (r == n + 1) break;
            r = wezR(p, r);
        }
        int l = wezL(p, p);
        while (1) {
            if (good(l, p)) wsadz(l, p, x);
            if (l == 0) break;
            l = wezL(l, p);
        }
    };
    for (int i = 1; i <= n; i++) {
        findboth(i, +1);
        findpresuf(i, +1);
    }
    int q;
    cin >> q;
    while (q--) {
        int type;
        cin >> type;
        if (type == 1) {
            int i, x;
            cin >> i >> x;
            findboth(i, -1);
            findpresuf(i, -1);
            a[i] = x;
            getsum.update(i, x);
            getmax.update(i, x);
            findboth(i, +1);
            findpresuf(i, +1);
        }
        else {
            int l, r;
            cin >> l >> r;
            int real_l = l, real_r = r;
            int lp = l + 1, rp = r - 1;
            while (lp <= r) {
                if (getsum.query(l, lp - 1) < a[lp]) real_l = lp;
                lp = wezR(l, lp);
            }
            while (l <= rp) {
                if (getsum.query(rp + 1, r) < a[rp]) real_r = rp;
                rp = wezL(rp, r);
            }
            cout << intervals.query(real_l, real_r).p.second << endl;
        }
    }
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 4 ms 9684 KB Output is correct
3 Correct 5 ms 9680 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 15 ms 9812 KB Output is correct
6 Correct 11 ms 9812 KB Output is correct
7 Correct 14 ms 9812 KB Output is correct
8 Correct 11 ms 9736 KB Output is correct
9 Correct 10 ms 9736 KB Output is correct
10 Correct 7 ms 9812 KB Output is correct
11 Correct 6 ms 9756 KB Output is correct
12 Correct 10 ms 9812 KB Output is correct
13 Correct 8 ms 9812 KB Output is correct
14 Correct 9 ms 9744 KB Output is correct
15 Correct 10 ms 9812 KB Output is correct
16 Correct 9 ms 9740 KB Output is correct
17 Correct 10 ms 9812 KB Output is correct
18 Correct 7 ms 9776 KB Output is correct
19 Correct 8 ms 9812 KB Output is correct
20 Correct 7 ms 9812 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 675 ms 14536 KB Output is correct
3 Correct 902 ms 14068 KB Output is correct
4 Correct 683 ms 14700 KB Output is correct
5 Correct 880 ms 14076 KB Output is correct
6 Correct 210 ms 12476 KB Output is correct
7 Correct 582 ms 11704 KB Output is correct
8 Correct 206 ms 12516 KB Output is correct
9 Correct 564 ms 11860 KB Output is correct
10 Correct 668 ms 12356 KB Output is correct
11 Correct 887 ms 12224 KB Output is correct
12 Correct 295 ms 12296 KB Output is correct
13 Correct 322 ms 12348 KB Output is correct
14 Correct 268 ms 13652 KB Output is correct
15 Correct 271 ms 13652 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 4 ms 9684 KB Output is correct
3 Correct 5 ms 9680 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 15 ms 9812 KB Output is correct
6 Correct 11 ms 9812 KB Output is correct
7 Correct 14 ms 9812 KB Output is correct
8 Correct 11 ms 9736 KB Output is correct
9 Correct 10 ms 9736 KB Output is correct
10 Correct 7 ms 9812 KB Output is correct
11 Correct 6 ms 9756 KB Output is correct
12 Correct 10 ms 9812 KB Output is correct
13 Correct 8 ms 9812 KB Output is correct
14 Correct 9 ms 9744 KB Output is correct
15 Correct 10 ms 9812 KB Output is correct
16 Correct 9 ms 9740 KB Output is correct
17 Correct 10 ms 9812 KB Output is correct
18 Correct 7 ms 9776 KB Output is correct
19 Correct 8 ms 9812 KB Output is correct
20 Correct 7 ms 9812 KB Output is correct
21 Correct 5 ms 9684 KB Output is correct
22 Correct 675 ms 14536 KB Output is correct
23 Correct 902 ms 14068 KB Output is correct
24 Correct 683 ms 14700 KB Output is correct
25 Correct 880 ms 14076 KB Output is correct
26 Correct 210 ms 12476 KB Output is correct
27 Correct 582 ms 11704 KB Output is correct
28 Correct 206 ms 12516 KB Output is correct
29 Correct 564 ms 11860 KB Output is correct
30 Correct 668 ms 12356 KB Output is correct
31 Correct 887 ms 12224 KB Output is correct
32 Correct 295 ms 12296 KB Output is correct
33 Correct 322 ms 12348 KB Output is correct
34 Correct 268 ms 13652 KB Output is correct
35 Correct 271 ms 13652 KB Output is correct
36 Correct 697 ms 15648 KB Output is correct
37 Correct 911 ms 14808 KB Output is correct
38 Correct 868 ms 14080 KB Output is correct
39 Correct 721 ms 15852 KB Output is correct
40 Correct 869 ms 14116 KB Output is correct
41 Correct 214 ms 13508 KB Output is correct
42 Correct 214 ms 13604 KB Output is correct
43 Correct 564 ms 12012 KB Output is correct
44 Correct 595 ms 11916 KB Output is correct
45 Correct 756 ms 13376 KB Output is correct
46 Correct 719 ms 13112 KB Output is correct
47 Correct 835 ms 11756 KB Output is correct
48 Correct 304 ms 12580 KB Output is correct
49 Correct 302 ms 12684 KB Output is correct
50 Correct 277 ms 14248 KB Output is correct
51 Correct 279 ms 14156 KB Output is correct
52 Correct 272 ms 14252 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 675 ms 14536 KB Output is correct
3 Correct 902 ms 14068 KB Output is correct
4 Correct 683 ms 14700 KB Output is correct
5 Correct 880 ms 14076 KB Output is correct
6 Correct 210 ms 12476 KB Output is correct
7 Correct 582 ms 11704 KB Output is correct
8 Correct 206 ms 12516 KB Output is correct
9 Correct 564 ms 11860 KB Output is correct
10 Correct 668 ms 12356 KB Output is correct
11 Correct 887 ms 12224 KB Output is correct
12 Correct 295 ms 12296 KB Output is correct
13 Correct 322 ms 12348 KB Output is correct
14 Correct 268 ms 13652 KB Output is correct
15 Correct 271 ms 13652 KB Output is correct
16 Correct 5 ms 9684 KB Output is correct
17 Correct 1464 ms 14616 KB Output is correct
18 Correct 1143 ms 17428 KB Output is correct
19 Correct 1474 ms 16408 KB Output is correct
20 Correct 1444 ms 16204 KB Output is correct
21 Correct 1436 ms 16132 KB Output is correct
22 Correct 1149 ms 17332 KB Output is correct
23 Correct 1417 ms 15992 KB Output is correct
24 Correct 1747 ms 16452 KB Output is correct
25 Correct 1537 ms 16328 KB Output is correct
26 Correct 1597 ms 16544 KB Output is correct
27 Correct 397 ms 15472 KB Output is correct
28 Correct 393 ms 15404 KB Output is correct
29 Correct 392 ms 15488 KB Output is correct
30 Correct 1195 ms 13552 KB Output is correct
31 Correct 1227 ms 13552 KB Output is correct
32 Correct 1674 ms 14228 KB Output is correct
33 Correct 1045 ms 14752 KB Output is correct
34 Correct 1723 ms 13964 KB Output is correct
35 Correct 1454 ms 13508 KB Output is correct
36 Correct 1362 ms 14988 KB Output is correct
37 Correct 609 ms 14196 KB Output is correct
38 Correct 551 ms 14180 KB Output is correct
39 Correct 583 ms 16116 KB Output is correct
40 Correct 579 ms 16204 KB Output is correct

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 675 ms 14536 KB Output is correct
3 Correct 902 ms 14068 KB Output is correct
4 Correct 683 ms 14700 KB Output is correct
5 Correct 880 ms 14076 KB Output is correct
6 Correct 210 ms 12476 KB Output is correct
7 Correct 582 ms 11704 KB Output is correct
8 Correct 206 ms 12516 KB Output is correct
9 Correct 564 ms 11860 KB Output is correct
10 Correct 668 ms 12356 KB Output is correct
11 Correct 887 ms 12224 KB Output is correct
12 Correct 295 ms 12296 KB Output is correct
13 Correct 322 ms 12348 KB Output is correct
14 Correct 268 ms 13652 KB Output is correct
15 Correct 271 ms 13652 KB Output is correct
16 Correct 5 ms 9684 KB Output is correct
17 Correct 3015 ms 14616 KB Output is correct
18 Correct 2327 ms 14660 KB Output is correct
19 Correct 2896 ms 14324 KB Output is correct
20 Correct 2066 ms 14860 KB Output is correct
21 Correct 3068 ms 14700 KB Output is correct
22 Correct 2433 ms 14616 KB Output is correct
23 Correct 3136 ms 14372 KB Output is correct
24 Correct 2267 ms 14660 KB Output is correct
25 Correct 2829 ms 14292 KB Output is correct
26 Correct 755 ms 12876 KB Output is correct
27 Correct 947 ms 12748 KB Output is correct
28 Correct 1501 ms 13588 KB Output is correct
29 Correct 844 ms 12820 KB Output is correct
30 Correct 950 ms 12792 KB Output is correct
31 Correct 1723 ms 13540 KB Output is correct
32 Correct 2239 ms 13964 KB Output is correct
33 Correct 1688 ms 12288 KB Output is correct
34 Correct 1915 ms 14368 KB Output is correct
35 Correct 1303 ms 12632 KB Output is correct
36 Correct 1957 ms 13868 KB Output is correct
37 Correct 1333 ms 13640 KB Output is correct
38 Correct 983 ms 13448 KB Output is correct
39 Correct 915 ms 13992 KB Output is correct
40 Correct 576 ms 14156 KB Output is correct

Subtask #6
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 4 ms 9684 KB Output is correct
3 Correct 5 ms 9680 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 15 ms 9812 KB Output is correct
6 Correct 11 ms 9812 KB Output is correct
7 Correct 14 ms 9812 KB Output is correct
8 Correct 11 ms 9736 KB Output is correct
9 Correct 10 ms 9736 KB Output is correct
10 Correct 7 ms 9812 KB Output is correct
11 Correct 6 ms 9756 KB Output is correct
12 Correct 10 ms 9812 KB Output is correct
13 Correct 8 ms 9812 KB Output is correct
14 Correct 9 ms 9744 KB Output is correct
15 Correct 10 ms 9812 KB Output is correct
16 Correct 9 ms 9740 KB Output is correct
17 Correct 10 ms 9812 KB Output is correct
18 Correct 7 ms 9776 KB Output is correct
19 Correct 8 ms 9812 KB Output is correct
20 Correct 7 ms 9812 KB Output is correct
21 Correct 5 ms 9684 KB Output is correct
22 Correct 675 ms 14536 KB Output is correct
23 Correct 902 ms 14068 KB Output is correct
24 Correct 683 ms 14700 KB Output is correct
25 Correct 880 ms 14076 KB Output is correct
26 Correct 210 ms 12476 KB Output is correct
27 Correct 582 ms 11704 KB Output is correct
28 Correct 206 ms 12516 KB Output is correct
29 Correct 564 ms 11860 KB Output is correct
30 Correct 668 ms 12356 KB Output is correct
31 Correct 887 ms 12224 KB Output is correct
32 Correct 295 ms 12296 KB Output is correct
33 Correct 322 ms 12348 KB Output is correct
34 Correct 268 ms 13652 KB Output is correct
35 Correct 271 ms 13652 KB Output is correct
36 Correct 697 ms 15648 KB Output is correct
37 Correct 911 ms 14808 KB Output is correct
38 Correct 868 ms 14080 KB Output is correct
39 Correct 721 ms 15852 KB Output is correct
40 Correct 869 ms 14116 KB Output is correct
41 Correct 214 ms 13508 KB Output is correct
42 Correct 214 ms 13604 KB Output is correct
43 Correct 564 ms 12012 KB Output is correct
44 Correct 595 ms 11916 KB Output is correct
45 Correct 756 ms 13376 KB Output is correct
46 Correct 719 ms 13112 KB Output is correct
47 Correct 835 ms 11756 KB Output is correct
48 Correct 304 ms 12580 KB Output is correct
49 Correct 302 ms 12684 KB Output is correct
50 Correct 277 ms 14248 KB Output is correct
51 Correct 279 ms 14156 KB Output is correct
52 Correct 272 ms 14252 KB Output is correct
53 Correct 5 ms 9684 KB Output is correct
54 Correct 1464 ms 14616 KB Output is correct
55 Correct 1143 ms 17428 KB Output is correct
56 Correct 1474 ms 16408 KB Output is correct
57 Correct 1444 ms 16204 KB Output is correct
58 Correct 1436 ms 16132 KB Output is correct
59 Correct 1149 ms 17332 KB Output is correct
60 Correct 1417 ms 15992 KB Output is correct
61 Correct 1747 ms 16452 KB Output is correct
62 Correct 1537 ms 16328 KB Output is correct
63 Correct 1597 ms 16544 KB Output is correct
64 Correct 397 ms 15472 KB Output is correct
65 Correct 393 ms 15404 KB Output is correct
66 Correct 392 ms 15488 KB Output is correct
67 Correct 1195 ms 13552 KB Output is correct
68 Correct 1227 ms 13552 KB Output is correct
69 Correct 1674 ms 14228 KB Output is correct
70 Correct 1045 ms 14752 KB Output is correct
71 Correct 1723 ms 13964 KB Output is correct
72 Correct 1454 ms 13508 KB Output is correct
73 Correct 1362 ms 14988 KB Output is correct
74 Correct 609 ms 14196 KB Output is correct
75 Correct 551 ms 14180 KB Output is correct
76 Correct 583 ms 16116 KB Output is correct
77 Correct 579 ms 16204 KB Output is correct
78 Correct 5 ms 9684 KB Output is correct
79 Correct 3015 ms 14616 KB Output is correct
80 Correct 2327 ms 14660 KB Output is correct
81 Correct 2896 ms 14324 KB Output is correct
82 Correct 2066 ms 14860 KB Output is correct
83 Correct 3068 ms 14700 KB Output is correct
84 Correct 2433 ms 14616 KB Output is correct
85 Correct 3136 ms 14372 KB Output is correct
86 Correct 2267 ms 14660 KB Output is correct
87 Correct 2829 ms 14292 KB Output is correct
88 Correct 755 ms 12876 KB Output is correct
89 Correct 947 ms 12748 KB Output is correct
90 Correct 1501 ms 13588 KB Output is correct
91 Correct 844 ms 12820 KB Output is correct
92 Correct 950 ms 12792 KB Output is correct
93 Correct 1723 ms 13540 KB Output is correct
94 Correct 2239 ms 13964 KB Output is correct
95 Correct 1688 ms 12288 KB Output is correct
96 Correct 1915 ms 14368 KB Output is correct
97 Correct 1303 ms 12632 KB Output is correct
98 Correct 1957 ms 13868 KB Output is correct
99 Correct 1333 ms 13640 KB Output is correct
100 Correct 983 ms 13448 KB Output is correct
101 Correct 915 ms 13992 KB Output is correct
102 Correct 576 ms 14156 KB Output is correct
103 Correct 3173 ms 15568 KB Output is correct
104 Correct 1980 ms 17728 KB Output is correct
105 Correct 1758 ms 16428 KB Output is correct
106 Correct 1524 ms 16748 KB Output is correct
107 Correct 2872 ms 15700 KB Output is correct
108 Correct 2003 ms 17464 KB Output is correct
109 Correct 1897 ms 16056 KB Output is correct
110 Correct 1735 ms 16696 KB Output is correct
111 Correct 1747 ms 16484 KB Output is correct
112 Correct 1539 ms 16768 KB Output is correct
113 Correct 828 ms 15428 KB Output is correct
114 Correct 463 ms 15492 KB Output is correct
115 Correct 1652 ms 15532 KB Output is correct
116 Correct 1274 ms 15388 KB Output is correct
117 Correct 516 ms 15412 KB Output is correct
118 Correct 1071 ms 14704 KB Output is correct
119 Correct 943 ms 15456 KB Output is correct
120 Correct 1554 ms 15452 KB Output is correct
121 Correct 1222 ms 15408 KB Output is correct
122 Correct 2182 ms 15872 KB Output is correct
123 Correct 1516 ms 13820 KB Output is correct
124 Correct 1537 ms 15084 KB Output is correct
125 Correct 1383 ms 13672 KB Output is correct
126 Correct 1466 ms 14892 KB Output is correct
127 Correct 1375 ms 15204 KB Output is correct
128 Correct 696 ms 14576 KB Output is correct
129 Correct 965 ms 16108 KB Output is correct
130 Correct 648 ms 16052 KB Output is correct