oj.uz

Submission #441913

# Submission time Handle Problem Language Result Execution time Memory
441913 2021-07-06T14:35:09 Z cheetose Event Hopping 2 (JOI21_event2) C++17
100 / 100
 1399 ms 24044 KB 
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a))
#define MEM_1(a) memset((a),-1,sizeof(a))
#define ALL(a) a.begin(),a.end()
#define COMPRESS(a) sort(ALL(a));a.resize(unique(ALL(a))-a.begin())
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<ld> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const int MOD = 1000000007;
ll POW(ll a, ll b, ll MMM = MOD) { ll ret = 1; for (; b; b >>= 1, a = (a*a) % MMM)if (b & 1)ret = (ret*a) % MMM; return ret; }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };
int ddx[] = { -1,-2,1,-2,2,-1,2,1 }, ddy[] = { -2,-1,-2,1,-1,2,1,2 };

Pll p[100000];
int d[200005][18];
int C(int l,int r){
	int res=0;
	fdn(i,17,0,1){
		if(d[l][i]<=r){
			res|=1<<i;
			l=d[l][i]+1;
		}
	}
	return res;
}
int tree[524288],lazy[524288];
void propagation(int node,int S,int E){
	if(lazy[node]!=0){
		tree[node]+=lazy[node]*(E-S+1);
		if(S!=E){
			lazy[2*node]+=lazy[node];
			lazy[2*node+1]+=lazy[node];
		}
		lazy[node]=0;
	}
}
void upd(int node,int S,int E,int i,int j,int val){
	propagation(node,S,E);
	if(i>E || j<S) return;
	if(j>=E && i<=S){
		lazy[node]+=val;
		propagation(node,S,E);
		return;
	}
	upd(2*node,S,(S+E)/2,i,j,val);
	upd(2*node+1,(S+E)/2+1,E,i,j,val);
	tree[node]=tree[2*node]+tree[2*node+1];
}
int find(int node,int S,int E,int i,int j){
	propagation(node,S,E);
	if(i>E || j<S)return 0;
	if(j>=E && i<=S)return tree[node];
	return find(node*2,S,(S+E)/2,i,j)+find(2*node+1,(S+E)/2+1,E,i,j);
}
int N;
int L(int x){
	int l=0,r=x;
	while(l<=r){
		int m=l+r>>1;
		if(find(1,0,N-1,m,x))l=m+1;
		else r=m-1;
	}
	return l;
}
int R(int x){
	int l=x,r=N-1;
	while(l<=r){
		int m=l+r>>1;
		if(find(1,0,N-1,x,m))r=m-1;
		else l=m+1;
	}
	return r;
}
int main(){
	int n,k;
	scanf("%d%d",&n,&k);
	Vll vv;
	fup(i,0,n-1,1){
		ll x,y;
		scanf("%lld%lld",&x,&y);
		x=3*x+1,y=3*y-1;
		p[i]=mp(x,y);
		vv.pb(x);vv.pb(y);
	}
	COMPRESS(vv);
	N=vv.size();
	fup(i,0,N+1,1)fup(j,0,17,1)d[i][j]=N;
	VPi v;
	fup(i,0,n-1,1){
		p[i].X=lower_bound(ALL(vv),p[i].X)-vv.begin();
		p[i].Y=lower_bound(ALL(vv),p[i].Y)-vv.begin();
		d[p[i].X][0]=min(d[p[i].X][0],(int)p[i].Y);
	}
	int now=N;
	fdn(i,N-1,0,1){
		now=min(now,d[i][0]);
		d[i][0]=now;
	}
	fup(j,0,16,1){
		fup(i,0,N-1,1){
			d[i][j+1]=d[d[i][j]+1][j];
		}
	}
	int tot=0;
	now=0;
	fdn(i,17,0,1){
		if(d[now][i]<N){
			tot|=1<<i;
			now=d[now][i]+1;
		}
	}
	if(tot<k)return !printf("-1\n");
	int ans=0;
	fup(i,0,n-1,1){
		if(ans==k)break;
		int x=p[i].X,y=p[i].Y;
		if(find(1,0,N-1,x,y))continue;
		int l=L(x-1),r=R(y+1);
		int c1=C(l,r),c2=C(l,x-1)+1+C(y+1,r);
		if(tot-c1+c2<k)continue;
		tot-=c1-c2;
		printf("%d\n",i+1);
		upd(1,0,N-1,x,y,1);
		ans++;
	}
}

Compilation message

event2.cpp: In function 'int C(int, int)':
event2.cpp:11:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   11 | #define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
      |                              ^
event2.cpp:47:2: note: in expansion of macro 'fdn'
   47 |  fdn(i,17,0,1){
      |  ^~~
event2.cpp: In function 'int L(int)':
event2.cpp:88:10: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   88 |   int m=l+r>>1;
      |         ~^~
event2.cpp: In function 'int R(int)':
event2.cpp:97:10: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   97 |   int m=l+r>>1;
      |         ~^~
event2.cpp: In function 'int main()':
event2.cpp:10:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
event2.cpp:107:2: note: in expansion of macro 'fup'
  107 |  fup(i,0,n-1,1){
      |  ^~~
event2.cpp:10:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
event2.cpp:116:2: note: in expansion of macro 'fup'
  116 |  fup(i,0,N+1,1)fup(j,0,17,1)d[i][j]=N;
      |  ^~~
event2.cpp:10:30: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
event2.cpp:116:16: note: in expansion of macro 'fup'
  116 |  fup(i,0,N+1,1)fup(j,0,17,1)d[i][j]=N;
      |                ^~~
event2.cpp:10:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
event2.cpp:118:2: note: in expansion of macro 'fup'
  118 |  fup(i,0,n-1,1){
      |  ^~~
event2.cpp:11:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   11 | #define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
      |                              ^
event2.cpp:124:2: note: in expansion of macro 'fdn'
  124 |  fdn(i,N-1,0,1){
      |  ^~~
event2.cpp:10:30: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
event2.cpp:128:2: note: in expansion of macro 'fup'
  128 |  fup(j,0,16,1){
      |  ^~~
event2.cpp:10:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
event2.cpp:129:3: note: in expansion of macro 'fup'
  129 |   fup(i,0,N-1,1){
      |   ^~~
event2.cpp:11:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   11 | #define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
      |                              ^
event2.cpp:135:2: note: in expansion of macro 'fdn'
  135 |  fdn(i,17,0,1){
      |  ^~~
event2.cpp:10:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
event2.cpp:143:2: note: in expansion of macro 'fup'
  143 |  fup(i,0,n-1,1){
      |  ^~~
event2.cpp:105:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  105 |  scanf("%d%d",&n,&k);
      |  ~~~~~^~~~~~~~~~~~~~
event2.cpp:109:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  109 |   scanf("%lld%lld",&x,&y);
      |   ~~~~~^~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1283 ms 22112 KB Output is correct
5 Correct 1241 ms 21788 KB Output is correct
6 Correct 1167 ms 21604 KB Output is correct
7 Correct 1052 ms 21144 KB Output is correct
8 Correct 1269 ms 22184 KB Output is correct
9 Correct 1228 ms 21964 KB Output is correct
10 Correct 1181 ms 21676 KB Output is correct
11 Correct 1061 ms 21376 KB Output is correct
12 Correct 870 ms 21952 KB Output is correct
13 Correct 862 ms 21688 KB Output is correct
14 Correct 829 ms 21476 KB Output is correct
15 Correct 711 ms 21236 KB Output is correct
16 Correct 322 ms 21732 KB Output is correct
17 Correct 279 ms 21612 KB Output is correct
18 Correct 261 ms 21212 KB Output is correct
19 Correct 180 ms 21620 KB Output is correct
20 Correct 170 ms 21684 KB Output is correct
21 Correct 152 ms 23768 KB Output is correct
22 Correct 152 ms 23600 KB Output is correct
23 Correct 147 ms 23624 KB Output is correct
24 Correct 141 ms 23664 KB Output is correct
25 Correct 146 ms 23512 KB Output is correct
26 Correct 145 ms 23536 KB Output is correct
27 Correct 145 ms 23464 KB Output is correct
28 Correct 91 ms 19480 KB Output is correct
29 Correct 99 ms 19500 KB Output is correct
30 Correct 92 ms 19512 KB Output is correct
31 Correct 93 ms 19564 KB Output is correct
32 Correct 99 ms 19572 KB Output is correct
33 Correct 102 ms 19504 KB Output is correct
34 Correct 575 ms 22380 KB Output is correct
35 Correct 404 ms 21420 KB Output is correct
36 Correct 251 ms 20400 KB Output is correct
37 Correct 744 ms 23724 KB Output is correct
38 Correct 722 ms 23580 KB Output is correct
39 Correct 693 ms 23344 KB Output is correct
40 Correct 669 ms 23260 KB Output is correct
41 Correct 642 ms 23140 KB Output is correct
42 Correct 101 ms 19524 KB Output is correct
43 Correct 734 ms 23708 KB Output is correct
44 Correct 719 ms 23832 KB Output is correct
45 Correct 689 ms 23856 KB Output is correct
46 Correct 671 ms 23768 KB Output is correct

Subtask #2
1.0 / 1.0

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

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 0 ms 332 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 5 ms 972 KB Output is correct
29 Correct 7 ms 972 KB Output is correct
30 Correct 5 ms 972 KB Output is correct
31 Correct 4 ms 972 KB Output is correct
32 Correct 4 ms 1040 KB Output is correct
33 Correct 3 ms 844 KB Output is correct
34 Correct 3 ms 972 KB Output is correct
35 Correct 22 ms 1096 KB Output is correct
36 Correct 20 ms 1096 KB Output is correct
37 Correct 16 ms 1104 KB Output is correct
38 Correct 3 ms 916 KB Output is correct
39 Correct 19 ms 1088 KB Output is correct
40 Correct 17 ms 1092 KB Output is correct
41 Correct 15 ms 1100 KB Output is correct
42 Correct 4 ms 844 KB Output is correct
43 Correct 11 ms 1096 KB Output is correct
44 Correct 9 ms 1096 KB Output is correct
45 Correct 9 ms 972 KB Output is correct
46 Correct 3 ms 844 KB Output is correct
47 Correct 7 ms 972 KB Output is correct
48 Correct 6 ms 972 KB Output is correct
49 Correct 5 ms 972 KB Output is correct
50 Correct 3 ms 844 KB Output is correct
51 Correct 8 ms 972 KB Output is correct
52 Correct 6 ms 972 KB Output is correct
53 Correct 4 ms 1084 KB Output is correct
54 Correct 3 ms 844 KB Output is correct
55 Correct 21 ms 1088 KB Output is correct
56 Correct 21 ms 1044 KB Output is correct
57 Correct 21 ms 1100 KB Output is correct
58 Correct 21 ms 1108 KB Output is correct
59 Correct 21 ms 1100 KB Output is correct
60 Correct 20 ms 1052 KB Output is correct
61 Correct 20 ms 972 KB Output is correct
62 Correct 20 ms 972 KB Output is correct
63 Correct 18 ms 1064 KB Output is correct
64 Correct 2 ms 844 KB Output is correct

Subtask #4
61.0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1283 ms 22112 KB Output is correct
5 Correct 1241 ms 21788 KB Output is correct
6 Correct 1167 ms 21604 KB Output is correct
7 Correct 1052 ms 21144 KB Output is correct
8 Correct 1269 ms 22184 KB Output is correct
9 Correct 1228 ms 21964 KB Output is correct
10 Correct 1181 ms 21676 KB Output is correct
11 Correct 1061 ms 21376 KB Output is correct
12 Correct 870 ms 21952 KB Output is correct
13 Correct 862 ms 21688 KB Output is correct
14 Correct 829 ms 21476 KB Output is correct
15 Correct 711 ms 21236 KB Output is correct
16 Correct 322 ms 21732 KB Output is correct
17 Correct 279 ms 21612 KB Output is correct
18 Correct 261 ms 21212 KB Output is correct
19 Correct 180 ms 21620 KB Output is correct
20 Correct 170 ms 21684 KB Output is correct
21 Correct 152 ms 23768 KB Output is correct
22 Correct 152 ms 23600 KB Output is correct
23 Correct 147 ms 23624 KB Output is correct
24 Correct 141 ms 23664 KB Output is correct
25 Correct 146 ms 23512 KB Output is correct
26 Correct 145 ms 23536 KB Output is correct
27 Correct 145 ms 23464 KB Output is correct
28 Correct 91 ms 19480 KB Output is correct
29 Correct 99 ms 19500 KB Output is correct
30 Correct 92 ms 19512 KB Output is correct
31 Correct 93 ms 19564 KB Output is correct
32 Correct 99 ms 19572 KB Output is correct
33 Correct 102 ms 19504 KB Output is correct
34 Correct 575 ms 22380 KB Output is correct
35 Correct 404 ms 21420 KB Output is correct
36 Correct 251 ms 20400 KB Output is correct
37 Correct 744 ms 23724 KB Output is correct
38 Correct 722 ms 23580 KB Output is correct
39 Correct 693 ms 23344 KB Output is correct
40 Correct 669 ms 23260 KB Output is correct
41 Correct 642 ms 23140 KB Output is correct
42 Correct 101 ms 19524 KB Output is correct
43 Correct 734 ms 23708 KB Output is correct
44 Correct 719 ms 23832 KB Output is correct
45 Correct 689 ms 23856 KB Output is correct
46 Correct 671 ms 23768 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 0 ms 204 KB Output is correct
49 Correct 0 ms 204 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Correct 0 ms 204 KB Output is correct
52 Correct 0 ms 332 KB Output is correct
53 Correct 1 ms 332 KB Output is correct
54 Correct 0 ms 332 KB Output is correct
55 Correct 0 ms 332 KB Output is correct
56 Correct 1 ms 332 KB Output is correct
57 Correct 0 ms 204 KB Output is correct
58 Correct 1 ms 332 KB Output is correct
59 Correct 1 ms 332 KB Output is correct
60 Correct 0 ms 332 KB Output is correct
61 Correct 0 ms 204 KB Output is correct
62 Correct 0 ms 332 KB Output is correct
63 Correct 0 ms 204 KB Output is correct
64 Correct 0 ms 204 KB Output is correct
65 Correct 0 ms 204 KB Output is correct
66 Correct 1 ms 204 KB Output is correct
67 Correct 0 ms 204 KB Output is correct
68 Correct 0 ms 332 KB Output is correct
69 Correct 0 ms 332 KB Output is correct
70 Correct 0 ms 204 KB Output is correct
71 Correct 0 ms 204 KB Output is correct
72 Correct 1 ms 332 KB Output is correct
73 Correct 1 ms 332 KB Output is correct
74 Correct 5 ms 972 KB Output is correct
75 Correct 7 ms 972 KB Output is correct
76 Correct 5 ms 972 KB Output is correct
77 Correct 4 ms 972 KB Output is correct
78 Correct 4 ms 1040 KB Output is correct
79 Correct 3 ms 844 KB Output is correct
80 Correct 3 ms 972 KB Output is correct
81 Correct 22 ms 1096 KB Output is correct
82 Correct 20 ms 1096 KB Output is correct
83 Correct 16 ms 1104 KB Output is correct
84 Correct 3 ms 916 KB Output is correct
85 Correct 19 ms 1088 KB Output is correct
86 Correct 17 ms 1092 KB Output is correct
87 Correct 15 ms 1100 KB Output is correct
88 Correct 4 ms 844 KB Output is correct
89 Correct 11 ms 1096 KB Output is correct
90 Correct 9 ms 1096 KB Output is correct
91 Correct 9 ms 972 KB Output is correct
92 Correct 3 ms 844 KB Output is correct
93 Correct 7 ms 972 KB Output is correct
94 Correct 6 ms 972 KB Output is correct
95 Correct 5 ms 972 KB Output is correct
96 Correct 3 ms 844 KB Output is correct
97 Correct 8 ms 972 KB Output is correct
98 Correct 6 ms 972 KB Output is correct
99 Correct 4 ms 1084 KB Output is correct
100 Correct 3 ms 844 KB Output is correct
101 Correct 21 ms 1088 KB Output is correct
102 Correct 21 ms 1044 KB Output is correct
103 Correct 21 ms 1100 KB Output is correct
104 Correct 21 ms 1108 KB Output is correct
105 Correct 21 ms 1100 KB Output is correct
106 Correct 20 ms 1052 KB Output is correct
107 Correct 20 ms 972 KB Output is correct
108 Correct 20 ms 972 KB Output is correct
109 Correct 18 ms 1064 KB Output is correct
110 Correct 2 ms 844 KB Output is correct
111 Correct 214 ms 23600 KB Output is correct
112 Correct 192 ms 23540 KB Output is correct
113 Correct 200 ms 23600 KB Output is correct
114 Correct 185 ms 23592 KB Output is correct
115 Correct 178 ms 23600 KB Output is correct
116 Correct 117 ms 19564 KB Output is correct
117 Correct 119 ms 19504 KB Output is correct
118 Correct 1399 ms 23928 KB Output is correct
119 Correct 1249 ms 23980 KB Output is correct
120 Correct 770 ms 23732 KB Output is correct
121 Correct 125 ms 19504 KB Output is correct
122 Correct 971 ms 23868 KB Output is correct
123 Correct 860 ms 23924 KB Output is correct
124 Correct 750 ms 23728 KB Output is correct
125 Correct 127 ms 19504 KB Output is correct
126 Correct 492 ms 23764 KB Output is correct
127 Correct 397 ms 23600 KB Output is correct
128 Correct 321 ms 23728 KB Output is correct
129 Correct 124 ms 19604 KB Output is correct
130 Correct 386 ms 23636 KB Output is correct
131 Correct 302 ms 23600 KB Output is correct
132 Correct 234 ms 23720 KB Output is correct
133 Correct 126 ms 19496 KB Output is correct
134 Correct 387 ms 23664 KB Output is correct
135 Correct 272 ms 23644 KB Output is correct
136 Correct 198 ms 23644 KB Output is correct
137 Correct 119 ms 19632 KB Output is correct
138 Correct 255 ms 23536 KB Output is correct
139 Correct 229 ms 23424 KB Output is correct
140 Correct 141 ms 23412 KB Output is correct
141 Correct 120 ms 19500 KB Output is correct
142 Correct 1382 ms 23664 KB Output is correct
143 Correct 1364 ms 23828 KB Output is correct
144 Correct 1363 ms 23724 KB Output is correct
145 Correct 1392 ms 23972 KB Output is correct
146 Correct 1335 ms 24004 KB Output is correct
147 Correct 1312 ms 24012 KB Output is correct
148 Correct 1284 ms 23740 KB Output is correct
149 Correct 1279 ms 23728 KB Output is correct
150 Correct 1247 ms 23680 KB Output is correct
151 Correct 1111 ms 23304 KB Output is correct
152 Correct 89 ms 19548 KB Output is correct
153 Correct 1346 ms 23888 KB Output is correct
154 Correct 1322 ms 23836 KB Output is correct
155 Correct 1324 ms 23780 KB Output is correct
156 Correct 1296 ms 23660 KB Output is correct
157 Correct 1269 ms 23672 KB Output is correct
158 Correct 1249 ms 23616 KB Output is correct
159 Correct 1124 ms 23140 KB Output is correct
160 Correct 87 ms 19524 KB Output is correct
161 Correct 818 ms 23788 KB Output is correct
162 Correct 799 ms 23692 KB Output is correct
163 Correct 769 ms 23616 KB Output is correct
164 Correct 732 ms 23672 KB Output is correct
165 Correct 722 ms 23708 KB Output is correct
166 Correct 94 ms 19468 KB Output is correct
167 Correct 741 ms 24044 KB Output is correct
168 Correct 720 ms 23684 KB Output is correct
169 Correct 686 ms 23680 KB Output is correct
170 Correct 679 ms 23668 KB Output is correct
171 Correct 744 ms 22988 KB Output is correct
172 Correct 732 ms 23660 KB Output is correct
173 Correct 1075 ms 23644 KB Output is correct
174 Correct 1046 ms 23932 KB Output is correct
175 Correct 1029 ms 23672 KB Output is correct
176 Correct 690 ms 23572 KB Output is correct