oj.uz

답안 #653443

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
653443 2022-10-26T21:53:27 Z inksamurai The short shank; Redemption (BOI21_prison) C++17
80 / 100
 648 ms 159296 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#pragma GCC target ("avx,avx2")
// cut here
#ifdef _MSC_VER
#include <intrin.h>
#endif
 
namespace atcoder {
 
namespace internal {
 
int ceil_pow2(int n) {
    int x = 0;
    while ((1U << x) < (unsigned int)(n)) x++;
    return x;
}
 
int bsf(unsigned int n) {
#ifdef _MSC_VER
    unsigned long index;
    _BitScanForward(&index, n);
    return index;
#else
    return __builtin_ctz(n);
#endif
}
 
}  // namespace internal
 
}  // namespace atcoder
 
 
namespace atcoder {
 
template <class S, S (*op)(S, S), S (*e)()> struct segtree {
  public:
    segtree() : segtree(0) {}
    segtree(int n) : segtree(std::vector<S>(n, e())) {}
    segtree(const std::vector<S>& v) : _n(int(v.size())) {
        log = internal::ceil_pow2(_n);
        size = 1 << log;
        d = std::vector<S>(2 * size, e());
        for (int i = 0; i < _n; i++) d[size + i] = v[i];
        for (int i = size - 1; i >= 1; i--) {
            update(i);
        }
    }
 
    void set(int p, S x) {
        //assert(0 <= p && p < _n);
        p += size;
        d[p] = x;
        for (int i = 1; i <= log; i++) update(p >> i);
    }
 
    S get(int p) {
        //assert(0 <= p && p < _n);
        return d[p + size];
    }
 
    S prod(int l, int r) {
        //assert(0 <= l && l <= r && r <= _n);
        S sml = e(), smr = e();
        l += size;
        r += size;
 
        while (l < r) {
            if (l & 1) sml = op(sml, d[l++]);
            if (r & 1) smr = op(d[--r], smr);
            l >>= 1;
            r >>= 1;
        }
        return op(sml, smr);
    }
 
    S all_prod() { return d[1]; }
 
    template <bool (*f)(S)> int max_right(int l) {
        return max_right(l, [](S x) { return f(x); });
    }
    template <class F> int max_right(int l, F f) {
        //assert(0 <= l && l <= _n);
        //assert(f(e()));
        if (l == _n) return _n;
        l += size;
        S sm = e();
        do {
            while (l % 2 == 0) l >>= 1;
            if (!f(op(sm, d[l]))) {
                while (l < size) {
                    l = (2 * l);
                    if (f(op(sm, d[l]))) {
                        sm = op(sm, d[l]);
                        l++;
                    }
                }
                return l - size;
            }
            sm = op(sm, d[l]);
            l++;
        } while ((l & -l) != l);
        return _n;
    }
 
    template <bool (*f)(S)> int min_left(int r) {
        return min_left(r, [](S x) { return f(x); });
    }
    template <class F> int min_left(int r, F f) {
        //assert(0 <= r && r <= _n);
        //assert(f(e()));
        if (r == 0) return 0;
        r += size;
        S sm = e();
        do {
            r--;
            while (r > 1 && (r % 2)) r >>= 1;
            if (!f(op(d[r], sm))) {
                while (r < size) {
                    r = (2 * r + 1);
                    if (f(op(d[r], sm))) {
                        sm = op(d[r], sm);
                        r--;
                    }
                }
                return r + 1 - size;
            }
            sm = op(d[r], sm);
        } while ((r & -r) != r);
        return 0;
    }
 
  private:
    int _n, size, log;
    std::vector<S> d;
 
    void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }
};
 
}  // namespace atcoder
// cut here 

using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define rng(i,c,n) for(int i=c;i<n;i++)
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define vec(...) vector<__VA_ARGS__>
#define _3D2ZDxo ios::sync_with_stdio(0),cin.tie(0)
typedef long long ll;
using pii=pair<int,int>;
using vi=vector<int>;
void print(){cout<<'\n';}
template<class h,class...t>
void print(const h&v,const t&...u){cout<<v<<' ',print(u...);}

void chmax(pii&a,pii b){
	if(a.fi<b.fi){
		a=b;
	}else if(a.fi==b.fi){
		a.se=min(a.se,b.se);
	}
}

const int _n=4000011;

pii seg[_n];
int lazy[_n],flag[_n];

struct lazy_segtree{
	int n,en;
	lazy_segtree(int m){
		init(m);
	}
	void init(int m){
		n=m;
		en=1;
		while(en<=m){
			en*=2;
		}
		en*=2;
		// // seg.clear();
		// // lazy.clear();
		// // flag.clear();
		// // seg.resize(n+1,{0,0});
		// // lazy.resize(n+1,0);
		// // flag.resize(n+1,false);
		// n=m;
	}
	void build(int node,int l,int r){
		if(l==r-1){
			seg[node].fi=0;
			seg[node].se=l;
			return;
		}
		int m=(l+r)>>1;
		build(node*2,l,m);
		build(node*2+1,m,r);
		seg[node].se=l;
	}
	void push(int l,int r,int node){
		if(flag[node]){
			seg[node].fi+=lazy[node];
			// print(l,r,seg[node].fi,seg[node].se);
			if(node*2<en){
				lazy[node*2]+=lazy[node];
				flag[node*2]=true;
			}
			if(node*2+1<en){
				lazy[node*2+1]+=lazy[node];
				flag[node*2+1]=true;
			}
			flag[node]=false;
			lazy[node]=0;
		}
	}
	void set(int node,int l,int r,int x,int _l,int _r){
		push(l,r,node);
		if(l>=_r or r<=_l){
			return;
		}
		if(l>=_l and r<=_r){
			lazy[node]+=x;
			flag[node]=true;
			push(l,r,node);
			return;
		}
		int m=(l+r)>>1;
		set(node*2,l,m,x,_l,_r);
		set(node*2+1,m,r,x,_l,_r);
		// prod seg_node
		seg[node]={0,0};
		chmax(seg[node],seg[node*2]);
		chmax(seg[node],seg[node*2+1]);
		// print(seg[node*2+1].fi,seg[node*2+1].se,l,r);
	}
	pii prod(int node,int l,int r,int _l,int _r){
		push(l,r,node);
		// _e
		if(l>=_r or r<=_l){
			return {0,0};
		}
		if(l>=_l and r<=_r){
			// print(l,r,seg[node].fi,seg[node].se);
			return seg[node];
		}
		int m=(l+r)>>1;
		pii vl=prod(node*2,l,m,_l,_r);
		pii vr=prod(node*2+1,m,r,_l,_r);
		chmax(vl,vr);
		return vl;
	}
	void build(){
		build(1,0,n);
	}
	void set(int l,int r,int x){
		// [l,r)
		//assert(l<r);
		set(1,0,n,x,l,r);
	}
	pii prod(int l,int r){
		// [l,r)
		return prod(1,0,n,l,r);
	}
};

const int inf=1e9;

pii op(pii l,pii r){return (r.fi<l.fi?r:l);}
pii e(){return {inf,-1};}

int tar;
bool f(pii p){
	return p.fi>tar;
}

signed main(){
_3D2ZDxo;
	int n,k,t;
	cin>>n>>k>>t;
	k=min(k,n);
	vi a(n);
	rep(i,n){
		cin>>a[i];
	}

	vi dl(n,-1);
	{
		set<pii> st;
		rep(i,n){
			if(sz(st)){
				auto it=st.lower_bound({i,-1});
				if(it!=st.end()){
					dl[i]=(*it).se;
				}
			}
			int val=t-a[i]+i;
			while(sz(st)){
				auto it=st.begin();
				pii p=*it;
				if(p.fi>val) break;
				st.erase(it);
			}
			st.insert({val,i});
		}
	}

	atcoder::segtree<pii,op,e> ids(n);
	lazy_segtree seg(n);
	seg.build();
	set<pii> st;
	int ans=n;
	rep(i,n){
		if(a[i]<=t) continue;
		if(dl[i]==-1){
			ans-=1;
		}else{
			seg.set(dl[i],i+1,1);
			ids.set(i,{dl[i],i});
		}
	}

	while(k){
		pii p=seg.prod(0,n);
		if(p.fi==0) break;
		ans-=p.fi;
		int frm=p.se;
		while(p.fi>0){
			tar=frm;
			int c=ids.max_right<f>(frm);
			int j=c;
			seg.set(dl[j],j+1,-1);
			ids.set(j,{inf,-1});
			p.fi-=1;
		}
		k-=1;
	}
	print(ans);
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 206 ms 28292 KB Output is correct
3 Correct 161 ms 28112 KB Output is correct
4 Correct 304 ms 32920 KB Output is correct
5 Correct 273 ms 28840 KB Output is correct
6 Correct 195 ms 26788 KB Output is correct
7 Correct 633 ms 28840 KB Output is correct
8 Correct 221 ms 28328 KB Output is correct

Subtask #3
20.0 / 20.0

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

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 31 ms 7004 KB Output is correct
3 Correct 28 ms 7024 KB Output is correct
4 Correct 67 ms 7292 KB Output is correct
5 Correct 73 ms 7128 KB Output is correct
6 Correct 72 ms 7088 KB Output is correct
7 Correct 30 ms 6576 KB Output is correct
8 Correct 29 ms 6280 KB Output is correct
9 Correct 90 ms 7024 KB Output is correct
10 Correct 24 ms 6856 KB Output is correct

Subtask #5
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 380 KB Output is correct
23 Correct 2 ms 468 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 3 ms 468 KB Output is correct
28 Correct 2 ms 596 KB Output is correct
29 Correct 2 ms 596 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 3 ms 596 KB Output is correct
32 Correct 2 ms 552 KB Output is correct
33 Correct 2 ms 596 KB Output is correct
34 Correct 3 ms 596 KB Output is correct
35 Correct 3 ms 596 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 31 ms 7004 KB Output is correct
38 Correct 28 ms 7024 KB Output is correct
39 Correct 67 ms 7292 KB Output is correct
40 Correct 73 ms 7128 KB Output is correct
41 Correct 72 ms 7088 KB Output is correct
42 Correct 30 ms 6576 KB Output is correct
43 Correct 29 ms 6280 KB Output is correct
44 Correct 90 ms 7024 KB Output is correct
45 Correct 24 ms 6856 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 1 ms 340 KB Output is correct
57 Correct 2 ms 468 KB Output is correct
58 Correct 2 ms 596 KB Output is correct
59 Correct 3 ms 600 KB Output is correct
60 Correct 2 ms 596 KB Output is correct
61 Correct 2 ms 468 KB Output is correct
62 Correct 2 ms 468 KB Output is correct
63 Correct 2 ms 596 KB Output is correct
64 Correct 2 ms 468 KB Output is correct
65 Correct 2 ms 596 KB Output is correct
66 Correct 2 ms 596 KB Output is correct
67 Correct 2 ms 596 KB Output is correct
68 Correct 2 ms 596 KB Output is correct
69 Correct 3 ms 724 KB Output is correct
70 Correct 0 ms 328 KB Output is correct
71 Correct 36 ms 6972 KB Output is correct
72 Correct 30 ms 6916 KB Output is correct
73 Correct 60 ms 7356 KB Output is correct
74 Correct 68 ms 7152 KB Output is correct
75 Correct 79 ms 7040 KB Output is correct
76 Correct 30 ms 6532 KB Output is correct
77 Correct 29 ms 6276 KB Output is correct
78 Correct 89 ms 7036 KB Output is correct
79 Correct 24 ms 6772 KB Output is correct
80 Correct 37 ms 6928 KB Output is correct
81 Correct 49 ms 7000 KB Output is correct
82 Correct 40 ms 7004 KB Output is correct
83 Correct 61 ms 7188 KB Output is correct
84 Correct 48 ms 7004 KB Output is correct
85 Correct 73 ms 7036 KB Output is correct
86 Correct 48 ms 7044 KB Output is correct
87 Correct 40 ms 6548 KB Output is correct
88 Correct 79 ms 7008 KB Output is correct
89 Correct 65 ms 7068 KB Output is correct
90 Correct 53 ms 7048 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 206 ms 28292 KB Output is correct
14 Correct 161 ms 28112 KB Output is correct
15 Correct 304 ms 32920 KB Output is correct
16 Correct 273 ms 28840 KB Output is correct
17 Correct 195 ms 26788 KB Output is correct
18 Correct 633 ms 28840 KB Output is correct
19 Correct 221 ms 28328 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 380 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 2 ms 468 KB Output is correct
33 Correct 2 ms 468 KB Output is correct
34 Correct 2 ms 468 KB Output is correct
35 Correct 3 ms 468 KB Output is correct
36 Correct 2 ms 596 KB Output is correct
37 Correct 2 ms 596 KB Output is correct
38 Correct 2 ms 468 KB Output is correct
39 Correct 3 ms 596 KB Output is correct
40 Correct 2 ms 552 KB Output is correct
41 Correct 2 ms 596 KB Output is correct
42 Correct 3 ms 596 KB Output is correct
43 Correct 3 ms 596 KB Output is correct
44 Correct 0 ms 340 KB Output is correct
45 Correct 31 ms 7004 KB Output is correct
46 Correct 28 ms 7024 KB Output is correct
47 Correct 67 ms 7292 KB Output is correct
48 Correct 73 ms 7128 KB Output is correct
49 Correct 72 ms 7088 KB Output is correct
50 Correct 30 ms 6576 KB Output is correct
51 Correct 29 ms 6280 KB Output is correct
52 Correct 90 ms 7024 KB Output is correct
53 Correct 24 ms 6856 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 1 ms 340 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 1 ms 340 KB Output is correct
59 Correct 1 ms 340 KB Output is correct
60 Correct 1 ms 340 KB Output is correct
61 Correct 1 ms 340 KB Output is correct
62 Correct 1 ms 340 KB Output is correct
63 Correct 1 ms 340 KB Output is correct
64 Correct 1 ms 340 KB Output is correct
65 Correct 2 ms 468 KB Output is correct
66 Correct 2 ms 596 KB Output is correct
67 Correct 3 ms 600 KB Output is correct
68 Correct 2 ms 596 KB Output is correct
69 Correct 2 ms 468 KB Output is correct
70 Correct 2 ms 468 KB Output is correct
71 Correct 2 ms 596 KB Output is correct
72 Correct 2 ms 468 KB Output is correct
73 Correct 2 ms 596 KB Output is correct
74 Correct 2 ms 596 KB Output is correct
75 Correct 2 ms 596 KB Output is correct
76 Correct 2 ms 596 KB Output is correct
77 Correct 3 ms 724 KB Output is correct
78 Correct 0 ms 328 KB Output is correct
79 Correct 36 ms 6972 KB Output is correct
80 Correct 30 ms 6916 KB Output is correct
81 Correct 60 ms 7356 KB Output is correct
82 Correct 68 ms 7152 KB Output is correct
83 Correct 79 ms 7040 KB Output is correct
84 Correct 30 ms 6532 KB Output is correct
85 Correct 29 ms 6276 KB Output is correct
86 Correct 89 ms 7036 KB Output is correct
87 Correct 24 ms 6772 KB Output is correct
88 Correct 37 ms 6928 KB Output is correct
89 Correct 49 ms 7000 KB Output is correct
90 Correct 40 ms 7004 KB Output is correct
91 Correct 61 ms 7188 KB Output is correct
92 Correct 48 ms 7004 KB Output is correct
93 Correct 73 ms 7036 KB Output is correct
94 Correct 48 ms 7044 KB Output is correct
95 Correct 40 ms 6548 KB Output is correct
96 Correct 79 ms 7008 KB Output is correct
97 Correct 65 ms 7068 KB Output is correct
98 Correct 53 ms 7048 KB Output is correct
99 Correct 0 ms 212 KB Output is correct
100 Correct 0 ms 340 KB Output is correct
101 Correct 1 ms 340 KB Output is correct
102 Correct 1 ms 340 KB Output is correct
103 Correct 1 ms 340 KB Output is correct
104 Correct 1 ms 340 KB Output is correct
105 Correct 1 ms 340 KB Output is correct
106 Correct 1 ms 340 KB Output is correct
107 Correct 1 ms 300 KB Output is correct
108 Correct 1 ms 340 KB Output is correct
109 Correct 1 ms 340 KB Output is correct
110 Correct 1 ms 340 KB Output is correct
111 Correct 202 ms 28400 KB Output is correct
112 Correct 161 ms 28056 KB Output is correct
113 Correct 291 ms 32960 KB Output is correct
114 Correct 235 ms 28756 KB Output is correct
115 Correct 206 ms 26756 KB Output is correct
116 Correct 648 ms 28788 KB Output is correct
117 Correct 221 ms 28276 KB Output is correct
118 Correct 2 ms 596 KB Output is correct
119 Correct 2 ms 596 KB Output is correct
120 Correct 3 ms 468 KB Output is correct
121 Correct 2 ms 596 KB Output is correct
122 Correct 4 ms 596 KB Output is correct
123 Correct 3 ms 488 KB Output is correct
124 Correct 2 ms 468 KB Output is correct
125 Correct 2 ms 596 KB Output is correct
126 Correct 2 ms 596 KB Output is correct
127 Correct 1 ms 596 KB Output is correct
128 Correct 2 ms 596 KB Output is correct
129 Correct 3 ms 596 KB Output is correct
130 Correct 3 ms 596 KB Output is correct
131 Correct 1 ms 340 KB Output is correct
132 Correct 33 ms 6912 KB Output is correct
133 Correct 29 ms 7000 KB Output is correct
134 Correct 63 ms 7316 KB Output is correct
135 Correct 70 ms 7084 KB Output is correct
136 Correct 73 ms 7148 KB Output is correct
137 Correct 29 ms 6544 KB Output is correct
138 Correct 28 ms 6280 KB Output is correct
139 Correct 93 ms 7028 KB Output is correct
140 Correct 23 ms 6840 KB Output is correct
141 Correct 35 ms 6996 KB Output is correct
142 Correct 46 ms 7048 KB Output is correct
143 Correct 41 ms 6952 KB Output is correct
144 Correct 64 ms 7160 KB Output is correct
145 Correct 48 ms 6972 KB Output is correct
146 Correct 79 ms 7040 KB Output is correct
147 Correct 47 ms 6912 KB Output is correct
148 Correct 34 ms 6664 KB Output is correct
149 Correct 79 ms 7064 KB Output is correct
150 Correct 73 ms 7048 KB Output is correct
151 Correct 57 ms 7056 KB Output is correct
152 Runtime error 426 ms 159296 KB Execution killed with signal 11
153 Halted 0 ms 0 KB -