Submission #546945

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
546945	2022-04-09T04:08:46 Z	NhatMinh0208	Fuel Station (NOI20_fuelstation)	C++14	100 / 100	357 ms	38172 KB

FuelStation

#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
	Normie's Template v2.5
	Changes:
    Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// #define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;

//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))

// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
// template<typename T>
// __attribute__((always_inline)) void chkmin(T& a, const T& b) {
//     a=(a<b)?a:b;
// }

// template<typename T>
// __attribute__((always_inline)) void chkmax(T& a, const T& b) {
//     a=(a>b)?a:b;
// }
 
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;

// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
	if (!x) return 1;
	ll res=BOW(a,x/2,p);
	res*=res;
	res%=p;
	if (x%2) res*=a;
	return res%p;
}
ll INV(ll a, ll p)
{
	return BOW(a,p-2,p);
}
//---------END-------//
#endif
ll star[300011];
struct seg {
	ll val[1050000];
	ll lz[1050000];
	void reset(int c, int l, int r) {
		lz[c]=0;
		if (l==r) {
			val[c]=star[l];
		}
		else {
			int mid=(l+r)/2;
			reset((c<<1),l,mid);
			reset((c<<1)+1,mid+1,r);
			val[c]=min(val[(c<<1)],val[(c<<1)+1]);
		}
	}
	void fl(int c) {
		val[(c<<1)]+=lz[c];
		val[(c<<1)+1]+=lz[c];
		lz[(c<<1)]+=lz[c];
		lz[(c<<1)+1]+=lz[c];
		lz[c]=0;
	}
	void upd(int c, int l, int r, int tl, int tr, ll x) {
		if (l>tr || r<tl) return;
		if (l>=tl && r<=tr) {
			val[c]+=x;
			lz[c]+=x;
		}
		else {
			fl(c);
			int mid=(l+r)/2;
			upd((c<<1),l,mid,tl,tr,x);
			upd((c<<1)+1,mid+1,r,tl,tr,x);
			val[c]=min(val[(c<<1)],val[(c<<1)+1]);
		}
	}
	ll get(int c, int l, int r, int tl, int tr) {
		if (l>tr || r<tl) return 0;
		if (l>=tl && r<=tr) {
			return val[c];
		}
		else {
			fl(c);
			int mid=(l+r)/2;
			ll a = get((c<<1),l,mid,tl,tr);
			ll b = get((c<<1)+1,mid+1,r,tl,tr);
			return min(a,b);
		}
	}
};
seg st;

vector<int> vec;
vector<piii(ll)> stats;
ll n,m,i,j,k,t,t1,u,v,a,b;
int main()
{
	fio;
	cin>>n>>m;
	for (i=1;i<=n;i++) {
		cin>>u>>a>>b;
		stats.push_back({u,{a,b}});
	}
	stats.push_back({m,{0,1e10}});
	sort(stats.begin(), stats.end());
	for (i=0;i<=n;i++) vec.push_back(i);
	sort(vec.begin(), vec.end(), [](int a, int b){
		return (stats[a].p3<stats[b].p3);
	});
	// for (auto g : vec) cout<<g<<' '; cout<<endl;
	// for (auto g : stats) {
	// 	cout<<g.fi<<' '<<g.p2<<' '<<g.p3<<endl;
	// }
	u=0;
	for (i=0;i<=n;i++) {
		star[i]=u-stats[i].p1;
		// cout<<star[i]<<' ';
		u+=stats[i].p2;
	}
	// cout<<endl;
	st.reset(1,0,n);
	for (i=0;i<=n;i++) {
		a=-st.val[1];
		if (i) a=max(a,stats[vec[i-1]].p3+1);
		if (a<=stats[vec[i]].p3) {
			// cout<<i<<' '<<vec[i]<<' '<<a<<endl;
			return cout<<a,0;
		}
		st.upd(1,0,n,vec[i]+1,n,-stats[vec[i]].p2);
	}
}
// a;

Subtask #1

7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	332 KB	Output is correct
4	Correct	1 ms	356 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	512 KB	Output is correct
11	Correct	1 ms	336 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	0 ms	340 KB	Output is correct

Subtask #2

13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	139 ms	29264 KB	Output is correct
2	Correct	151 ms	29268 KB	Output is correct
3	Correct	151 ms	29324 KB	Output is correct
4	Correct	149 ms	29296 KB	Output is correct
5	Correct	142 ms	29292 KB	Output is correct
6	Correct	160 ms	29288 KB	Output is correct
7	Correct	150 ms	29276 KB	Output is correct
8	Correct	140 ms	29324 KB	Output is correct
9	Correct	157 ms	29340 KB	Output is correct
10	Correct	152 ms	29348 KB	Output is correct
11	Correct	137 ms	29364 KB	Output is correct
12	Correct	153 ms	29300 KB	Output is correct
13	Correct	148 ms	29340 KB	Output is correct
14	Correct	153 ms	29288 KB	Output is correct
15	Correct	145 ms	29296 KB	Output is correct
16	Correct	153 ms	29300 KB	Output is correct
17	Correct	150 ms	29364 KB	Output is correct
18	Correct	147 ms	29400 KB	Output is correct
19	Correct	182 ms	29344 KB	Output is correct
20	Correct	149 ms	29364 KB	Output is correct

Subtask #3

17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	5 ms	1360 KB	Output is correct
3	Correct	5 ms	1360 KB	Output is correct
4	Correct	5 ms	1368 KB	Output is correct
5	Correct	5 ms	1376 KB	Output is correct
6	Correct	4 ms	1360 KB	Output is correct
7	Correct	5 ms	1360 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	336 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	1 ms	336 KB	Output is correct
14	Correct	8 ms	1360 KB	Output is correct
15	Correct	6 ms	1368 KB	Output is correct
16	Correct	6 ms	1368 KB	Output is correct
17	Correct	6 ms	1360 KB	Output is correct
18	Correct	7 ms	1372 KB	Output is correct
19	Correct	5 ms	1360 KB	Output is correct
20	Correct	8 ms	1428 KB	Output is correct
21	Correct	5 ms	1488 KB	Output is correct
22	Correct	5 ms	1364 KB	Output is correct
23	Correct	5 ms	1360 KB	Output is correct
24	Correct	5 ms	1380 KB	Output is correct
25	Correct	6 ms	1360 KB	Output is correct

Subtask #4

12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	5 ms	1360 KB	Output is correct
3	Correct	5 ms	1360 KB	Output is correct
4	Correct	5 ms	1368 KB	Output is correct
5	Correct	5 ms	1376 KB	Output is correct
6	Correct	4 ms	1360 KB	Output is correct
7	Correct	5 ms	1360 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	336 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	1 ms	336 KB	Output is correct
14	Correct	8 ms	1360 KB	Output is correct
15	Correct	6 ms	1368 KB	Output is correct
16	Correct	6 ms	1368 KB	Output is correct
17	Correct	6 ms	1360 KB	Output is correct
18	Correct	7 ms	1372 KB	Output is correct
19	Correct	5 ms	1360 KB	Output is correct
20	Correct	8 ms	1428 KB	Output is correct
21	Correct	5 ms	1488 KB	Output is correct
22	Correct	5 ms	1364 KB	Output is correct
23	Correct	5 ms	1360 KB	Output is correct
24	Correct	5 ms	1380 KB	Output is correct
25	Correct	6 ms	1360 KB	Output is correct
26	Correct	0 ms	340 KB	Output is correct
27	Correct	148 ms	33544 KB	Output is correct
28	Correct	171 ms	33352 KB	Output is correct
29	Correct	138 ms	33088 KB	Output is correct
30	Correct	143 ms	33092 KB	Output is correct
31	Correct	180 ms	33692 KB	Output is correct
32	Correct	150 ms	33404 KB	Output is correct
33	Correct	1 ms	340 KB	Output is correct
34	Correct	1 ms	340 KB	Output is correct
35	Correct	1 ms	340 KB	Output is correct
36	Correct	0 ms	340 KB	Output is correct
37	Correct	1 ms	340 KB	Output is correct
38	Correct	1 ms	340 KB	Output is correct
39	Correct	279 ms	33636 KB	Output is correct
40	Correct	276 ms	33692 KB	Output is correct
41	Correct	274 ms	33708 KB	Output is correct
42	Correct	284 ms	33604 KB	Output is correct
43	Correct	266 ms	33668 KB	Output is correct
44	Correct	201 ms	33180 KB	Output is correct
45	Correct	172 ms	32816 KB	Output is correct
46	Correct	148 ms	33668 KB	Output is correct
47	Correct	147 ms	35104 KB	Output is correct
48	Correct	140 ms	35172 KB	Output is correct
49	Correct	146 ms	32968 KB	Output is correct
50	Correct	172 ms	33380 KB	Output is correct
51	Correct	139 ms	33428 KB	Output is correct
52	Correct	143 ms	33080 KB	Output is correct

Subtask #5

19.0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	332 KB	Output is correct
4	Correct	1 ms	356 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	512 KB	Output is correct
11	Correct	1 ms	336 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	0 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	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	0 ms	332 KB	Output is correct
24	Correct	0 ms	340 KB	Output is correct
25	Correct	0 ms	328 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	1 ms	336 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	1 ms	332 KB	Output is correct
30	Correct	0 ms	340 KB	Output is correct

Subtask #6

11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	332 KB	Output is correct
4	Correct	1 ms	356 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	512 KB	Output is correct
11	Correct	1 ms	336 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	0 ms	340 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	5 ms	1360 KB	Output is correct
18	Correct	5 ms	1360 KB	Output is correct
19	Correct	5 ms	1368 KB	Output is correct
20	Correct	5 ms	1376 KB	Output is correct
21	Correct	4 ms	1360 KB	Output is correct
22	Correct	5 ms	1360 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	336 KB	Output is correct
27	Correct	1 ms	332 KB	Output is correct
28	Correct	1 ms	336 KB	Output is correct
29	Correct	8 ms	1360 KB	Output is correct
30	Correct	6 ms	1368 KB	Output is correct
31	Correct	6 ms	1368 KB	Output is correct
32	Correct	6 ms	1360 KB	Output is correct
33	Correct	7 ms	1372 KB	Output is correct
34	Correct	5 ms	1360 KB	Output is correct
35	Correct	8 ms	1428 KB	Output is correct
36	Correct	5 ms	1488 KB	Output is correct
37	Correct	5 ms	1364 KB	Output is correct
38	Correct	5 ms	1360 KB	Output is correct
39	Correct	5 ms	1380 KB	Output is correct
40	Correct	6 ms	1360 KB	Output is correct
41	Correct	1 ms	340 KB	Output is correct
42	Correct	5 ms	1488 KB	Output is correct
43	Correct	8 ms	1468 KB	Output is correct
44	Correct	7 ms	1496 KB	Output is correct
45	Correct	7 ms	1492 KB	Output is correct
46	Correct	5 ms	1496 KB	Output is correct
47	Correct	5 ms	1616 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	328 KB	Output is correct
52	Correct	0 ms	332 KB	Output is correct
53	Correct	0 ms	340 KB	Output is correct
54	Correct	7 ms	1576 KB	Output is correct
55	Correct	7 ms	1556 KB	Output is correct
56	Correct	8 ms	1616 KB	Output is correct
57	Correct	9 ms	1616 KB	Output is correct
58	Correct	9 ms	1488 KB	Output is correct
59	Correct	7 ms	1488 KB	Output is correct
60	Correct	6 ms	1616 KB	Output is correct
61	Correct	5 ms	1492 KB	Output is correct
62	Correct	5 ms	1488 KB	Output is correct
63	Correct	6 ms	1492 KB	Output is correct
64	Correct	5 ms	1488 KB	Output is correct
65	Correct	5 ms	1500 KB	Output is correct

Subtask #7

21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	332 KB	Output is correct
4	Correct	1 ms	356 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	512 KB	Output is correct
11	Correct	1 ms	336 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	0 ms	340 KB	Output is correct
16	Correct	139 ms	29264 KB	Output is correct
17	Correct	151 ms	29268 KB	Output is correct
18	Correct	151 ms	29324 KB	Output is correct
19	Correct	149 ms	29296 KB	Output is correct
20	Correct	142 ms	29292 KB	Output is correct
21	Correct	160 ms	29288 KB	Output is correct
22	Correct	150 ms	29276 KB	Output is correct
23	Correct	140 ms	29324 KB	Output is correct
24	Correct	157 ms	29340 KB	Output is correct
25	Correct	152 ms	29348 KB	Output is correct
26	Correct	137 ms	29364 KB	Output is correct
27	Correct	153 ms	29300 KB	Output is correct
28	Correct	148 ms	29340 KB	Output is correct
29	Correct	153 ms	29288 KB	Output is correct
30	Correct	145 ms	29296 KB	Output is correct
31	Correct	153 ms	29300 KB	Output is correct
32	Correct	150 ms	29364 KB	Output is correct
33	Correct	147 ms	29400 KB	Output is correct
34	Correct	182 ms	29344 KB	Output is correct
35	Correct	149 ms	29364 KB	Output is correct
36	Correct	0 ms	340 KB	Output is correct
37	Correct	5 ms	1360 KB	Output is correct
38	Correct	5 ms	1360 KB	Output is correct
39	Correct	5 ms	1368 KB	Output is correct
40	Correct	5 ms	1376 KB	Output is correct
41	Correct	4 ms	1360 KB	Output is correct
42	Correct	5 ms	1360 KB	Output is correct
43	Correct	1 ms	340 KB	Output is correct
44	Correct	1 ms	340 KB	Output is correct
45	Correct	1 ms	340 KB	Output is correct
46	Correct	1 ms	336 KB	Output is correct
47	Correct	1 ms	332 KB	Output is correct
48	Correct	1 ms	336 KB	Output is correct
49	Correct	8 ms	1360 KB	Output is correct
50	Correct	6 ms	1368 KB	Output is correct
51	Correct	6 ms	1368 KB	Output is correct
52	Correct	6 ms	1360 KB	Output is correct
53	Correct	7 ms	1372 KB	Output is correct
54	Correct	5 ms	1360 KB	Output is correct
55	Correct	8 ms	1428 KB	Output is correct
56	Correct	5 ms	1488 KB	Output is correct
57	Correct	5 ms	1364 KB	Output is correct
58	Correct	5 ms	1360 KB	Output is correct
59	Correct	5 ms	1380 KB	Output is correct
60	Correct	6 ms	1360 KB	Output is correct
61	Correct	0 ms	340 KB	Output is correct
62	Correct	148 ms	33544 KB	Output is correct
63	Correct	171 ms	33352 KB	Output is correct
64	Correct	138 ms	33088 KB	Output is correct
65	Correct	143 ms	33092 KB	Output is correct
66	Correct	180 ms	33692 KB	Output is correct
67	Correct	150 ms	33404 KB	Output is correct
68	Correct	1 ms	340 KB	Output is correct
69	Correct	1 ms	340 KB	Output is correct
70	Correct	1 ms	340 KB	Output is correct
71	Correct	0 ms	340 KB	Output is correct
72	Correct	1 ms	340 KB	Output is correct
73	Correct	1 ms	340 KB	Output is correct
74	Correct	279 ms	33636 KB	Output is correct
75	Correct	276 ms	33692 KB	Output is correct
76	Correct	274 ms	33708 KB	Output is correct
77	Correct	284 ms	33604 KB	Output is correct
78	Correct	266 ms	33668 KB	Output is correct
79	Correct	201 ms	33180 KB	Output is correct
80	Correct	172 ms	32816 KB	Output is correct
81	Correct	148 ms	33668 KB	Output is correct
82	Correct	147 ms	35104 KB	Output is correct
83	Correct	140 ms	35172 KB	Output is correct
84	Correct	146 ms	32968 KB	Output is correct
85	Correct	172 ms	33380 KB	Output is correct
86	Correct	139 ms	33428 KB	Output is correct
87	Correct	143 ms	33080 KB	Output is correct
88	Correct	1 ms	340 KB	Output is correct
89	Correct	1 ms	340 KB	Output is correct
90	Correct	1 ms	340 KB	Output is correct
91	Correct	1 ms	340 KB	Output is correct
92	Correct	0 ms	340 KB	Output is correct
93	Correct	1 ms	340 KB	Output is correct
94	Correct	1 ms	340 KB	Output is correct
95	Correct	0 ms	332 KB	Output is correct
96	Correct	0 ms	340 KB	Output is correct
97	Correct	0 ms	328 KB	Output is correct
98	Correct	1 ms	340 KB	Output is correct
99	Correct	1 ms	336 KB	Output is correct
100	Correct	1 ms	340 KB	Output is correct
101	Correct	1 ms	332 KB	Output is correct
102	Correct	0 ms	340 KB	Output is correct
103	Correct	1 ms	340 KB	Output is correct
104	Correct	5 ms	1488 KB	Output is correct
105	Correct	8 ms	1468 KB	Output is correct
106	Correct	7 ms	1496 KB	Output is correct
107	Correct	7 ms	1492 KB	Output is correct
108	Correct	5 ms	1496 KB	Output is correct
109	Correct	5 ms	1616 KB	Output is correct
110	Correct	1 ms	340 KB	Output is correct
111	Correct	1 ms	340 KB	Output is correct
112	Correct	1 ms	340 KB	Output is correct
113	Correct	1 ms	328 KB	Output is correct
114	Correct	0 ms	332 KB	Output is correct
115	Correct	0 ms	340 KB	Output is correct
116	Correct	7 ms	1576 KB	Output is correct
117	Correct	7 ms	1556 KB	Output is correct
118	Correct	8 ms	1616 KB	Output is correct
119	Correct	9 ms	1616 KB	Output is correct
120	Correct	9 ms	1488 KB	Output is correct
121	Correct	7 ms	1488 KB	Output is correct
122	Correct	6 ms	1616 KB	Output is correct
123	Correct	5 ms	1492 KB	Output is correct
124	Correct	5 ms	1488 KB	Output is correct
125	Correct	6 ms	1492 KB	Output is correct
126	Correct	5 ms	1488 KB	Output is correct
127	Correct	5 ms	1500 KB	Output is correct
128	Correct	1 ms	340 KB	Output is correct
129	Correct	216 ms	36716 KB	Output is correct
130	Correct	179 ms	37448 KB	Output is correct
131	Correct	189 ms	38044 KB	Output is correct
132	Correct	178 ms	37400 KB	Output is correct
133	Correct	172 ms	37368 KB	Output is correct
134	Correct	181 ms	38044 KB	Output is correct
135	Correct	1 ms	340 KB	Output is correct
136	Correct	1 ms	340 KB	Output is correct
137	Correct	1 ms	340 KB	Output is correct
138	Correct	1 ms	336 KB	Output is correct
139	Correct	1 ms	340 KB	Output is correct
140	Correct	1 ms	340 KB	Output is correct
141	Correct	295 ms	38148 KB	Output is correct
142	Correct	357 ms	37720 KB	Output is correct
143	Correct	294 ms	38172 KB	Output is correct
144	Correct	324 ms	38044 KB	Output is correct
145	Correct	344 ms	38044 KB	Output is correct
146	Correct	246 ms	36344 KB	Output is correct
147	Correct	192 ms	37068 KB	Output is correct
148	Correct	240 ms	36584 KB	Output is correct
149	Correct	178 ms	37528 KB	Output is correct
150	Correct	176 ms	37596 KB	Output is correct
151	Correct	155 ms	37696 KB	Output is correct
152	Correct	208 ms	37372 KB	Output is correct
153	Correct	180 ms	37408 KB	Output is correct
154	Correct	177 ms	37336 KB	Output is correct
155	Correct	179 ms	37424 KB	Output is correct