oj.uz

답안 #590614

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
590614 2022-07-06T07:31:24 Z balbit Fish 2 (JOI22_fish2) C++14
100 / 100
 3950 ms 14472 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
using namespace std;
#define int ll
#define ll long long
#define pii pair<ll, ll>
#define f first
#define s second

#define ALL(x) (x).begin(), (x).end()
#define SZ(x) (int)(x).size()
#define pb push_back


#define MX(a,b) a = max(a,b)
#define MN(a,b) a = min(a,b)

#define FOR(i,a,b) for (int i = a; i<b; ++i)
#define REP(i,n) FOR(i,0,n)
#define REP1(i,n) FOR(i,1,n+1)

#ifdef BALBIT
#define bug(...) cerr<<"#"<<__LINE__<<": "<<#__VA_ARGS__<<"- ", _do(__VA_ARGS__)
template<typename T> void _do( T && x ){cerr<<x<<endl;}
template<typename T, typename ...S> void _do( T && x, S && ...y){cerr<<x<<", "; _do(y...);}
#else
#define bug(...)
#define endl '\n'
#endif // BALBIT

const int maxn = 1e5+5;
const int inf = 0x3f3f3f3f;
int n,q;
int A[maxn];


namespace VS{ // value seg tree
    int mn[maxn*4], tg[maxn*4], cnt[maxn*4];
    inline void push(int o, int l, int r) {
        if (tg[o]) {
            mn[o] += tg[o];
            if (l != r) {
                tg[o*2] += tg[o];
                tg[o*2+1] += tg[o];
            }
            tg[o] = 0;
        }
    }
    void pull(int o) {
        mn[o] = min(mn[o*2], mn[o*2+1]);
        cnt[o] = 0;
        if (mn[o*2] == mn[o]) cnt[o] += cnt[o*2];
        if (mn[o*2+1] == mn[o]) cnt[o] += cnt[o*2+1];
    }
    void build(int o=1, int l=0, int r=maxn-1){
        if (l == r) {
            cnt[o] = 1;
            if (l < n) {
                mn[o] = 0;
            }else mn[o] = 1;
            return;
        }
        int mid = (l+r)/2;
        build(o*2,l,mid); build(o*2+1,mid+1,r);
        pull(o);
    }
    void MO(int L, int R, int v, int o=1, int l=0, int r=maxn-1) {
        push(o,l,r);
        if (l > R || r < L) return;
        if (l >= L && r <= R) {
            tg[o] += v; push(o,l,r); return;
        }
        int mid = (l+r)/2;
        MO(L,R,v,o*2,l,mid); MO(L,R,v,o*2+1,mid+1,r);
        pull(o);
    }
    int QU(int L, int R, int o=1, int l=0, int r=maxn-1) {
        if (l > R || r < L) return 0;
        push(o,l,r);
        if (l >= L && r <= R) {
            return mn[o]<=0?cnt[o]:0;
        }
        int mid = (l+r)/2;
        return QU(L,R,o*2,l,mid) + QU(L,R,o*2+1,mid+1,r);
    }
};

namespace NXTS{ // next value seg tree
    int mx[maxn*4];

    void build(int o=1, int l=0, int r=maxn-1){
        if (l == r) {
            if (l < n) {
                mx[o] = A[l];
            }else{
                mx[o] = inf;
            }
            return;
        }
        int mid = (l+r)/2;
        build(o*2,l,mid); build(o*2+1,mid+1,r);
        mx[o] = max(mx[o*2], mx[o*2+1]);
    }
    void MO(int p, int v, int o=1, int l=0, int r=maxn-1) {
        if (l > p || r < p) return;
        if (l == r) {
            mx[o] = v; return;
        }
        int mid = (l+r)/2;
        MO(p,v,o*2,l,mid); MO(p,v,o*2+1,mid+1,r);
        mx[o] = max(mx[o*2], mx[o*2+1]);
    }
    int Qright(int L, int R, int v, int o=1, int l=0, int r=maxn-1) { // rightmost point in this range geq than v
        if (mx[o] < v || l > R || r < L) return -1;
        if (l == r) return l;
        int mid = (l+r)/2;
        int gr = Qright(L,R,v,o*2+1,mid+1,r);
        if (gr == -1) return Qright(L,R,v,o*2,l,mid);
        else return gr;
    }
    int Qleft(int L, int R, int v, int o=1, int l=0, int r=maxn-1) { // rightmost point in this range geq than v
        if (mx[o] < v || l > R || r < L) return -1;
        if (l == r) return l;
        int mid = (l+r)/2;
        int gl = Qleft(L,R,v,o*2,l,mid);
        if (gl == -1) return Qleft(L,R,v,o*2+1,mid+1,r);
        else return gl;
    }
};

namespace BIT{
    // for range sum only i guess
    ll s[maxn];
    ll QU(int e) {
        ll re = 0; for (++e; e>0; e-=e&-e) re += s[e]; return re;
    }
    ll QU(int l, int r) {
        return QU(r) - QU(l-1);
    }
    void MO(int e, int v) {
        for (++e; e<maxn; e+=e&-e) {
            s[e] += v;
        }
    }
}

int toL[maxn], toR[maxn];

//vector<int> fromL[maxn], fromR[maxn]; // from my left, from my right



void updl(int v) {
    if (toL[v]!=-1) {
        int p = toL[v];
        toL[v] = -1;
        VS::MO(p+1, v-1, -1);
        bug("bye", v, p);
    }
    int P = NXTS::Qright(0,v-1,A[v]);
//    bug(v,P);
    if (P != -1 && P != v-1) {
        assert(A[P] >= A[v]);
        ll btw = BIT::QU(P+1, v-1);
        if (btw < A[v]) {
            // yay
            VS::MO(P+1, v-1, 1);
            toL[v] = P;
            bug(btw, v, P);
        }
    }
}

void updr(int v) {
    if (toR[v]!=-1) {
        int p = toR[v];
        toR[v] = -1;
        VS::MO(v+1,p-1, -1);
    }
    int P = NXTS::Qleft(v+1,n-1,A[v]);
//    bug(v,P);
    if (P != -1 && P != v+1) {
        assert(A[P] >= A[v]);
        ll btw = BIT::QU(v+1,P-1);
        if (btw < A[v]) {
            VS::MO(v+1, P-1, 1);
            toR[v] = P;
            bug(v, P);
        }
    }
}

void ptchg(int v, int val) {
    BIT::MO(v, val - A[v]); NXTS::MO(v, val);
    A[v] = val;
}

void chg(int v, int val, bool doleft, bool doright) {
    // walk left!!
    ptchg(v,val);
    updl(v); updr(v);
    if (doleft) {
        for (int u = v-1; u!=-1 && u>=0; u = NXTS::Qright(0,u-1,1+BIT::QU(u,v-1))) {
            updr(u);
        }
    }
    if (doright) {
        for (int u = v+1; u!=-1 && u<n; u = NXTS::Qleft(u+1, maxn-1, 1+BIT::QU(v+1, u))) {
            updl(u);
        }
    }
}

struct mot{
    int l,r,v;
};

ll getfast(int l, int r) {
    vector<mot > undo;

    {
        for (int u = l-1; u!=-1 && u>=0; u = NXTS::Qright(0,u-1,1+BIT::QU(u,l-1))) {
            if (toR[u] != -1) {
                VS::MO(u+1, toR[u]-1, -1);
                undo.pb({u+1, toR[u]-1, 1});
                bug(u);
            }
        }

        int last = -1;
        for (int u = l; u!=-1 && u<=r; u = NXTS::Qleft(u+1, maxn-1, 1+BIT::QU(l, u))) {
            if (A[u] > BIT::QU(l,u-1)) {
                last = u;
                bug(u);
            }
        }
        if (last != -1) {
            VS::MO(l, last-1, 1);
            undo.pb({l, last-1, -1});
        }
    }

    {
        for (int u = r+1; u!=-1 && u<n; u = NXTS::Qleft(u+1,maxn-1,1+BIT::QU(r+1,u))) {
            if (toL[u] != -1) {
                VS::MO(toL[u]+1, u-1, -1);
                undo.pb({toL[u]+1, u-1, 1});
                bug(u);
            }
        }

        int last = -1;
        for (int u = r; u!=-1 && u>=l; u = NXTS::Qright(0, u-1, 1+BIT::QU(u, r))) {
            if (A[u] > BIT::QU(u+1,r)) {
                last = u;
            }
        }
        if (last != -1) {
            VS::MO(last+1, r, 1);
            undo.pb({last+1, r, -1});
//            bug(u);
        }
    }

    ll re = VS::QU(l,r);
    for (auto e : undo) {
        bug(e.l, e.r, e.v);
        VS::MO(e.l, e.r, e.v);
    }
    return re;
}

signed main(){
    ios::sync_with_stdio(0), cin.tie(0);

    cin>>n;
    n+=2;
    REP1(i,n-2) {
        cin>>A[i];
    }
    ll big = 1e15+10;
    A[0] = A[n-1] = big;
    REP(i,n){
        BIT::MO(i, A[i]);
    }
    VS::build(); NXTS::build();

    memset(toL, -1, sizeof toL);
    memset(toR, -1, sizeof toR);

    REP(i,n) {
        updl(i); updr(i);
    }

    cin>>q;

    while (q--) {
        int tp, l, r; cin>>tp>>l>>r;
        if (tp == 2) {
            cout<<getfast(l,r)<<endl;
        }else{
//            ptchg(l,r);
            chg(l,r,1,1);
//            updl(l); updr(l);
        }
    }


}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 8068 KB Output is correct
2 Correct 5 ms 8020 KB Output is correct
3 Correct 6 ms 8020 KB Output is correct
4 Correct 4 ms 8020 KB Output is correct
5 Correct 12 ms 8148 KB Output is correct
6 Correct 9 ms 8176 KB Output is correct
7 Correct 10 ms 8176 KB Output is correct
8 Correct 14 ms 8128 KB Output is correct
9 Correct 9 ms 8196 KB Output is correct
10 Correct 7 ms 8128 KB Output is correct
11 Correct 7 ms 8148 KB Output is correct
12 Correct 9 ms 8148 KB Output is correct
13 Correct 9 ms 8176 KB Output is correct
14 Correct 7 ms 8184 KB Output is correct
15 Correct 9 ms 8132 KB Output is correct
16 Correct 8 ms 8148 KB Output is correct
17 Correct 8 ms 8148 KB Output is correct
18 Correct 8 ms 8148 KB Output is correct
19 Correct 8 ms 8148 KB Output is correct
20 Correct 7 ms 8148 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 8020 KB Output is correct
2 Correct 63 ms 11568 KB Output is correct
3 Correct 63 ms 11632 KB Output is correct
4 Correct 68 ms 11748 KB Output is correct
5 Correct 61 ms 11560 KB Output is correct
6 Correct 52 ms 11592 KB Output is correct
7 Correct 43 ms 11596 KB Output is correct
8 Correct 64 ms 11616 KB Output is correct
9 Correct 45 ms 11596 KB Output is correct
10 Correct 66 ms 11636 KB Output is correct
11 Correct 63 ms 11616 KB Output is correct
12 Correct 50 ms 11628 KB Output is correct
13 Correct 48 ms 11596 KB Output is correct
14 Correct 56 ms 11552 KB Output is correct
15 Correct 55 ms 11600 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 8068 KB Output is correct
2 Correct 5 ms 8020 KB Output is correct
3 Correct 6 ms 8020 KB Output is correct
4 Correct 4 ms 8020 KB Output is correct
5 Correct 12 ms 8148 KB Output is correct
6 Correct 9 ms 8176 KB Output is correct
7 Correct 10 ms 8176 KB Output is correct
8 Correct 14 ms 8128 KB Output is correct
9 Correct 9 ms 8196 KB Output is correct
10 Correct 7 ms 8128 KB Output is correct
11 Correct 7 ms 8148 KB Output is correct
12 Correct 9 ms 8148 KB Output is correct
13 Correct 9 ms 8176 KB Output is correct
14 Correct 7 ms 8184 KB Output is correct
15 Correct 9 ms 8132 KB Output is correct
16 Correct 8 ms 8148 KB Output is correct
17 Correct 8 ms 8148 KB Output is correct
18 Correct 8 ms 8148 KB Output is correct
19 Correct 8 ms 8148 KB Output is correct
20 Correct 7 ms 8148 KB Output is correct
21 Correct 7 ms 8020 KB Output is correct
22 Correct 63 ms 11568 KB Output is correct
23 Correct 63 ms 11632 KB Output is correct
24 Correct 68 ms 11748 KB Output is correct
25 Correct 61 ms 11560 KB Output is correct
26 Correct 52 ms 11592 KB Output is correct
27 Correct 43 ms 11596 KB Output is correct
28 Correct 64 ms 11616 KB Output is correct
29 Correct 45 ms 11596 KB Output is correct
30 Correct 66 ms 11636 KB Output is correct
31 Correct 63 ms 11616 KB Output is correct
32 Correct 50 ms 11628 KB Output is correct
33 Correct 48 ms 11596 KB Output is correct
34 Correct 56 ms 11552 KB Output is correct
35 Correct 55 ms 11600 KB Output is correct
36 Correct 79 ms 11600 KB Output is correct
37 Correct 84 ms 11672 KB Output is correct
38 Correct 85 ms 11600 KB Output is correct
39 Correct 80 ms 11572 KB Output is correct
40 Correct 73 ms 11648 KB Output is correct
41 Correct 64 ms 11596 KB Output is correct
42 Correct 62 ms 11684 KB Output is correct
43 Correct 62 ms 11752 KB Output is correct
44 Correct 59 ms 11668 KB Output is correct
45 Correct 89 ms 11596 KB Output is correct
46 Correct 75 ms 11596 KB Output is correct
47 Correct 63 ms 11600 KB Output is correct
48 Correct 59 ms 11668 KB Output is correct
49 Correct 77 ms 11620 KB Output is correct
50 Correct 66 ms 11648 KB Output is correct
51 Correct 65 ms 11668 KB Output is correct
52 Correct 65 ms 11596 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 8020 KB Output is correct
2 Correct 63 ms 11568 KB Output is correct
3 Correct 63 ms 11632 KB Output is correct
4 Correct 68 ms 11748 KB Output is correct
5 Correct 61 ms 11560 KB Output is correct
6 Correct 52 ms 11592 KB Output is correct
7 Correct 43 ms 11596 KB Output is correct
8 Correct 64 ms 11616 KB Output is correct
9 Correct 45 ms 11596 KB Output is correct
10 Correct 66 ms 11636 KB Output is correct
11 Correct 63 ms 11616 KB Output is correct
12 Correct 50 ms 11628 KB Output is correct
13 Correct 48 ms 11596 KB Output is correct
14 Correct 56 ms 11552 KB Output is correct
15 Correct 55 ms 11600 KB Output is correct
16 Correct 5 ms 8020 KB Output is correct
17 Correct 1495 ms 12016 KB Output is correct
18 Correct 1505 ms 12116 KB Output is correct
19 Correct 1444 ms 12016 KB Output is correct
20 Correct 2045 ms 11932 KB Output is correct
21 Correct 1442 ms 12244 KB Output is correct
22 Correct 1546 ms 12100 KB Output is correct
23 Correct 1563 ms 12088 KB Output is correct
24 Correct 1950 ms 11920 KB Output is correct
25 Correct 1458 ms 12216 KB Output is correct
26 Correct 2007 ms 12108 KB Output is correct
27 Correct 755 ms 12116 KB Output is correct
28 Correct 744 ms 12256 KB Output is correct
29 Correct 764 ms 12188 KB Output is correct
30 Correct 1572 ms 11908 KB Output is correct
31 Correct 1766 ms 11900 KB Output is correct
32 Correct 3408 ms 11968 KB Output is correct
33 Correct 1448 ms 14144 KB Output is correct
34 Correct 3950 ms 13564 KB Output is correct
35 Correct 2176 ms 13568 KB Output is correct
36 Correct 3059 ms 14024 KB Output is correct
37 Correct 1128 ms 13480 KB Output is correct
38 Correct 1069 ms 13504 KB Output is correct
39 Correct 1070 ms 14052 KB Output is correct
40 Correct 951 ms 14008 KB Output is correct

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 8020 KB Output is correct
2 Correct 63 ms 11568 KB Output is correct
3 Correct 63 ms 11632 KB Output is correct
4 Correct 68 ms 11748 KB Output is correct
5 Correct 61 ms 11560 KB Output is correct
6 Correct 52 ms 11592 KB Output is correct
7 Correct 43 ms 11596 KB Output is correct
8 Correct 64 ms 11616 KB Output is correct
9 Correct 45 ms 11596 KB Output is correct
10 Correct 66 ms 11636 KB Output is correct
11 Correct 63 ms 11616 KB Output is correct
12 Correct 50 ms 11628 KB Output is correct
13 Correct 48 ms 11596 KB Output is correct
14 Correct 56 ms 11552 KB Output is correct
15 Correct 55 ms 11600 KB Output is correct
16 Correct 6 ms 8020 KB Output is correct
17 Correct 1811 ms 11684 KB Output is correct
18 Correct 1140 ms 11712 KB Output is correct
19 Correct 1403 ms 11848 KB Output is correct
20 Correct 1022 ms 11884 KB Output is correct
21 Correct 1533 ms 11684 KB Output is correct
22 Correct 1044 ms 11672 KB Output is correct
23 Correct 1346 ms 11804 KB Output is correct
24 Correct 937 ms 11872 KB Output is correct
25 Correct 1241 ms 11940 KB Output is correct
26 Correct 548 ms 11900 KB Output is correct
27 Correct 577 ms 11720 KB Output is correct
28 Correct 690 ms 11880 KB Output is correct
29 Correct 609 ms 11848 KB Output is correct
30 Correct 594 ms 11840 KB Output is correct
31 Correct 783 ms 11884 KB Output is correct
32 Correct 919 ms 11712 KB Output is correct
33 Correct 634 ms 11728 KB Output is correct
34 Correct 878 ms 11792 KB Output is correct
35 Correct 631 ms 11840 KB Output is correct
36 Correct 823 ms 11920 KB Output is correct
37 Correct 805 ms 11716 KB Output is correct
38 Correct 675 ms 12008 KB Output is correct
39 Correct 617 ms 11852 KB Output is correct
40 Correct 488 ms 12132 KB Output is correct

Subtask #6
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 8068 KB Output is correct
2 Correct 5 ms 8020 KB Output is correct
3 Correct 6 ms 8020 KB Output is correct
4 Correct 4 ms 8020 KB Output is correct
5 Correct 12 ms 8148 KB Output is correct
6 Correct 9 ms 8176 KB Output is correct
7 Correct 10 ms 8176 KB Output is correct
8 Correct 14 ms 8128 KB Output is correct
9 Correct 9 ms 8196 KB Output is correct
10 Correct 7 ms 8128 KB Output is correct
11 Correct 7 ms 8148 KB Output is correct
12 Correct 9 ms 8148 KB Output is correct
13 Correct 9 ms 8176 KB Output is correct
14 Correct 7 ms 8184 KB Output is correct
15 Correct 9 ms 8132 KB Output is correct
16 Correct 8 ms 8148 KB Output is correct
17 Correct 8 ms 8148 KB Output is correct
18 Correct 8 ms 8148 KB Output is correct
19 Correct 8 ms 8148 KB Output is correct
20 Correct 7 ms 8148 KB Output is correct
21 Correct 7 ms 8020 KB Output is correct
22 Correct 63 ms 11568 KB Output is correct
23 Correct 63 ms 11632 KB Output is correct
24 Correct 68 ms 11748 KB Output is correct
25 Correct 61 ms 11560 KB Output is correct
26 Correct 52 ms 11592 KB Output is correct
27 Correct 43 ms 11596 KB Output is correct
28 Correct 64 ms 11616 KB Output is correct
29 Correct 45 ms 11596 KB Output is correct
30 Correct 66 ms 11636 KB Output is correct
31 Correct 63 ms 11616 KB Output is correct
32 Correct 50 ms 11628 KB Output is correct
33 Correct 48 ms 11596 KB Output is correct
34 Correct 56 ms 11552 KB Output is correct
35 Correct 55 ms 11600 KB Output is correct
36 Correct 79 ms 11600 KB Output is correct
37 Correct 84 ms 11672 KB Output is correct
38 Correct 85 ms 11600 KB Output is correct
39 Correct 80 ms 11572 KB Output is correct
40 Correct 73 ms 11648 KB Output is correct
41 Correct 64 ms 11596 KB Output is correct
42 Correct 62 ms 11684 KB Output is correct
43 Correct 62 ms 11752 KB Output is correct
44 Correct 59 ms 11668 KB Output is correct
45 Correct 89 ms 11596 KB Output is correct
46 Correct 75 ms 11596 KB Output is correct
47 Correct 63 ms 11600 KB Output is correct
48 Correct 59 ms 11668 KB Output is correct
49 Correct 77 ms 11620 KB Output is correct
50 Correct 66 ms 11648 KB Output is correct
51 Correct 65 ms 11668 KB Output is correct
52 Correct 65 ms 11596 KB Output is correct
53 Correct 5 ms 8020 KB Output is correct
54 Correct 1495 ms 12016 KB Output is correct
55 Correct 1505 ms 12116 KB Output is correct
56 Correct 1444 ms 12016 KB Output is correct
57 Correct 2045 ms 11932 KB Output is correct
58 Correct 1442 ms 12244 KB Output is correct
59 Correct 1546 ms 12100 KB Output is correct
60 Correct 1563 ms 12088 KB Output is correct
61 Correct 1950 ms 11920 KB Output is correct
62 Correct 1458 ms 12216 KB Output is correct
63 Correct 2007 ms 12108 KB Output is correct
64 Correct 755 ms 12116 KB Output is correct
65 Correct 744 ms 12256 KB Output is correct
66 Correct 764 ms 12188 KB Output is correct
67 Correct 1572 ms 11908 KB Output is correct
68 Correct 1766 ms 11900 KB Output is correct
69 Correct 3408 ms 11968 KB Output is correct
70 Correct 1448 ms 14144 KB Output is correct
71 Correct 3950 ms 13564 KB Output is correct
72 Correct 2176 ms 13568 KB Output is correct
73 Correct 3059 ms 14024 KB Output is correct
74 Correct 1128 ms 13480 KB Output is correct
75 Correct 1069 ms 13504 KB Output is correct
76 Correct 1070 ms 14052 KB Output is correct
77 Correct 951 ms 14008 KB Output is correct
78 Correct 6 ms 8020 KB Output is correct
79 Correct 1811 ms 11684 KB Output is correct
80 Correct 1140 ms 11712 KB Output is correct
81 Correct 1403 ms 11848 KB Output is correct
82 Correct 1022 ms 11884 KB Output is correct
83 Correct 1533 ms 11684 KB Output is correct
84 Correct 1044 ms 11672 KB Output is correct
85 Correct 1346 ms 11804 KB Output is correct
86 Correct 937 ms 11872 KB Output is correct
87 Correct 1241 ms 11940 KB Output is correct
88 Correct 548 ms 11900 KB Output is correct
89 Correct 577 ms 11720 KB Output is correct
90 Correct 690 ms 11880 KB Output is correct
91 Correct 609 ms 11848 KB Output is correct
92 Correct 594 ms 11840 KB Output is correct
93 Correct 783 ms 11884 KB Output is correct
94 Correct 919 ms 11712 KB Output is correct
95 Correct 634 ms 11728 KB Output is correct
96 Correct 878 ms 11792 KB Output is correct
97 Correct 631 ms 11840 KB Output is correct
98 Correct 823 ms 11920 KB Output is correct
99 Correct 805 ms 11716 KB Output is correct
100 Correct 675 ms 12008 KB Output is correct
101 Correct 617 ms 11852 KB Output is correct
102 Correct 488 ms 12132 KB Output is correct
103 Correct 1594 ms 13008 KB Output is correct
104 Correct 976 ms 13844 KB Output is correct
105 Correct 1485 ms 13728 KB Output is correct
106 Correct 1399 ms 13828 KB Output is correct
107 Correct 1322 ms 13072 KB Output is correct
108 Correct 1008 ms 13872 KB Output is correct
109 Correct 1441 ms 13532 KB Output is correct
110 Correct 1279 ms 13692 KB Output is correct
111 Correct 1496 ms 13648 KB Output is correct
112 Correct 1449 ms 13692 KB Output is correct
113 Correct 673 ms 14428 KB Output is correct
114 Correct 721 ms 14460 KB Output is correct
115 Correct 895 ms 13520 KB Output is correct
116 Correct 1056 ms 13632 KB Output is correct
117 Correct 760 ms 14472 KB Output is correct
118 Correct 1245 ms 13548 KB Output is correct
119 Correct 637 ms 14260 KB Output is correct
120 Correct 968 ms 13600 KB Output is correct
121 Correct 1074 ms 13772 KB Output is correct
122 Correct 1029 ms 13596 KB Output is correct
123 Correct 1032 ms 13376 KB Output is correct
124 Correct 1511 ms 13716 KB Output is correct
125 Correct 1906 ms 13504 KB Output is correct
126 Correct 1740 ms 13684 KB Output is correct
127 Correct 1050 ms 13496 KB Output is correct
128 Correct 1147 ms 13696 KB Output is correct
129 Correct 812 ms 14016 KB Output is correct
130 Correct 825 ms 14024 KB Output is correct