oj.uz

답안 #489643

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
489643 2021-11-23T13:44:52 Z Killer2501 The short shank; Redemption (BOI21_prison) C++17
100 / 100
 1577 ms 250252 KB 
#include <algorithm>
#include <numeric>
#include <iostream>
#include <cstring>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cassert>
#define pll pair<int, int>
#define task "test"
#define fi first
#define se second
using namespace std;
using ll = int;
const int  N = 2e6+15;
const ll mod = 998244353;
const ll base = 350;
const ll inf = 1e9;

ll m, n, t, k,ans, tong, a[N], b[N], c[N], d[N], in[N], out[N], cnt, pos[N];
vector<ll> adj[N];
stack<ll> kq;
pll seg[N];
ll pw(ll k, ll n)
{
	ll total = 1;
	for(; n; n >>= 1)
	{
		if(n&1)total = total * k % mod;
		k = k * k % mod;
	}
	return total;
}
struct BIT
{
	ll n;
	vector<ll> fe;
	BIT (ll _n)
	{
		n = _n;
		fe.resize(n+1, 0);
	}
	void clear()
	{
		fill(fe.begin(), fe.end(), 0);
	}
	void add(ll id, ll x)
	{
		for(; id <= n; id += id & -id)fe[id] += x;
	}
	void add(ll l, ll r, ll x)
	{
		if(l > r)return;
		add(l, x);
		add(r+1, -x);
	}
	ll get(ll id)
	{
		ll total = 0;
		for(; id; id -= id & -id)total += fe[id];
		return total;
	}
};
struct suffix
{
	int n, m;
	string s;
	vector<int> cls, p, pn, cnt, rnk, lcp;
	suffix(string _s)
	{
		s = _s + "$";
		n = s.length();
		m = max(n, 256);
		cls.resize(n);
		p.resize(n, 0);
		rnk.resize(n);
		lcp.resize(n);
		pn.resize(n, 0);
		cnt.resize(m+1, 0);
	}
	void fix()
	{
		for(int i = 0; i < n; i ++)++cnt[(int)s[i]-'$'];
		for(int i = 1; i <= m; i ++)cnt[i] += cnt[i-1];
		for(int i = n-1; i >= 0; i --)p[--cnt[(int)s[i]-'$']] = i;
		m = 0;
		cls[p[0]] = m;
		for(int i = 1; i < n; i ++)
		{
			if(s[p[i]] != s[p[i-1]])++m;
			cls[p[i]] = m;
		}
		for(int j = 0; (1<<j) < n; j ++)
		{
			vector<int> cn(n);
			for(int i = 0; i < n; i ++)
			{
				pn[i] = p[i] - (1<<j);
				if(pn[i] < 0)pn[i] += n;
			}
			fill(cnt.begin(), cnt.end(), 0);
			for(int i = 0; i < n; i ++)++cnt[cls[pn[i]]];
			for(int i = 1; i <= m; i ++)cnt[i] += cnt[i-1];
			for(int i = n-1; i >= 0; i --)p[--cnt[cls[pn[i]]]] = pn[i];
			//for(int i = 0; i < n; i ++)cout << p[i] <<" ";
			//cout << '\n';

			m = 0;
			cn[p[0]] = m;
			for(int i = 1; i < n; i ++)
			{
				if(cls[p[i]] != cls[p[i-1]] || cls[(p[i]+(1<<j))%n] != cls[(p[i-1]+(1<<j))%n])
					++m;
				cn[p[i]] = m;
			}
			cls.swap(cn);
		}
		int len = 0;
		for(int i = 0; i < n; i ++)
		{
			//cout << p[i] <<" "<<i<< '\n';
			rnk[p[i]] = i;
		}
		for(int i = 0; i < n; i ++)
		{
			if(rnk[i] == n-1)continue;
			int j = p[rnk[i]+1];
			while(max(i, j)+len < n && s[i+len] == s[j+len])++len;
			lcp[rnk[i]] =  len;
			if(len)--len;
		}

	}
};
string s;
inline bool cmp(const pll& x, const pll& y)
{
    return (x.fi < y.fi) || (x.fi == y.fi && x.se > y.se);
}

    vector<pll> st;
    vector<ll> lazy;
    inline void build(ll id, ll l, ll r)
    {
        lazy[id] = 0;
        if(l == r)
        {
            st[id].fi = 0;
            st[id].se = pos[l];
            return;
        }
        ll mid = (l+r)>>1;
        build(id<<1, l ,mid);
        build(id<<1|1, mid+1, r);
        if(st[id<<1].fi < st[id<<1|1].fi)st[id] = st[id<<1|1];
        else st[id] = st[id<<1];
    }
    inline void down(ll id)
    {
        st[id<<1].fi += lazy[id];
        st[id<<1|1].fi += lazy[id];
        lazy[id<<1] += lazy[id];
        lazy[id<<1|1] += lazy[id];
        lazy[id] = 0;
    }
    inline void update(ll id, ll l, ll r, ll u, ll v, ll x)
    {
        if(u > r || l > v)return;
        if(u <= l && r <= v)
        {
            st[id].fi += x;
            lazy[id] += x;
            return;
        }
        if(lazy[id])down(id);
        ll mid = (l+r)>>1;
        update(id<<1, l, mid, u, v, x);
        update(id<<1|1, mid+1, r, u, v, x);
        if(st[id<<1].fi < st[id<<1|1].fi)st[id] = st[id<<1|1];
        else st[id] = st[id<<1];
    }

inline void dfs(ll u)
{
    in[u] = ++cnt;
    pos[cnt] = u;
    for(ll v: adj[u])dfs(v);
    out[u] = cnt;
}
template<typename T>
inline void read(T&x)
{
    bool Neg=false;
    char c;
    for(c= getchar();c<'0'||c>'9';c=getchar())
        if(c=='-') Neg =!Neg;
    x = c-'0';
    for (c=getchar();c>='0'&&c<='9';c=getchar())
        x=x*10+c-'0';
    if(Neg&&x>0) x=-x;
}
bool ok[N];
inline void sol()
{
    read(n);
    read(k);
    read(t);
    for(int i = 1; i <= n; i ++)
    {
        read(a[i]);
        while(!kq.empty() && a[kq.top()]-kq.top() > t-i)kq.pop();
        if(!kq.empty() && a[kq.top()]-kq.top()+i <= t && a[i] > t)
        {
            //cout << kq.back() <<" "<<i-1<<'\n';
            seg[m].fi = kq.top();
            seg[m].se = 1-i;
            ++m;
            ++ans;
        }
        else if(a[i] <= t)++ans;
        kq.push(i);
    }
    sort(seg, seg+m);
    ++ans;

    for(int i = 0, j = 0; i < m; i ++)
    {
        //cout << i <<" "<<seg[i].fi <<" "<<seg[i].se<<'\n';
        while(j && !(seg[j-1].fi <= seg[i].fi && seg[i].se >= seg[j-1].se))j = b[j];
        adj[j].push_back(i+1);
        //cout << j <<" "<<seg[j].fi <<" "<<seg[j].se<<'\n';
        b[i+1] = j;
        j = i+1;
    }
    dfs(0);
    st.resize(cnt*4);
    lazy.resize(cnt*4);
    build(1, 1, cnt);
    for(int i = 1; i <= cnt; i ++)
    {
        t = pos[i];
        update(1, 1, cnt, in[t], out[t], 1);
    }
    //cout << ans << '\n';
    while(k -- > 0)
    {
        if(!ans)break;
        ans -= st[1].fi;
        t = st[1].se;
        //cout << it.st[1].fi <<" "<<it.st[1].se << '\n';
        while(!ok[t])
        {
            ok[t] = true;
            update(1, 1, cnt, in[t], out[t], -1);
            t = b[t];
        }
    }
    cout << ans;
}
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    if(fopen(task".inp", "r"))
    {
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }
    int ntest = 1;
    //cin >> ntest;
    while(ntest -- > 0)
    sol();
}

Compilation message

prison.cpp: In function 'int main()':
prison.cpp:270:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  270 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
prison.cpp:271:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  271 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 47296 KB Output is correct
2 Correct 25 ms 47244 KB Output is correct
3 Correct 22 ms 47308 KB Output is correct
4 Correct 23 ms 47340 KB Output is correct
5 Correct 24 ms 47308 KB Output is correct
6 Correct 22 ms 47384 KB Output is correct
7 Correct 26 ms 47372 KB Output is correct
8 Correct 23 ms 47252 KB Output is correct
9 Correct 23 ms 47360 KB Output is correct
10 Correct 23 ms 47308 KB Output is correct
11 Correct 22 ms 47332 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 47312 KB Output is correct
2 Correct 132 ms 73296 KB Output is correct
3 Correct 127 ms 65916 KB Output is correct
4 Correct 143 ms 75708 KB Output is correct
5 Correct 167 ms 81304 KB Output is correct
6 Correct 136 ms 70444 KB Output is correct
7 Correct 481 ms 114548 KB Output is correct
8 Correct 156 ms 74708 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 47296 KB Output is correct
2 Correct 25 ms 47244 KB Output is correct
3 Correct 22 ms 47308 KB Output is correct
4 Correct 23 ms 47340 KB Output is correct
5 Correct 24 ms 47308 KB Output is correct
6 Correct 22 ms 47384 KB Output is correct
7 Correct 26 ms 47372 KB Output is correct
8 Correct 23 ms 47252 KB Output is correct
9 Correct 23 ms 47360 KB Output is correct
10 Correct 23 ms 47308 KB Output is correct
11 Correct 22 ms 47332 KB Output is correct
12 Correct 23 ms 47232 KB Output is correct
13 Correct 22 ms 47264 KB Output is correct
14 Correct 22 ms 47308 KB Output is correct
15 Correct 23 ms 47308 KB Output is correct
16 Correct 25 ms 47340 KB Output is correct
17 Correct 25 ms 47316 KB Output is correct
18 Correct 23 ms 47304 KB Output is correct
19 Correct 25 ms 47304 KB Output is correct
20 Correct 24 ms 47272 KB Output is correct
21 Correct 23 ms 47308 KB Output is correct
22 Correct 23 ms 47272 KB Output is correct
23 Correct 23 ms 47564 KB Output is correct
24 Correct 24 ms 47592 KB Output is correct
25 Correct 25 ms 47572 KB Output is correct
26 Correct 25 ms 47548 KB Output is correct
27 Correct 25 ms 47604 KB Output is correct
28 Correct 24 ms 47576 KB Output is correct
29 Correct 24 ms 47564 KB Output is correct
30 Correct 24 ms 47460 KB Output is correct
31 Correct 24 ms 47512 KB Output is correct
32 Correct 24 ms 47436 KB Output is correct
33 Correct 28 ms 47500 KB Output is correct
34 Correct 25 ms 47556 KB Output is correct
35 Correct 24 ms 47584 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 47308 KB Output is correct
2 Correct 42 ms 52696 KB Output is correct
3 Correct 39 ms 51788 KB Output is correct
4 Correct 51 ms 53968 KB Output is correct
5 Correct 50 ms 54840 KB Output is correct
6 Correct 52 ms 55164 KB Output is correct
7 Correct 38 ms 51096 KB Output is correct
8 Correct 36 ms 50764 KB Output is correct
9 Correct 86 ms 57720 KB Output is correct
10 Correct 38 ms 50756 KB Output is correct

Subtask #5
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 47296 KB Output is correct
2 Correct 25 ms 47244 KB Output is correct
3 Correct 22 ms 47308 KB Output is correct
4 Correct 23 ms 47340 KB Output is correct
5 Correct 24 ms 47308 KB Output is correct
6 Correct 22 ms 47384 KB Output is correct
7 Correct 26 ms 47372 KB Output is correct
8 Correct 23 ms 47252 KB Output is correct
9 Correct 23 ms 47360 KB Output is correct
10 Correct 23 ms 47308 KB Output is correct
11 Correct 22 ms 47332 KB Output is correct
12 Correct 23 ms 47232 KB Output is correct
13 Correct 22 ms 47264 KB Output is correct
14 Correct 22 ms 47308 KB Output is correct
15 Correct 23 ms 47308 KB Output is correct
16 Correct 25 ms 47340 KB Output is correct
17 Correct 25 ms 47316 KB Output is correct
18 Correct 23 ms 47304 KB Output is correct
19 Correct 25 ms 47304 KB Output is correct
20 Correct 24 ms 47272 KB Output is correct
21 Correct 23 ms 47308 KB Output is correct
22 Correct 23 ms 47272 KB Output is correct
23 Correct 23 ms 47564 KB Output is correct
24 Correct 24 ms 47592 KB Output is correct
25 Correct 25 ms 47572 KB Output is correct
26 Correct 25 ms 47548 KB Output is correct
27 Correct 25 ms 47604 KB Output is correct
28 Correct 24 ms 47576 KB Output is correct
29 Correct 24 ms 47564 KB Output is correct
30 Correct 24 ms 47460 KB Output is correct
31 Correct 24 ms 47512 KB Output is correct
32 Correct 24 ms 47436 KB Output is correct
33 Correct 28 ms 47500 KB Output is correct
34 Correct 25 ms 47556 KB Output is correct
35 Correct 24 ms 47584 KB Output is correct
36 Correct 23 ms 47308 KB Output is correct
37 Correct 42 ms 52696 KB Output is correct
38 Correct 39 ms 51788 KB Output is correct
39 Correct 51 ms 53968 KB Output is correct
40 Correct 50 ms 54840 KB Output is correct
41 Correct 52 ms 55164 KB Output is correct
42 Correct 38 ms 51096 KB Output is correct
43 Correct 36 ms 50764 KB Output is correct
44 Correct 86 ms 57720 KB Output is correct
45 Correct 38 ms 50756 KB Output is correct
46 Correct 24 ms 47308 KB Output is correct
47 Correct 23 ms 47308 KB Output is correct
48 Correct 27 ms 47280 KB Output is correct
49 Correct 31 ms 47384 KB Output is correct
50 Correct 25 ms 47292 KB Output is correct
51 Correct 23 ms 47340 KB Output is correct
52 Correct 23 ms 47364 KB Output is correct
53 Correct 22 ms 47300 KB Output is correct
54 Correct 22 ms 47308 KB Output is correct
55 Correct 23 ms 47352 KB Output is correct
56 Correct 22 ms 47276 KB Output is correct
57 Correct 24 ms 47520 KB Output is correct
58 Correct 25 ms 47568 KB Output is correct
59 Correct 24 ms 47584 KB Output is correct
60 Correct 24 ms 47476 KB Output is correct
61 Correct 24 ms 47564 KB Output is correct
62 Correct 25 ms 47584 KB Output is correct
63 Correct 25 ms 47564 KB Output is correct
64 Correct 23 ms 47452 KB Output is correct
65 Correct 24 ms 47452 KB Output is correct
66 Correct 26 ms 47408 KB Output is correct
67 Correct 24 ms 47400 KB Output is correct
68 Correct 24 ms 47624 KB Output is correct
69 Correct 24 ms 47596 KB Output is correct
70 Correct 24 ms 47284 KB Output is correct
71 Correct 43 ms 52688 KB Output is correct
72 Correct 40 ms 51792 KB Output is correct
73 Correct 49 ms 53980 KB Output is correct
74 Correct 52 ms 54884 KB Output is correct
75 Correct 59 ms 55164 KB Output is correct
76 Correct 41 ms 51088 KB Output is correct
77 Correct 40 ms 50784 KB Output is correct
78 Correct 109 ms 57660 KB Output is correct
79 Correct 34 ms 50692 KB Output is correct
80 Correct 42 ms 51780 KB Output is correct
81 Correct 66 ms 52688 KB Output is correct
82 Correct 50 ms 51780 KB Output is correct
83 Correct 60 ms 53592 KB Output is correct
84 Correct 49 ms 52292 KB Output is correct
85 Correct 59 ms 55824 KB Output is correct
86 Correct 50 ms 52428 KB Output is correct
87 Correct 41 ms 50600 KB Output is correct
88 Correct 87 ms 56000 KB Output is correct
89 Correct 81 ms 57436 KB Output is correct
90 Correct 65 ms 55308 KB Output is correct

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 47296 KB Output is correct
2 Correct 25 ms 47244 KB Output is correct
3 Correct 22 ms 47308 KB Output is correct
4 Correct 23 ms 47340 KB Output is correct
5 Correct 24 ms 47308 KB Output is correct
6 Correct 22 ms 47384 KB Output is correct
7 Correct 26 ms 47372 KB Output is correct
8 Correct 23 ms 47252 KB Output is correct
9 Correct 23 ms 47360 KB Output is correct
10 Correct 23 ms 47308 KB Output is correct
11 Correct 22 ms 47332 KB Output is correct
12 Correct 23 ms 47312 KB Output is correct
13 Correct 132 ms 73296 KB Output is correct
14 Correct 127 ms 65916 KB Output is correct
15 Correct 143 ms 75708 KB Output is correct
16 Correct 167 ms 81304 KB Output is correct
17 Correct 136 ms 70444 KB Output is correct
18 Correct 481 ms 114548 KB Output is correct
19 Correct 156 ms 74708 KB Output is correct
20 Correct 23 ms 47232 KB Output is correct
21 Correct 22 ms 47264 KB Output is correct
22 Correct 22 ms 47308 KB Output is correct
23 Correct 23 ms 47308 KB Output is correct
24 Correct 25 ms 47340 KB Output is correct
25 Correct 25 ms 47316 KB Output is correct
26 Correct 23 ms 47304 KB Output is correct
27 Correct 25 ms 47304 KB Output is correct
28 Correct 24 ms 47272 KB Output is correct
29 Correct 23 ms 47308 KB Output is correct
30 Correct 23 ms 47272 KB Output is correct
31 Correct 23 ms 47564 KB Output is correct
32 Correct 24 ms 47592 KB Output is correct
33 Correct 25 ms 47572 KB Output is correct
34 Correct 25 ms 47548 KB Output is correct
35 Correct 25 ms 47604 KB Output is correct
36 Correct 24 ms 47576 KB Output is correct
37 Correct 24 ms 47564 KB Output is correct
38 Correct 24 ms 47460 KB Output is correct
39 Correct 24 ms 47512 KB Output is correct
40 Correct 24 ms 47436 KB Output is correct
41 Correct 28 ms 47500 KB Output is correct
42 Correct 25 ms 47556 KB Output is correct
43 Correct 24 ms 47584 KB Output is correct
44 Correct 23 ms 47308 KB Output is correct
45 Correct 42 ms 52696 KB Output is correct
46 Correct 39 ms 51788 KB Output is correct
47 Correct 51 ms 53968 KB Output is correct
48 Correct 50 ms 54840 KB Output is correct
49 Correct 52 ms 55164 KB Output is correct
50 Correct 38 ms 51096 KB Output is correct
51 Correct 36 ms 50764 KB Output is correct
52 Correct 86 ms 57720 KB Output is correct
53 Correct 38 ms 50756 KB Output is correct
54 Correct 24 ms 47308 KB Output is correct
55 Correct 23 ms 47308 KB Output is correct
56 Correct 27 ms 47280 KB Output is correct
57 Correct 31 ms 47384 KB Output is correct
58 Correct 25 ms 47292 KB Output is correct
59 Correct 23 ms 47340 KB Output is correct
60 Correct 23 ms 47364 KB Output is correct
61 Correct 22 ms 47300 KB Output is correct
62 Correct 22 ms 47308 KB Output is correct
63 Correct 23 ms 47352 KB Output is correct
64 Correct 22 ms 47276 KB Output is correct
65 Correct 24 ms 47520 KB Output is correct
66 Correct 25 ms 47568 KB Output is correct
67 Correct 24 ms 47584 KB Output is correct
68 Correct 24 ms 47476 KB Output is correct
69 Correct 24 ms 47564 KB Output is correct
70 Correct 25 ms 47584 KB Output is correct
71 Correct 25 ms 47564 KB Output is correct
72 Correct 23 ms 47452 KB Output is correct
73 Correct 24 ms 47452 KB Output is correct
74 Correct 26 ms 47408 KB Output is correct
75 Correct 24 ms 47400 KB Output is correct
76 Correct 24 ms 47624 KB Output is correct
77 Correct 24 ms 47596 KB Output is correct
78 Correct 24 ms 47284 KB Output is correct
79 Correct 43 ms 52688 KB Output is correct
80 Correct 40 ms 51792 KB Output is correct
81 Correct 49 ms 53980 KB Output is correct
82 Correct 52 ms 54884 KB Output is correct
83 Correct 59 ms 55164 KB Output is correct
84 Correct 41 ms 51088 KB Output is correct
85 Correct 40 ms 50784 KB Output is correct
86 Correct 109 ms 57660 KB Output is correct
87 Correct 34 ms 50692 KB Output is correct
88 Correct 42 ms 51780 KB Output is correct
89 Correct 66 ms 52688 KB Output is correct
90 Correct 50 ms 51780 KB Output is correct
91 Correct 60 ms 53592 KB Output is correct
92 Correct 49 ms 52292 KB Output is correct
93 Correct 59 ms 55824 KB Output is correct
94 Correct 50 ms 52428 KB Output is correct
95 Correct 41 ms 50600 KB Output is correct
96 Correct 87 ms 56000 KB Output is correct
97 Correct 81 ms 57436 KB Output is correct
98 Correct 65 ms 55308 KB Output is correct
99 Correct 26 ms 47256 KB Output is correct
100 Correct 25 ms 47320 KB Output is correct
101 Correct 27 ms 47316 KB Output is correct
102 Correct 25 ms 47284 KB Output is correct
103 Correct 23 ms 47316 KB Output is correct
104 Correct 24 ms 47336 KB Output is correct
105 Correct 26 ms 47308 KB Output is correct
106 Correct 26 ms 47276 KB Output is correct
107 Correct 31 ms 47364 KB Output is correct
108 Correct 25 ms 47352 KB Output is correct
109 Correct 28 ms 47320 KB Output is correct
110 Correct 28 ms 47296 KB Output is correct
111 Correct 151 ms 73448 KB Output is correct
112 Correct 117 ms 66068 KB Output is correct
113 Correct 147 ms 75788 KB Output is correct
114 Correct 161 ms 81324 KB Output is correct
115 Correct 156 ms 70464 KB Output is correct
116 Correct 480 ms 114556 KB Output is correct
117 Correct 154 ms 74636 KB Output is correct
118 Correct 25 ms 47612 KB Output is correct
119 Correct 25 ms 47564 KB Output is correct
120 Correct 25 ms 47532 KB Output is correct
121 Correct 25 ms 47584 KB Output is correct
122 Correct 25 ms 47576 KB Output is correct
123 Correct 25 ms 47548 KB Output is correct
124 Correct 25 ms 47564 KB Output is correct
125 Correct 25 ms 47448 KB Output is correct
126 Correct 25 ms 47560 KB Output is correct
127 Correct 25 ms 47548 KB Output is correct
128 Correct 25 ms 47424 KB Output is correct
129 Correct 25 ms 47624 KB Output is correct
130 Correct 26 ms 47564 KB Output is correct
131 Correct 25 ms 47268 KB Output is correct
132 Correct 42 ms 52636 KB Output is correct
133 Correct 40 ms 51788 KB Output is correct
134 Correct 50 ms 53964 KB Output is correct
135 Correct 53 ms 54852 KB Output is correct
136 Correct 55 ms 55216 KB Output is correct
137 Correct 44 ms 51416 KB Output is correct
138 Correct 40 ms 50748 KB Output is correct
139 Correct 84 ms 57700 KB Output is correct
140 Correct 35 ms 50716 KB Output is correct
141 Correct 43 ms 51808 KB Output is correct
142 Correct 51 ms 52676 KB Output is correct
143 Correct 46 ms 51808 KB Output is correct
144 Correct 59 ms 53632 KB Output is correct
145 Correct 56 ms 52436 KB Output is correct
146 Correct 58 ms 55736 KB Output is correct
147 Correct 52 ms 52556 KB Output is correct
148 Correct 42 ms 50636 KB Output is correct
149 Correct 76 ms 55952 KB Output is correct
150 Correct 80 ms 57368 KB Output is correct
151 Correct 66 ms 55236 KB Output is correct
152 Correct 480 ms 148352 KB Output is correct
153 Correct 523 ms 157912 KB Output is correct
154 Correct 447 ms 140920 KB Output is correct
155 Correct 948 ms 191368 KB Output is correct
156 Correct 797 ms 181216 KB Output is correct
157 Correct 363 ms 107128 KB Output is correct
158 Correct 602 ms 146148 KB Output is correct
159 Correct 1577 ms 250252 KB Output is correct
160 Correct 1464 ms 237852 KB Output is correct
161 Correct 426 ms 108564 KB Output is correct
162 Correct 394 ms 111352 KB Output is correct