oj.uz

Submission #635392

# Submission time Handle Problem Language Result Execution time Memory
635392 2022-08-26T08:11:19 Z Mahdi Watermelon (INOI20_watermelon) C++17
100 / 100
 171 ms 10360 KB 
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(v) v.begin(), v.end()
#define F first
#define S second
typedef long long ll;
typedef pair<int, int> pii;
const int N=1e5+5;
int n, b[N], bb[N], k, ans[N], d[N];
vector<int>g[N], nd;
bool mk[N];

struct seg_tree{
    int sz, a[4*N];
    seg_tree(){
        sz=1;
        while(sz<n)
            sz<<=1;
        for(int i=sz-1;i<sz+n-1;++i)
            a[i]=1;
        for(int i=sz-2;i>=0;--i)
            a[i]=a[2*i+1]+a[2*i+2];
    }

    void zero(int x){
        x+=sz-1;
        a[x]=0;
        while(x){
            --x;
            x/=2;
            --a[x];
        }
    }

    int sum(int x, int lx, int rx, int l, int r){
        if(lx>=r || rx<=l)
            return 0;
        if(lx>=l && rx<=r)
            return a[x];
        int m=(lx+rx)/2;
        return sum(2*x+1, lx, m, l, r)+sum(2*x+2, m, rx, l, r);
    }
    
    int nxt(int x, int lx, int rx, int h, int t){
        if(lx==rx-1)
            return lx;
        int m=(lx+rx)/2;
        if(h>=m)
            return nxt(2*x+2, m, rx, h, t);
        if(a[2*x+2]<t)
            return nxt(2*x+1, lx, m, h, t-a[2*x+2]);
        return nxt(2*x+2, m, rx, h, t);
    }
    
    int per(int x, int lx, int rx, int h, int t){
        if(lx+1==rx)
            return lx;
        int m=(lx+rx)/2;
        if(h<m)
            return per(2*x+1, lx, m, h, t);
        if(a[2*x+1]<t)
            return per(2*x+2, m, rx, h, t-a[2*x+1]);
        return per(2*x+1, lx, m, h, t);
    }

    int nxt(int x){
        int t=sum(0, 0, sz, x+1, n);
        if(t==0)
            return -1;
        return nxt(0, 0, sz, x, t);
    }

    int per(int x){
        int t=sum(0, 0, sz, 0, x);
        if(t==0)
            return n;
        return per(0, 0, sz, x, t);
    }
};

void dfs(const int &v){
    mk[v]=1;
    for(int u: g[v]){
        if(!mk[u])
            dfs(u);
    }
    nd.push_back(v);
}

void shift(int j){
    ++b[j];
    for(int i=j+1;i<n;++i)
        b[i]=0;
    priority_queue<int>pq;
    for(int i=0;i<n;++i){
        for(int u: g[i])
            ++d[u];
    }
    for(int i=0;i<n;++i){
        if(d[i]==0){
            pq.push(-i);
        }
    }
    for(int i=0;i<n;++i){
        bb[i]=(int)pq.size()-1;
        vector<int>v;
        for(int j=0;j<b[i];++j){
            v.push_back(pq.top());
            pq.pop();
        }
        int u=-pq.top();
        pq.pop();
        for(int w: v)
            pq.push(w);
        ans[u]=i;
        for(int w: g[u]){
            --d[w];
            if(d[w]==0)
                pq.push(-w);
        }
    }
}

int main(){
    cin>>n>>k;
    for(int i=0;i<n;++i)
        cin>>b[i];
    int cmo=0;
    for(int i=0;i<n;++i){
        if(b[i]==-1)
            ++cmo;
    }
    if(b[n-1]!=-1){
        cout<<-1<<'\n';
        return 0;
    }
    if(n==1){
        cout<<(k==1 ? 1 : -1)<<'\n';
        return 0;
    }
    seg_tree A;
    vector<int>v;
    for(int i=0;i<n-1;++i){
        if(b[i]==1){
            g[i].push_back(i+1);
            int pp=A.per(i);
            if(pp!=n)
                v.push_back(pp);
            A.zero(i);
        }
        else{
            g[i+1].push_back(i);
        }
    }
    for(int i=2;!v.empty();++i){
        v.resize(distance(v.begin(), unique(all(v))));
        vector<int>w;
        for(int u: v){
            if(b[u]==i){
                g[u].push_back(A.nxt(u));
                A.zero(u);
                int uw=A.per(u);
                if(uw!=n)
                    w.push_back(uw);
            }
            else{
                int uw=A.nxt(u);
                if(uw!=-1)
                    g[uw].push_back(u);
            }
        }
        v=w;
    }
    if(A.sum(0, 0, A.sz, 0, n)!=cmo){
        cout<<-1<<'\n';
        return 0;
    }
    for(int i=0;i<n;++i){
        if(!mk[i])
            dfs(i);
    }
    memset(mk, 0, sizeof(mk));
    for(int u: nd){
        mk[u]=1;
        for(int w: g[u]){
            if(!mk[w]){
                cout<<-1<<'\n';
                return 0;
            }
        }
    }
    memset(b, 0, sizeof(b));
    b[0]=-1;
    for(int i=0;i<k;++i){
        int j=-1;
        for(int jj=0;jj<n;++jj){
            if(b[jj]<bb[jj])
                j=jj;
        }
        if(j==-1){
            cout<<j<<'\n';
            return 0;
        }
        shift(j);
    }
    for(int i=0;i<n;++i)
        cout<<ans[i]+1<<' ';
    cout<<'\n';
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4692 KB Output is correct
2 Correct 2 ms 4692 KB Output is correct
3 Correct 2 ms 4692 KB Output is correct
4 Correct 2 ms 4180 KB Output is correct
5 Correct 2 ms 4180 KB Output is correct
6 Correct 2 ms 4180 KB Output is correct
7 Correct 2 ms 4180 KB Output is correct
8 Correct 2 ms 4180 KB Output is correct
9 Correct 2 ms 4180 KB Output is correct
10 Correct 2 ms 4180 KB Output is correct
11 Correct 2 ms 4180 KB Output is correct
12 Correct 2 ms 4692 KB Output is correct
13 Correct 2 ms 4692 KB Output is correct
14 Correct 2 ms 4692 KB Output is correct
15 Correct 2 ms 4692 KB Output is correct
16 Correct 2 ms 4692 KB Output is correct
17 Correct 2 ms 4692 KB Output is correct
18 Correct 2 ms 4692 KB Output is correct
19 Correct 2 ms 4180 KB Output is correct
20 Correct 2 ms 4180 KB Output is correct
21 Correct 2 ms 4180 KB Output is correct
22 Correct 2 ms 4180 KB Output is correct
23 Correct 2 ms 4180 KB Output is correct
24 Correct 2 ms 4180 KB Output is correct
25 Correct 2 ms 4692 KB Output is correct
26 Correct 2 ms 4692 KB Output is correct
27 Correct 3 ms 4692 KB Output is correct
28 Correct 2 ms 4692 KB Output is correct
29 Correct 2 ms 4692 KB Output is correct
30 Correct 2 ms 4692 KB Output is correct
31 Correct 2 ms 4692 KB Output is correct
32 Correct 2 ms 4692 KB Output is correct
33 Correct 2 ms 4692 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4692 KB Output is correct
2 Correct 2 ms 4692 KB Output is correct
3 Correct 2 ms 4692 KB Output is correct
4 Correct 2 ms 4180 KB Output is correct
5 Correct 2 ms 4180 KB Output is correct
6 Correct 2 ms 4180 KB Output is correct
7 Correct 2 ms 4180 KB Output is correct
8 Correct 2 ms 4180 KB Output is correct
9 Correct 2 ms 4180 KB Output is correct
10 Correct 2 ms 4180 KB Output is correct
11 Correct 2 ms 4180 KB Output is correct
12 Correct 2 ms 4692 KB Output is correct
13 Correct 2 ms 4692 KB Output is correct
14 Correct 2 ms 4692 KB Output is correct
15 Correct 2 ms 4692 KB Output is correct
16 Correct 2 ms 4692 KB Output is correct
17 Correct 2 ms 4692 KB Output is correct
18 Correct 2 ms 4692 KB Output is correct
19 Correct 2 ms 4180 KB Output is correct
20 Correct 2 ms 4180 KB Output is correct
21 Correct 2 ms 4180 KB Output is correct
22 Correct 2 ms 4180 KB Output is correct
23 Correct 2 ms 4180 KB Output is correct
24 Correct 2 ms 4180 KB Output is correct
25 Correct 2 ms 4692 KB Output is correct
26 Correct 2 ms 4692 KB Output is correct
27 Correct 3 ms 4692 KB Output is correct
28 Correct 2 ms 4692 KB Output is correct
29 Correct 2 ms 4692 KB Output is correct
30 Correct 2 ms 4692 KB Output is correct
31 Correct 2 ms 4692 KB Output is correct
32 Correct 2 ms 4692 KB Output is correct
33 Correct 2 ms 4692 KB Output is correct
34 Correct 4 ms 4820 KB Output is correct
35 Correct 4 ms 4820 KB Output is correct
36 Correct 2 ms 4252 KB Output is correct
37 Correct 3 ms 4308 KB Output is correct
38 Correct 5 ms 4820 KB Output is correct
39 Correct 4 ms 4820 KB Output is correct
40 Correct 5 ms 4820 KB Output is correct
41 Correct 5 ms 4820 KB Output is correct
42 Correct 6 ms 4820 KB Output is correct
43 Correct 5 ms 4820 KB Output is correct
44 Correct 5 ms 4820 KB Output is correct
45 Correct 4 ms 4692 KB Output is correct
46 Correct 4 ms 4776 KB Output is correct
47 Correct 2 ms 4180 KB Output is correct
48 Correct 3 ms 4180 KB Output is correct
49 Correct 3 ms 4180 KB Output is correct
50 Correct 3 ms 4180 KB Output is correct
51 Correct 3 ms 4228 KB Output is correct
52 Correct 2 ms 4180 KB Output is correct
53 Correct 4 ms 4820 KB Output is correct
54 Correct 5 ms 4820 KB Output is correct
55 Correct 3 ms 4180 KB Output is correct
56 Correct 3 ms 4180 KB Output is correct
57 Correct 5 ms 4820 KB Output is correct
58 Correct 5 ms 4820 KB Output is correct
59 Correct 5 ms 4820 KB Output is correct
60 Correct 5 ms 4820 KB Output is correct
61 Correct 5 ms 4820 KB Output is correct
62 Correct 5 ms 4820 KB Output is correct
63 Correct 4 ms 4820 KB Output is correct
64 Correct 3 ms 4692 KB Output is correct
65 Correct 4 ms 4692 KB Output is correct

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 7516 KB Output is correct
2 Correct 17 ms 5948 KB Output is correct
3 Correct 44 ms 7516 KB Output is correct
4 Correct 15 ms 5972 KB Output is correct
5 Correct 46 ms 7444 KB Output is correct
6 Correct 42 ms 7520 KB Output is correct
7 Correct 42 ms 7468 KB Output is correct
8 Correct 42 ms 7544 KB Output is correct
9 Correct 43 ms 7532 KB Output is correct
10 Correct 44 ms 7448 KB Output is correct
11 Correct 84 ms 10208 KB Output is correct
12 Correct 84 ms 10360 KB Output is correct
13 Correct 84 ms 10268 KB Output is correct
14 Correct 84 ms 10300 KB Output is correct
15 Correct 30 ms 7628 KB Output is correct
16 Correct 29 ms 7660 KB Output is correct
17 Correct 29 ms 7636 KB Output is correct
18 Correct 30 ms 7644 KB Output is correct
19 Correct 30 ms 7636 KB Output is correct
20 Correct 31 ms 7688 KB Output is correct
21 Correct 33 ms 7688 KB Output is correct
22 Correct 29 ms 7628 KB Output is correct
23 Correct 30 ms 7700 KB Output is correct
24 Correct 90 ms 10028 KB Output is correct
25 Correct 90 ms 10072 KB Output is correct
26 Correct 90 ms 10060 KB Output is correct
27 Correct 99 ms 10064 KB Output is correct
28 Correct 91 ms 10032 KB Output is correct
29 Correct 91 ms 10072 KB Output is correct
30 Correct 29 ms 6428 KB Output is correct
31 Correct 47 ms 7392 KB Output is correct
32 Correct 88 ms 9552 KB Output is correct
33 Correct 106 ms 10028 KB Output is correct
34 Correct 10 ms 5204 KB Output is correct
35 Correct 20 ms 5828 KB Output is correct
36 Correct 50 ms 7420 KB Output is correct
37 Correct 119 ms 10024 KB Output is correct
38 Correct 117 ms 10240 KB Output is correct
39 Correct 115 ms 10056 KB Output is correct
40 Correct 73 ms 10244 KB Output is correct
41 Correct 88 ms 10108 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 7516 KB Output is correct
2 Correct 17 ms 5948 KB Output is correct
3 Correct 44 ms 7516 KB Output is correct
4 Correct 15 ms 5972 KB Output is correct
5 Correct 46 ms 7444 KB Output is correct
6 Correct 42 ms 7520 KB Output is correct
7 Correct 42 ms 7468 KB Output is correct
8 Correct 42 ms 7544 KB Output is correct
9 Correct 43 ms 7532 KB Output is correct
10 Correct 44 ms 7448 KB Output is correct
11 Correct 84 ms 10208 KB Output is correct
12 Correct 84 ms 10360 KB Output is correct
13 Correct 84 ms 10268 KB Output is correct
14 Correct 84 ms 10300 KB Output is correct
15 Correct 30 ms 7628 KB Output is correct
16 Correct 29 ms 7660 KB Output is correct
17 Correct 29 ms 7636 KB Output is correct
18 Correct 30 ms 7644 KB Output is correct
19 Correct 30 ms 7636 KB Output is correct
20 Correct 31 ms 7688 KB Output is correct
21 Correct 33 ms 7688 KB Output is correct
22 Correct 29 ms 7628 KB Output is correct
23 Correct 30 ms 7700 KB Output is correct
24 Correct 90 ms 10028 KB Output is correct
25 Correct 90 ms 10072 KB Output is correct
26 Correct 90 ms 10060 KB Output is correct
27 Correct 99 ms 10064 KB Output is correct
28 Correct 91 ms 10032 KB Output is correct
29 Correct 91 ms 10072 KB Output is correct
30 Correct 29 ms 6428 KB Output is correct
31 Correct 47 ms 7392 KB Output is correct
32 Correct 88 ms 9552 KB Output is correct
33 Correct 106 ms 10028 KB Output is correct
34 Correct 10 ms 5204 KB Output is correct
35 Correct 20 ms 5828 KB Output is correct
36 Correct 50 ms 7420 KB Output is correct
37 Correct 119 ms 10024 KB Output is correct
38 Correct 117 ms 10240 KB Output is correct
39 Correct 115 ms 10056 KB Output is correct
40 Correct 73 ms 10244 KB Output is correct
41 Correct 88 ms 10108 KB Output is correct
42 Correct 74 ms 7444 KB Output is correct
43 Correct 17 ms 5900 KB Output is correct
44 Correct 48 ms 7468 KB Output is correct
45 Correct 16 ms 5972 KB Output is correct
46 Correct 17 ms 5864 KB Output is correct
47 Correct 16 ms 5972 KB Output is correct
48 Correct 19 ms 5888 KB Output is correct
49 Correct 50 ms 7448 KB Output is correct
50 Correct 48 ms 7540 KB Output is correct
51 Correct 50 ms 7492 KB Output is correct
52 Correct 97 ms 10240 KB Output is correct
53 Correct 97 ms 10232 KB Output is correct
54 Correct 30 ms 7628 KB Output is correct
55 Correct 30 ms 7696 KB Output is correct
56 Correct 107 ms 9584 KB Output is correct
57 Correct 119 ms 10028 KB Output is correct
58 Correct 108 ms 10000 KB Output is correct
59 Correct 111 ms 10068 KB Output is correct
60 Correct 109 ms 10040 KB Output is correct
61 Correct 77 ms 10224 KB Output is correct
62 Correct 78 ms 9384 KB Output is correct
63 Correct 97 ms 10048 KB Output is correct
64 Correct 95 ms 10044 KB Output is correct

Subtask #5
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4692 KB Output is correct
2 Correct 2 ms 4692 KB Output is correct
3 Correct 2 ms 4692 KB Output is correct
4 Correct 2 ms 4180 KB Output is correct
5 Correct 2 ms 4180 KB Output is correct
6 Correct 2 ms 4180 KB Output is correct
7 Correct 2 ms 4180 KB Output is correct
8 Correct 2 ms 4180 KB Output is correct
9 Correct 2 ms 4180 KB Output is correct
10 Correct 2 ms 4180 KB Output is correct
11 Correct 2 ms 4180 KB Output is correct
12 Correct 2 ms 4692 KB Output is correct
13 Correct 2 ms 4692 KB Output is correct
14 Correct 2 ms 4692 KB Output is correct
15 Correct 2 ms 4692 KB Output is correct
16 Correct 2 ms 4692 KB Output is correct
17 Correct 2 ms 4692 KB Output is correct
18 Correct 2 ms 4692 KB Output is correct
19 Correct 2 ms 4180 KB Output is correct
20 Correct 2 ms 4180 KB Output is correct
21 Correct 2 ms 4180 KB Output is correct
22 Correct 2 ms 4180 KB Output is correct
23 Correct 2 ms 4180 KB Output is correct
24 Correct 2 ms 4180 KB Output is correct
25 Correct 2 ms 4692 KB Output is correct
26 Correct 2 ms 4692 KB Output is correct
27 Correct 3 ms 4692 KB Output is correct
28 Correct 2 ms 4692 KB Output is correct
29 Correct 2 ms 4692 KB Output is correct
30 Correct 2 ms 4692 KB Output is correct
31 Correct 2 ms 4692 KB Output is correct
32 Correct 2 ms 4692 KB Output is correct
33 Correct 2 ms 4692 KB Output is correct
34 Correct 4 ms 4820 KB Output is correct
35 Correct 4 ms 4820 KB Output is correct
36 Correct 2 ms 4252 KB Output is correct
37 Correct 3 ms 4308 KB Output is correct
38 Correct 5 ms 4820 KB Output is correct
39 Correct 4 ms 4820 KB Output is correct
40 Correct 5 ms 4820 KB Output is correct
41 Correct 5 ms 4820 KB Output is correct
42 Correct 6 ms 4820 KB Output is correct
43 Correct 5 ms 4820 KB Output is correct
44 Correct 5 ms 4820 KB Output is correct
45 Correct 4 ms 4692 KB Output is correct
46 Correct 4 ms 4776 KB Output is correct
47 Correct 2 ms 4180 KB Output is correct
48 Correct 3 ms 4180 KB Output is correct
49 Correct 3 ms 4180 KB Output is correct
50 Correct 3 ms 4180 KB Output is correct
51 Correct 3 ms 4228 KB Output is correct
52 Correct 2 ms 4180 KB Output is correct
53 Correct 4 ms 4820 KB Output is correct
54 Correct 5 ms 4820 KB Output is correct
55 Correct 3 ms 4180 KB Output is correct
56 Correct 3 ms 4180 KB Output is correct
57 Correct 5 ms 4820 KB Output is correct
58 Correct 5 ms 4820 KB Output is correct
59 Correct 5 ms 4820 KB Output is correct
60 Correct 5 ms 4820 KB Output is correct
61 Correct 5 ms 4820 KB Output is correct
62 Correct 5 ms 4820 KB Output is correct
63 Correct 4 ms 4820 KB Output is correct
64 Correct 3 ms 4692 KB Output is correct
65 Correct 4 ms 4692 KB Output is correct
66 Correct 44 ms 7516 KB Output is correct
67 Correct 17 ms 5948 KB Output is correct
68 Correct 44 ms 7516 KB Output is correct
69 Correct 15 ms 5972 KB Output is correct
70 Correct 46 ms 7444 KB Output is correct
71 Correct 42 ms 7520 KB Output is correct
72 Correct 42 ms 7468 KB Output is correct
73 Correct 42 ms 7544 KB Output is correct
74 Correct 43 ms 7532 KB Output is correct
75 Correct 44 ms 7448 KB Output is correct
76 Correct 84 ms 10208 KB Output is correct
77 Correct 84 ms 10360 KB Output is correct
78 Correct 84 ms 10268 KB Output is correct
79 Correct 84 ms 10300 KB Output is correct
80 Correct 30 ms 7628 KB Output is correct
81 Correct 29 ms 7660 KB Output is correct
82 Correct 29 ms 7636 KB Output is correct
83 Correct 30 ms 7644 KB Output is correct
84 Correct 30 ms 7636 KB Output is correct
85 Correct 31 ms 7688 KB Output is correct
86 Correct 33 ms 7688 KB Output is correct
87 Correct 29 ms 7628 KB Output is correct
88 Correct 30 ms 7700 KB Output is correct
89 Correct 90 ms 10028 KB Output is correct
90 Correct 90 ms 10072 KB Output is correct
91 Correct 90 ms 10060 KB Output is correct
92 Correct 99 ms 10064 KB Output is correct
93 Correct 91 ms 10032 KB Output is correct
94 Correct 91 ms 10072 KB Output is correct
95 Correct 29 ms 6428 KB Output is correct
96 Correct 47 ms 7392 KB Output is correct
97 Correct 88 ms 9552 KB Output is correct
98 Correct 106 ms 10028 KB Output is correct
99 Correct 10 ms 5204 KB Output is correct
100 Correct 20 ms 5828 KB Output is correct
101 Correct 50 ms 7420 KB Output is correct
102 Correct 119 ms 10024 KB Output is correct
103 Correct 117 ms 10240 KB Output is correct
104 Correct 115 ms 10056 KB Output is correct
105 Correct 73 ms 10244 KB Output is correct
106 Correct 88 ms 10108 KB Output is correct
107 Correct 74 ms 7444 KB Output is correct
108 Correct 17 ms 5900 KB Output is correct
109 Correct 48 ms 7468 KB Output is correct
110 Correct 16 ms 5972 KB Output is correct
111 Correct 17 ms 5864 KB Output is correct
112 Correct 16 ms 5972 KB Output is correct
113 Correct 19 ms 5888 KB Output is correct
114 Correct 50 ms 7448 KB Output is correct
115 Correct 48 ms 7540 KB Output is correct
116 Correct 50 ms 7492 KB Output is correct
117 Correct 97 ms 10240 KB Output is correct
118 Correct 97 ms 10232 KB Output is correct
119 Correct 30 ms 7628 KB Output is correct
120 Correct 30 ms 7696 KB Output is correct
121 Correct 107 ms 9584 KB Output is correct
122 Correct 119 ms 10028 KB Output is correct
123 Correct 108 ms 10000 KB Output is correct
124 Correct 111 ms 10068 KB Output is correct
125 Correct 109 ms 10040 KB Output is correct
126 Correct 77 ms 10224 KB Output is correct
127 Correct 78 ms 9384 KB Output is correct
128 Correct 97 ms 10048 KB Output is correct
129 Correct 95 ms 10044 KB Output is correct
130 Correct 2 ms 4692 KB Output is correct
131 Correct 2 ms 4692 KB Output is correct
132 Correct 2 ms 4692 KB Output is correct
133 Correct 133 ms 10256 KB Output is correct
134 Correct 153 ms 10192 KB Output is correct
135 Correct 170 ms 10236 KB Output is correct
136 Correct 30 ms 7756 KB Output is correct
137 Correct 30 ms 7656 KB Output is correct
138 Correct 31 ms 7624 KB Output is correct
139 Correct 30 ms 7704 KB Output is correct
140 Correct 32 ms 7640 KB Output is correct
141 Correct 31 ms 7676 KB Output is correct
142 Correct 171 ms 10240 KB Output is correct
143 Correct 171 ms 10360 KB Output is correct
144 Correct 144 ms 10024 KB Output is correct
145 Correct 125 ms 9540 KB Output is correct
146 Correct 144 ms 10032 KB Output is correct
147 Correct 161 ms 10192 KB Output is correct
148 Correct 94 ms 10280 KB Output is correct
149 Correct 106 ms 10352 KB Output is correct
150 Correct 81 ms 10256 KB Output is correct
151 Correct 108 ms 10096 KB Output is correct
152 Correct 118 ms 10060 KB Output is correct
153 Correct 90 ms 10028 KB Output is correct
154 Correct 89 ms 10060 KB Output is correct
155 Correct 91 ms 10028 KB Output is correct
156 Correct 90 ms 10092 KB Output is correct
157 Correct 93 ms 10028 KB Output is correct
158 Correct 93 ms 10024 KB Output is correct
159 Correct 93 ms 10040 KB Output is correct
160 Correct 91 ms 10032 KB Output is correct