oj.uz

Submission #595705

# Submission time Handle Problem Language Result Execution time Memory
595705 2022-07-14T01:55:04 Z inksamurai Event Hopping 2 (JOI21_event2) C++17
100 / 100
 246 ms 59992 KB 
#include <bits/stdc++.h>

// 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 rng(i,c,n) for(int i=c;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define vec(...) vector<__VA_ARGS__>
#define _3uHasSr 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...);}
// e

int op(int l,int r){return l+r;}
int e(){return 0;}

const int inf=1e9+11;
using T=pair<int,pii>;

signed main(){
_3uHasSr;
	int n,k;
	cin>>n>>k;
	vec(T) a;
	vec(pii) _a;
	int m;
	{
		rep(i,n){
			pii p;
			cin>>p.fi>>p.se;
			a.pb(T{p.fi,{p.se,i}});
			_a.pb(p);
		}
		vi tmp;
		rep(i,n){
			tmp.pb(_a[i].fi);
			tmp.pb(_a[i].se);
		}
		sort(tmp.begin(), tmp.end());
		tmp.erase(unique(tmp.begin(), tmp.end()),tmp.end());
		m=sz(tmp)+4;
		rep(i,n){
			pii p=_a[i];
			p.fi=(int)(lower_bound(tmp.begin(), tmp.end(),p.fi)-tmp.begin())+2;
			p.se=(int)(lower_bound(tmp.begin(), tmp.end(),p.se)-tmp.begin())+2;
			a[i].fi=p.fi;
			a[i].se.fi=p.se;
			_a[i]=p;
		}
	}
	
	// rep(i,n){
	// 	print(_a[i].fi,_a[i].se);
	// }

	// create double lift
	vec(vec(pii)) gl(30,vec(pii)(n,{-1,-1}));
	{
		sort(a.begin(), a.end());
		priority_queue<pii> pq;
		per(i,n){
			int id=a[i].se.se;
			int l=a[i].fi;
			int r=a[i].se.fi;
			while(sz(pq)){
				auto top=pq.top();
				if(top.fi>=r){
					gl[0][top.se].fi=id;
					pq.pop();
				}else{
					break;
				}
			}
			pq.push(pii(l,id));
		}
		rng(j,1,30){
			rep(i,n){
				gl[j][i].fi=(gl[j-1][i].fi==-1?-1:gl[j-1][gl[j-1][i].fi].fi);
			}
		}
		rep(j,30){
			rep(i,n){
				gl[j][i].se=(gl[j][i].fi==-1?-1:_a[gl[j][i].fi].fi);
			}
		}
	}
	vec(vec(pii)) gr(30,vec(pii)(n,{inf,inf}));
	{
		sort(a.begin(), a.end(),[&](const T&l,const T&r){
			return l.se.fi<r.se.fi;
		});
		priority_queue<pii,vec(pii),greater<pii>> pq;
		rep(i,n){
			int id=a[i].se.se;
			int l=a[i].fi;
			int r=a[i].se.fi;
			while(sz(pq)){
				auto top=pq.top();
				if(top.fi<=l){
					gr[0][top.se].fi=id;
					pq.pop();
				}else{
					break;
				}
			}
			pq.push(pii(r,id));
		}
		rng(j,1,30){
			rep(i,n){
				gr[j][i].fi=(gr[j-1][i].fi==inf?inf:gr[j-1][gr[j-1][i].fi].fi);
			}
		}
		rep(j,30){
			rep(i,n){
				gr[j][i].se=(gr[j][i].fi==inf?inf:_a[gr[j][i].fi].se);
			}
		}
	}
	multiset<T> st;
	atcoder::segtree<int,op,e> seg(m);
	int prefix=0;
	vi pns;
	rep(i,n){
		pii p=_a[i];

		// check if intersects with previously added segment
		int _l=0,idl=-1,_r=inf-1,idr=-1;
		bool pok=1;
		if(sz(st)){
			auto it=st.lower_bound(T{p.fi,{-1,-1}});
			if(it!=st.end()){
				if((*it).fi<p.se){
					pok=0;
				}
				_r=(*it).fi;
				idr=(*it).se.se;
			}
			if(it!=st.begin()){
				it=prev(it);
				if((*it).se.fi>p.fi){
					pok=0;
				}
				_l=(*it).se.fi;
				idl=(*it).se.se;
			}
		}
		if(!pok){
			continue;
		}
		// search first element to the left such that it's l < _l
		int nowl=0;
		{
			int s=i;
			per(j,30){
				int t=gl[j][s].se;
				// print(s,t);
				if(t>=_l){
					s=gl[j][s].fi;
					nowl+=(1<<j);
				}
			}
		}
		// search first element to the right such that it's r > _r
		int nowr=0;
		{
			int s=i;
			per(j,30){
				// print(_r,gr[j][s].fi,s);
				int t=gr[j][s].se;
				if(t<=_r){
					s=gr[j][s].fi;
					nowr+=(1<<j);
				}
			}
		}
		int now_prefix=(idl!=-1?prefix:0);
		int taken_r=(idr!=-1?seg.prod(_r,m):0);
		int taken_l=(idl!=-1?seg.prod(0,_a[idl].fi)+1:0);
		if(taken_l+taken_r+nowr+nowl+now_prefix+1>=k){
			st.insert(T{p.fi,{p.se,i}});
			if(idl==-1){
				prefix=nowl;
			}else{
				// print(1+nowl);
				seg.set(_a[idl].fi,1+nowl);
			}
			// print(p.fi,1+nowr);
			seg.set(p.fi,1+nowr);
			pns.pb(i);
		}
	}
	if(sz(pns)<k){
		print(-1);
		return 0;
	}
	while(sz(pns)>k){
		pns.pop_back();
	}
	for(auto v:pns){
		print(v+1);
	}
// 
	return 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 149 ms 58696 KB Output is correct
5 Correct 183 ms 58536 KB Output is correct
6 Correct 149 ms 58460 KB Output is correct
7 Correct 171 ms 58468 KB Output is correct
8 Correct 152 ms 58572 KB Output is correct
9 Correct 152 ms 58624 KB Output is correct
10 Correct 174 ms 58584 KB Output is correct
11 Correct 151 ms 58460 KB Output is correct
12 Correct 130 ms 55996 KB Output is correct
13 Correct 129 ms 55904 KB Output is correct
14 Correct 135 ms 55976 KB Output is correct
15 Correct 136 ms 55876 KB Output is correct
16 Correct 99 ms 52704 KB Output is correct
17 Correct 99 ms 52632 KB Output is correct
18 Correct 106 ms 52568 KB Output is correct
19 Correct 95 ms 52580 KB Output is correct
20 Correct 90 ms 52576 KB Output is correct
21 Correct 118 ms 52532 KB Output is correct
22 Correct 109 ms 52592 KB Output is correct
23 Correct 102 ms 52592 KB Output is correct
24 Correct 98 ms 52544 KB Output is correct
25 Correct 105 ms 52580 KB Output is correct
26 Correct 109 ms 52580 KB Output is correct
27 Correct 105 ms 52584 KB Output is correct
28 Correct 91 ms 52608 KB Output is correct
29 Correct 93 ms 52696 KB Output is correct
30 Correct 93 ms 52536 KB Output is correct
31 Correct 117 ms 52592 KB Output is correct
32 Correct 106 ms 52600 KB Output is correct
33 Correct 113 ms 52568 KB Output is correct
34 Correct 128 ms 55752 KB Output is correct
35 Correct 132 ms 55664 KB Output is correct
36 Correct 129 ms 55680 KB Output is correct
37 Correct 150 ms 55512 KB Output is correct
38 Correct 141 ms 55380 KB Output is correct
39 Correct 124 ms 55448 KB Output is correct
40 Correct 126 ms 55392 KB Output is correct
41 Correct 131 ms 55440 KB Output is correct
42 Correct 108 ms 53320 KB Output is correct
43 Correct 142 ms 55332 KB Output is correct
44 Correct 142 ms 55272 KB Output is correct
45 Correct 134 ms 55084 KB Output is correct
46 Correct 143 ms 54840 KB Output is correct

Subtask #2
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 324 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 324 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 324 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 0 ms 316 KB Output is correct
27 Correct 1 ms 212 KB Output is correct

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 324 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 324 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 324 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 0 ms 316 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 4 ms 1876 KB Output is correct
29 Correct 4 ms 1876 KB Output is correct
30 Correct 4 ms 1872 KB Output is correct
31 Correct 4 ms 1876 KB Output is correct
32 Correct 4 ms 1876 KB Output is correct
33 Correct 4 ms 1876 KB Output is correct
34 Correct 4 ms 1940 KB Output is correct
35 Correct 6 ms 2132 KB Output is correct
36 Correct 5 ms 2132 KB Output is correct
37 Correct 5 ms 2004 KB Output is correct
38 Correct 4 ms 1868 KB Output is correct
39 Correct 5 ms 2004 KB Output is correct
40 Correct 5 ms 2004 KB Output is correct
41 Correct 5 ms 2004 KB Output is correct
42 Correct 4 ms 1868 KB Output is correct
43 Correct 4 ms 1876 KB Output is correct
44 Correct 4 ms 1876 KB Output is correct
45 Correct 4 ms 1876 KB Output is correct
46 Correct 4 ms 1876 KB Output is correct
47 Correct 4 ms 1868 KB Output is correct
48 Correct 5 ms 2016 KB Output is correct
49 Correct 4 ms 1876 KB Output is correct
50 Correct 7 ms 1876 KB Output is correct
51 Correct 5 ms 2004 KB Output is correct
52 Correct 4 ms 1876 KB Output is correct
53 Correct 4 ms 1876 KB Output is correct
54 Correct 4 ms 1876 KB Output is correct
55 Correct 4 ms 2004 KB Output is correct
56 Correct 5 ms 2004 KB Output is correct
57 Correct 5 ms 2004 KB Output is correct
58 Correct 4 ms 2004 KB Output is correct
59 Correct 4 ms 2004 KB Output is correct
60 Correct 4 ms 2004 KB Output is correct
61 Correct 4 ms 2004 KB Output is correct
62 Correct 6 ms 2004 KB Output is correct
63 Correct 4 ms 2004 KB Output is correct
64 Correct 3 ms 1876 KB Output is correct

Subtask #4
61.0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 149 ms 58696 KB Output is correct
5 Correct 183 ms 58536 KB Output is correct
6 Correct 149 ms 58460 KB Output is correct
7 Correct 171 ms 58468 KB Output is correct
8 Correct 152 ms 58572 KB Output is correct
9 Correct 152 ms 58624 KB Output is correct
10 Correct 174 ms 58584 KB Output is correct
11 Correct 151 ms 58460 KB Output is correct
12 Correct 130 ms 55996 KB Output is correct
13 Correct 129 ms 55904 KB Output is correct
14 Correct 135 ms 55976 KB Output is correct
15 Correct 136 ms 55876 KB Output is correct
16 Correct 99 ms 52704 KB Output is correct
17 Correct 99 ms 52632 KB Output is correct
18 Correct 106 ms 52568 KB Output is correct
19 Correct 95 ms 52580 KB Output is correct
20 Correct 90 ms 52576 KB Output is correct
21 Correct 118 ms 52532 KB Output is correct
22 Correct 109 ms 52592 KB Output is correct
23 Correct 102 ms 52592 KB Output is correct
24 Correct 98 ms 52544 KB Output is correct
25 Correct 105 ms 52580 KB Output is correct
26 Correct 109 ms 52580 KB Output is correct
27 Correct 105 ms 52584 KB Output is correct
28 Correct 91 ms 52608 KB Output is correct
29 Correct 93 ms 52696 KB Output is correct
30 Correct 93 ms 52536 KB Output is correct
31 Correct 117 ms 52592 KB Output is correct
32 Correct 106 ms 52600 KB Output is correct
33 Correct 113 ms 52568 KB Output is correct
34 Correct 128 ms 55752 KB Output is correct
35 Correct 132 ms 55664 KB Output is correct
36 Correct 129 ms 55680 KB Output is correct
37 Correct 150 ms 55512 KB Output is correct
38 Correct 141 ms 55380 KB Output is correct
39 Correct 124 ms 55448 KB Output is correct
40 Correct 126 ms 55392 KB Output is correct
41 Correct 131 ms 55440 KB Output is correct
42 Correct 108 ms 53320 KB Output is correct
43 Correct 142 ms 55332 KB Output is correct
44 Correct 142 ms 55272 KB Output is correct
45 Correct 134 ms 55084 KB Output is correct
46 Correct 143 ms 54840 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 0 ms 212 KB Output is correct
53 Correct 0 ms 212 KB Output is correct
54 Correct 1 ms 324 KB Output is correct
55 Correct 0 ms 340 KB Output is correct
56 Correct 1 ms 212 KB Output is correct
57 Correct 1 ms 212 KB Output is correct
58 Correct 1 ms 340 KB Output is correct
59 Correct 0 ms 324 KB Output is correct
60 Correct 1 ms 212 KB Output is correct
61 Correct 1 ms 212 KB Output is correct
62 Correct 1 ms 340 KB Output is correct
63 Correct 1 ms 324 KB Output is correct
64 Correct 1 ms 212 KB Output is correct
65 Correct 0 ms 212 KB Output is correct
66 Correct 0 ms 212 KB Output is correct
67 Correct 0 ms 212 KB Output is correct
68 Correct 1 ms 340 KB Output is correct
69 Correct 1 ms 212 KB Output is correct
70 Correct 1 ms 340 KB Output is correct
71 Correct 1 ms 212 KB Output is correct
72 Correct 0 ms 316 KB Output is correct
73 Correct 1 ms 212 KB Output is correct
74 Correct 4 ms 1876 KB Output is correct
75 Correct 4 ms 1876 KB Output is correct
76 Correct 4 ms 1872 KB Output is correct
77 Correct 4 ms 1876 KB Output is correct
78 Correct 4 ms 1876 KB Output is correct
79 Correct 4 ms 1876 KB Output is correct
80 Correct 4 ms 1940 KB Output is correct
81 Correct 6 ms 2132 KB Output is correct
82 Correct 5 ms 2132 KB Output is correct
83 Correct 5 ms 2004 KB Output is correct
84 Correct 4 ms 1868 KB Output is correct
85 Correct 5 ms 2004 KB Output is correct
86 Correct 5 ms 2004 KB Output is correct
87 Correct 5 ms 2004 KB Output is correct
88 Correct 4 ms 1868 KB Output is correct
89 Correct 4 ms 1876 KB Output is correct
90 Correct 4 ms 1876 KB Output is correct
91 Correct 4 ms 1876 KB Output is correct
92 Correct 4 ms 1876 KB Output is correct
93 Correct 4 ms 1868 KB Output is correct
94 Correct 5 ms 2016 KB Output is correct
95 Correct 4 ms 1876 KB Output is correct
96 Correct 7 ms 1876 KB Output is correct
97 Correct 5 ms 2004 KB Output is correct
98 Correct 4 ms 1876 KB Output is correct
99 Correct 4 ms 1876 KB Output is correct
100 Correct 4 ms 1876 KB Output is correct
101 Correct 4 ms 2004 KB Output is correct
102 Correct 5 ms 2004 KB Output is correct
103 Correct 5 ms 2004 KB Output is correct
104 Correct 4 ms 2004 KB Output is correct
105 Correct 4 ms 2004 KB Output is correct
106 Correct 4 ms 2004 KB Output is correct
107 Correct 4 ms 2004 KB Output is correct
108 Correct 6 ms 2004 KB Output is correct
109 Correct 4 ms 2004 KB Output is correct
110 Correct 3 ms 1876 KB Output is correct
111 Correct 142 ms 54056 KB Output is correct
112 Correct 129 ms 54012 KB Output is correct
113 Correct 141 ms 53908 KB Output is correct
114 Correct 132 ms 53976 KB Output is correct
115 Correct 130 ms 54012 KB Output is correct
116 Correct 161 ms 54024 KB Output is correct
117 Correct 170 ms 54108 KB Output is correct
118 Correct 244 ms 59992 KB Output is correct
119 Correct 246 ms 59944 KB Output is correct
120 Correct 191 ms 57180 KB Output is correct
121 Correct 217 ms 53996 KB Output is correct
122 Correct 198 ms 57328 KB Output is correct
123 Correct 199 ms 57244 KB Output is correct
124 Correct 214 ms 57140 KB Output is correct
125 Correct 193 ms 54016 KB Output is correct
126 Correct 154 ms 54080 KB Output is correct
127 Correct 150 ms 54072 KB Output is correct
128 Correct 138 ms 54004 KB Output is correct
129 Correct 163 ms 54056 KB Output is correct
130 Correct 157 ms 54104 KB Output is correct
131 Correct 131 ms 54008 KB Output is correct
132 Correct 131 ms 54016 KB Output is correct
133 Correct 156 ms 54008 KB Output is correct
134 Correct 145 ms 53956 KB Output is correct
135 Correct 132 ms 53928 KB Output is correct
136 Correct 128 ms 54008 KB Output is correct
137 Correct 155 ms 53956 KB Output is correct
138 Correct 131 ms 53964 KB Output is correct
139 Correct 138 ms 53980 KB Output is correct
140 Correct 137 ms 53972 KB Output is correct
141 Correct 154 ms 53904 KB Output is correct
142 Correct 155 ms 59472 KB Output is correct
143 Correct 156 ms 59604 KB Output is correct
144 Correct 171 ms 59504 KB Output is correct
145 Correct 153 ms 59400 KB Output is correct
146 Correct 152 ms 59364 KB Output is correct
147 Correct 152 ms 59472 KB Output is correct
148 Correct 145 ms 59436 KB Output is correct
149 Correct 154 ms 59360 KB Output is correct
150 Correct 155 ms 59388 KB Output is correct
151 Correct 147 ms 59328 KB Output is correct
152 Correct 93 ms 53144 KB Output is correct
153 Correct 153 ms 59480 KB Output is correct
154 Correct 177 ms 59456 KB Output is correct
155 Correct 151 ms 59472 KB Output is correct
156 Correct 151 ms 59404 KB Output is correct
157 Correct 171 ms 59388 KB Output is correct
158 Correct 158 ms 59344 KB Output is correct
159 Correct 152 ms 59420 KB Output is correct
160 Correct 106 ms 52932 KB Output is correct
161 Correct 188 ms 56868 KB Output is correct
162 Correct 177 ms 56816 KB Output is correct
163 Correct 195 ms 56840 KB Output is correct
164 Correct 205 ms 56756 KB Output is correct
165 Correct 202 ms 56796 KB Output is correct
166 Correct 103 ms 54824 KB Output is correct
167 Correct 136 ms 56688 KB Output is correct
168 Correct 128 ms 56600 KB Output is correct
169 Correct 132 ms 56388 KB Output is correct
170 Correct 135 ms 56304 KB Output is correct
171 Correct 120 ms 56252 KB Output is correct
172 Correct 129 ms 56848 KB Output is correct
173 Correct 226 ms 55796 KB Output is correct
174 Correct 187 ms 55920 KB Output is correct
175 Correct 210 ms 55952 KB Output is correct
176 Correct 180 ms 55280 KB Output is correct