oj.uz

Submission #258407

# Submission time Handle Problem Language Result Execution time Memory
258407 2020-08-05T22:40:08 Z amoo_safar New Home (APIO18_new_home) C++14
57 / 100
 5000 ms 126152 KB 
// Zende bad Shoma nasime faghat !
#include <bits/stdc++.h>
 
//#pragma GCC target ("avx2")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("unroll-loops")
 
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " : " << x << '\n'
 
using namespace std;
 
typedef pair<int, int> pii;
 
const int N = 3e5 + 10;
const int Inf = 1e9;
 
int n, q, k;
int x[N], t[N], a[N], b[N];
int y[N], c[N], ans[N];
 
vector<int> V;
 
//map<int, int> mp[N];
set<int> rec[N];
 
const int SGN = (1 << 19);
int seg[SGN << 1];
/*
void Ins(int id, int l, int r, int x, int L, int R){
	if(r <= L || R <= l) return ;
	if(l <= L && R <= r){
		seg[id].insert(x);
		return ;
	}
	int mid = (L + R) >> 1;
	Ins(id << 1, l, r, x, L, mid);
	Ins(id << 1 | 1, l, r, x, mid, R);
}
void Rem(int id, int l, int r, int x, int L, int R){
	if(r <= L || R <= l) return ;
	if(l <= L && R <= r){
		seg[id].erase(seg[id].find(x));
		return ;
	}
	int mid = (L + R) >> 1;
	Rem(id << 1, l, r, x, L, mid);
	Rem(id << 1 | 1, l, r, x, mid, R);
}
*/
int FastMin(int &a, int &b){
	return a < b ? a : b;
}
void Set(int idx, int v){
	idx += SGN;
	seg[idx] = v;
	while(idx >>= 1){
		seg[idx] = FastMin(seg[idx << 1], seg[idx << 1 | 1]);
	}
	/*if(R - L == 1){
		seg[id] = v;
		return ;
	}
	int mid = (L + R) >> 1;
	if(idx < mid) Set(id << 1, idx, v, L, mid);
	else Set(id << 1 | 1, idx, v, mid, R);
	seg[id] = min(seg[id << 1], seg[id << 1 | 1]);
	*/
}
 
 
int MN;
/*
int Get(int id, int l, int r, int L, int R){
	if(r <= L || R <= l) return Inf;
	if(l <= L && R <= r) return seg[id];
	
	int mid = (L + R) >> 1;
	return min(Get(id << 1, l, r, L, mid), Get(id << 1 | 1, l, r, mid, R));
	//if(idx < mid) Get(id << 1, idx, L, mid);
	//else Get(id << 1 | 1, idx, mid, R);
}
*/
 
int Get(int l){
	l += SGN;
	int r = SGN + SGN;
	int res = Inf;
	while(l ^ r){
		if(l & 1)
			res = min(res, seg[l ++]);
		l >>= 1; r >>= 1;
	}
	return res;
}
template<typename T>
T Prev(T A){return --A; };
template<typename T>
T Next(T A){return ++A; };
 
pii GetRange(pii R){
	return pii(R.F, upper_bound(all(V), R.S) - V.begin());
}
set<int>::iterator hint;
pii GetRange(int tp, int pl){
	set<int>::iterator it = hint;
	int resL = pl, resR;
	/*
	if(it == rec[tp].begin()) resL = 1;
	else resL = ( (*Prev(it)) + (*it)) / 2 + 1;
 	*/
	if(Next(it) == rec[tp].end()) resR = 1e8;
	else resR = ( (*Next(it)) + (*it)) / 2;
	return pii(resL, resR);
}
 
void SegGet(int qn){
	//cerr << "? " << pl << '\n';
	int pl = y[qn];
	//MN = Get(1, (lower_bound(all(V), pl) - V.begin()), V.size(), 0, SGN);
	MN = Get( lower_bound(all(V), pl) - V.begin() );
	//cerr << qn << ' ' << MN << '\n';
	ans[qn] = max(ans[qn], pl - MN);
	//if(CNT != k) return -1;
	//return max(MX - pl, pl - MN);
}
priority_queue<int, vector<int>, greater<int> > ms[N], msR[N];
 
inline void Norm(int idx){
	priority_queue<int, vector<int>, greater<int> > &AA = msR[idx];
	priority_queue<int, vector<int>, greater<int> > &BB = ms[idx];	
	while(!AA.empty() && AA.top() == BB.top()){
		AA.pop();
		BB.pop();
	}
}
//multiset<int> ms[N];
inline void SegRem(int tp, int pl){
	pii ran = GetRange(GetRange(tp, pl));
	
	if(ran.S == 0) return ;
	ran.S --;
	msR[ran.S].push(ran.F);
	Norm(ran.S);
	//ms[ran.S - 1].erase(ms[ran.S - 1].find(ran.F));
	Set(ran.S, (ms[ran.S].empty() ? Inf : ms[ran.S].top()));
	//Rem(1, ran.F, ran.S, pl, 0, V.size());
}
inline void SegAdd(int tp, int pl){
	pii ran = GetRange(GetRange(tp, pl));
	if(ran.S == 0) return ;
	ran.S --;
 
	ms[ran.S].push(ran.F);
	Norm(ran.S);
	//debug(ran.S - 1);
	Set(ran.S, ms[ran.S].top());
	//Ins(1, ran.F, ran.S, pl, 0, V.size());
}
void Add(int tp, int pl){
	//cerr << "+ " << tp << ' ' << pl << '\n';
	//mp[tp][pl] ++;
	//if(mp[tp][pl] > 1) return ;
 
	auto it = rec[tp].lower_bound(pl);
	int la = -1;
	//if(it != rec[tp].end()) nx = *it;
	if(it != rec[tp].begin()) la = *Prev(it);
	//if(nx != -1) SegRem(tp, nx);
	if(la != -1){
		hint = Prev(it);
		SegRem(tp, la);
 	}
	//rec[tp].insert(pl);
 	it = rec[tp].insert(it, pl);
	//if(nx != -1) SegAdd(tp, nx);
	//it = rec[tp].find(pl);
	if(la != -1){
		hint = Prev(it);
		SegAdd(tp, la);
	}
	hint = it;
	SegAdd(tp, pl);
}
void Erase(int tp, int pl){
	//cerr << "- " << tp << ' ' << pl << '\n';
	//mp[tp][pl] --;
	//if(mp[tp][pl] > 0) return ;
 
	auto it = rec[tp].find(pl);
	int la = -1;
	
	//if(Next(it) != rec[tp].end()) nx = *Next(it);
	if(it != rec[tp].begin()){
		hint = Prev(it);
		la = *hint;
	}
	//if(nx != -1) SegRem(tp, nx);
	if(la != -1){
		//hint = Prev(it);
		SegRem(tp, la);
	}
 
	hint = it;
	SegRem(tp, pl);
 
	it = rec[tp].erase(it);
	
	//if(nx != -1) SegAdd(tp, nx);
	if(la != -1){
		hint = Prev(it);
		SegAdd(tp, la);
	}
}
 
vector<int> Ea[N], Er[N], Eq[N];
 
 
int flg[N], open[N], cntn;
 
vector<pii> Alt;
int Alti[N], cnti[N];
 
int main(){
	//ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	//freopen("Big.txt", "r", stdin);
	//freopen("Out.txt", "w", stdout);
 
	//clock_t StartTime = clock();
	scanf("%d%d%d", &n, &k, &q);
 
	//cin >> n >> k >> q;
	for(int i = 1; i <= n; i++){
		scanf("%d%d%d%d", x + i, t + i, a + i, b + i);
		Alt.pb({x[i], t[i]});
		//cin >> x[i] >> t[i] >> a[i] >> b[i];
		b[i] ++;
		//V.pb(a[i]); V.pb(b[i]);
	}
	sort(all(Alt)); Alt.resize(unique(all(Alt)) - Alt.begin());
	for(int i = 1; i <= n; i++)
		Alti[i] = lower_bound(all(Alt), pii(x[i], t[i])) - Alt.begin();
 
	for(int i = 1; i <= q; i++){
		scanf("%d%d", y + i, c + i);
		//cin >> y[i] >> c[i];
		V.pb(c[i]);
	}
 
	sort(all(V)); V.resize(unique(all(V)) - V.begin());
	V.pb(1e8 + 1);
	int AllT = V.size();
	assert(AllT < N);
	for(int i = 1; i <= n; i++){
		a[i] = lower_bound(all(V), a[i]) - V.begin();
		b[i] = lower_bound(all(V), b[i]) - V.begin();
		Ea[a[i]].pb(i);
		Er[b[i]].pb(i);
		//cerr << "!!! " << a[i] << ' ' << b[i] << '\n';
	}
	for(int i = 1; i <= q; i++){
		c[i] = (lower_bound(all(V), c[i]) - V.begin() );
		Eq[c[i]].pb(i);
		//cerr << "? " << c[i] << '\n';
	}
 
	V.clear();
	//for(int i = 1; i <= n; i++) V.pb(x[i]);
	for(int i = 1; i <= q; i++) V.pb(y[i]);
	sort(all(V)); V.resize(unique(all(V)) - V.begin());
 
	memset(seg, 31, sizeof seg);
 
	for(int tm = 0; tm < AllT; tm++){
		for(auto i : Ea[tm]){
			cnti[Alti[i]] ++;
			if(cnti[Alti[i]] == 1) Add(t[i], x[i]);
			open[t[i]] ++;
			if(open[t[i]] == 1) cntn ++;
		}
		for(auto i : Er[tm]){
			cnti[Alti[i]] --;
			if(cnti[Alti[i]] == 0) Erase(t[i], x[i]);
			open[t[i]] --;
			if(open[t[i]] == 0) cntn --;
		}
		for(auto i : Eq[tm]){
			SegGet(i);
			//cerr << i << ' ' << c
			if(cntn < k) flg[i] = true;
		}
		//cerr << '\n';
	}
	//if(n == 300000) assert(false);
 
	int SM = 100000001;
	for(int i = 1; i <= n; i ++) x[i] = SM - x[i];
	for(int i = 1; i <= q; i ++) y[i] = SM - y[i];
	for(auto &el : V)
		if(el < SM)
			el = SM - el;
	sort(all(V)); V.resize(unique(all(V)) - V.begin());
	
	memset(seg, 31, sizeof seg);	
	for(int tm = 0; tm < AllT; tm++){
		for(auto i : Ea[tm]){
			cnti[Alti[i]] ++;
			if(cnti[Alti[i]] == 1) Add(t[i], x[i]);
		}
		for(auto i : Er[tm]){
			cnti[Alti[i]] --;
			if(cnti[Alti[i]] == 0) Erase(t[i], x[i]);
		}
		for(auto i : Eq[tm])
			SegGet(i);
		//cerr << '\n';
	}
 	
 
 
	for(int i = 1; i <= q; i++) printf("%d\n", (flg[i] ? -1 : ans[i]) );
	
 
	//cerr << fixed << setprecision(4) << (double)(clock() - StartTime)/CLOCKS_PER_SEC << '\n';
	return 0;
}
/*
4 2 4
3 1 1 10
9 2 2 4
7 2 5 7
4 1 8 10
5 3
5 6
5 9
1 10
 
2 1 3
1 1 1 4
1 1 2 6
1 3
1 5
1 7
 
1 1 1
100000000 1 1 1
1 1
 
*/

Compilation message

new_home.cpp: In function 'int main()':
new_home.cpp:234:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d", &n, &k, &q);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~
new_home.cpp:238:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d%d", x + i, t + i, a + i, b + i);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
new_home.cpp:249:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", y + i, c + i);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 58496 KB Output is correct
2 Correct 34 ms 58624 KB Output is correct
3 Correct 32 ms 58492 KB Output is correct
4 Correct 32 ms 58496 KB Output is correct
5 Correct 37 ms 58488 KB Output is correct
6 Correct 35 ms 58616 KB Output is correct
7 Correct 34 ms 58624 KB Output is correct
8 Correct 39 ms 58576 KB Output is correct
9 Correct 38 ms 58616 KB Output is correct
10 Correct 41 ms 58624 KB Output is correct
11 Correct 38 ms 58616 KB Output is correct
12 Correct 38 ms 58624 KB Output is correct
13 Correct 33 ms 58616 KB Output is correct
14 Correct 43 ms 58624 KB Output is correct
15 Correct 34 ms 58616 KB Output is correct
16 Correct 34 ms 58616 KB Output is correct
17 Correct 39 ms 58616 KB Output is correct
18 Correct 34 ms 58624 KB Output is correct
19 Correct 38 ms 58616 KB Output is correct
20 Correct 36 ms 58624 KB Output is correct
21 Correct 33 ms 58616 KB Output is correct
22 Correct 36 ms 58616 KB Output is correct
23 Correct 37 ms 58624 KB Output is correct
24 Correct 36 ms 58616 KB Output is correct
25 Correct 34 ms 58656 KB Output is correct
26 Correct 34 ms 58656 KB Output is correct
27 Correct 35 ms 58616 KB Output is correct
28 Correct 33 ms 58616 KB Output is correct
29 Correct 34 ms 58616 KB Output is correct
30 Correct 33 ms 58616 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 58496 KB Output is correct
2 Correct 34 ms 58624 KB Output is correct
3 Correct 32 ms 58492 KB Output is correct
4 Correct 32 ms 58496 KB Output is correct
5 Correct 37 ms 58488 KB Output is correct
6 Correct 35 ms 58616 KB Output is correct
7 Correct 34 ms 58624 KB Output is correct
8 Correct 39 ms 58576 KB Output is correct
9 Correct 38 ms 58616 KB Output is correct
10 Correct 41 ms 58624 KB Output is correct
11 Correct 38 ms 58616 KB Output is correct
12 Correct 38 ms 58624 KB Output is correct
13 Correct 33 ms 58616 KB Output is correct
14 Correct 43 ms 58624 KB Output is correct
15 Correct 34 ms 58616 KB Output is correct
16 Correct 34 ms 58616 KB Output is correct
17 Correct 39 ms 58616 KB Output is correct
18 Correct 34 ms 58624 KB Output is correct
19 Correct 38 ms 58616 KB Output is correct
20 Correct 36 ms 58624 KB Output is correct
21 Correct 33 ms 58616 KB Output is correct
22 Correct 36 ms 58616 KB Output is correct
23 Correct 37 ms 58624 KB Output is correct
24 Correct 36 ms 58616 KB Output is correct
25 Correct 34 ms 58656 KB Output is correct
26 Correct 34 ms 58656 KB Output is correct
27 Correct 35 ms 58616 KB Output is correct
28 Correct 33 ms 58616 KB Output is correct
29 Correct 34 ms 58616 KB Output is correct
30 Correct 33 ms 58616 KB Output is correct
31 Correct 717 ms 72876 KB Output is correct
32 Correct 96 ms 62448 KB Output is correct
33 Correct 747 ms 70900 KB Output is correct
34 Correct 688 ms 71128 KB Output is correct
35 Correct 729 ms 72672 KB Output is correct
36 Correct 757 ms 72592 KB Output is correct
37 Correct 440 ms 70252 KB Output is correct
38 Correct 447 ms 70128 KB Output is correct
39 Correct 383 ms 69872 KB Output is correct
40 Correct 413 ms 70000 KB Output is correct
41 Correct 449 ms 69744 KB Output is correct
42 Correct 415 ms 69616 KB Output is correct
43 Correct 93 ms 63212 KB Output is correct
44 Correct 411 ms 69748 KB Output is correct
45 Correct 410 ms 69620 KB Output is correct
46 Correct 372 ms 69460 KB Output is correct
47 Correct 251 ms 68720 KB Output is correct
48 Correct 250 ms 68976 KB Output is correct
49 Correct 277 ms 69104 KB Output is correct
50 Correct 313 ms 69108 KB Output is correct
51 Correct 291 ms 69236 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3174 ms 118788 KB Output is correct
2 Correct 4900 ms 120960 KB Output is correct
3 Correct 1426 ms 106788 KB Output is correct
4 Correct 2555 ms 116936 KB Output is correct
5 Correct 3881 ms 120028 KB Output is correct
6 Correct 4139 ms 120328 KB Output is correct
7 Correct 1296 ms 106848 KB Output is correct
8 Correct 2218 ms 116288 KB Output is correct
9 Correct 2648 ms 120196 KB Output is correct
10 Correct 3325 ms 121060 KB Output is correct
11 Correct 1767 ms 120056 KB Output is correct
12 Correct 1873 ms 121072 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 4876 ms 126152 KB Output is correct
2 Correct 336 ms 77148 KB Output is correct
3 Execution timed out 5071 ms 124588 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 58496 KB Output is correct
2 Correct 34 ms 58624 KB Output is correct
3 Correct 32 ms 58492 KB Output is correct
4 Correct 32 ms 58496 KB Output is correct
5 Correct 37 ms 58488 KB Output is correct
6 Correct 35 ms 58616 KB Output is correct
7 Correct 34 ms 58624 KB Output is correct
8 Correct 39 ms 58576 KB Output is correct
9 Correct 38 ms 58616 KB Output is correct
10 Correct 41 ms 58624 KB Output is correct
11 Correct 38 ms 58616 KB Output is correct
12 Correct 38 ms 58624 KB Output is correct
13 Correct 33 ms 58616 KB Output is correct
14 Correct 43 ms 58624 KB Output is correct
15 Correct 34 ms 58616 KB Output is correct
16 Correct 34 ms 58616 KB Output is correct
17 Correct 39 ms 58616 KB Output is correct
18 Correct 34 ms 58624 KB Output is correct
19 Correct 38 ms 58616 KB Output is correct
20 Correct 36 ms 58624 KB Output is correct
21 Correct 33 ms 58616 KB Output is correct
22 Correct 36 ms 58616 KB Output is correct
23 Correct 37 ms 58624 KB Output is correct
24 Correct 36 ms 58616 KB Output is correct
25 Correct 34 ms 58656 KB Output is correct
26 Correct 34 ms 58656 KB Output is correct
27 Correct 35 ms 58616 KB Output is correct
28 Correct 33 ms 58616 KB Output is correct
29 Correct 34 ms 58616 KB Output is correct
30 Correct 33 ms 58616 KB Output is correct
31 Correct 717 ms 72876 KB Output is correct
32 Correct 96 ms 62448 KB Output is correct
33 Correct 747 ms 70900 KB Output is correct
34 Correct 688 ms 71128 KB Output is correct
35 Correct 729 ms 72672 KB Output is correct
36 Correct 757 ms 72592 KB Output is correct
37 Correct 440 ms 70252 KB Output is correct
38 Correct 447 ms 70128 KB Output is correct
39 Correct 383 ms 69872 KB Output is correct
40 Correct 413 ms 70000 KB Output is correct
41 Correct 449 ms 69744 KB Output is correct
42 Correct 415 ms 69616 KB Output is correct
43 Correct 93 ms 63212 KB Output is correct
44 Correct 411 ms 69748 KB Output is correct
45 Correct 410 ms 69620 KB Output is correct
46 Correct 372 ms 69460 KB Output is correct
47 Correct 251 ms 68720 KB Output is correct
48 Correct 250 ms 68976 KB Output is correct
49 Correct 277 ms 69104 KB Output is correct
50 Correct 313 ms 69108 KB Output is correct
51 Correct 291 ms 69236 KB Output is correct
52 Correct 320 ms 69488 KB Output is correct
53 Correct 315 ms 68148 KB Output is correct
54 Correct 479 ms 71664 KB Output is correct
55 Correct 364 ms 70196 KB Output is correct
56 Correct 361 ms 70384 KB Output is correct
57 Correct 421 ms 69872 KB Output is correct
58 Correct 393 ms 70252 KB Output is correct
59 Correct 370 ms 70380 KB Output is correct
60 Correct 408 ms 69876 KB Output is correct
61 Correct 131 ms 66544 KB Output is correct
62 Correct 316 ms 69488 KB Output is correct
63 Correct 401 ms 70896 KB Output is correct
64 Correct 481 ms 71024 KB Output is correct
65 Correct 431 ms 70004 KB Output is correct
66 Correct 452 ms 69872 KB Output is correct
67 Correct 244 ms 65388 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 58496 KB Output is correct
2 Correct 34 ms 58624 KB Output is correct
3 Correct 32 ms 58492 KB Output is correct
4 Correct 32 ms 58496 KB Output is correct
5 Correct 37 ms 58488 KB Output is correct
6 Correct 35 ms 58616 KB Output is correct
7 Correct 34 ms 58624 KB Output is correct
8 Correct 39 ms 58576 KB Output is correct
9 Correct 38 ms 58616 KB Output is correct
10 Correct 41 ms 58624 KB Output is correct
11 Correct 38 ms 58616 KB Output is correct
12 Correct 38 ms 58624 KB Output is correct
13 Correct 33 ms 58616 KB Output is correct
14 Correct 43 ms 58624 KB Output is correct
15 Correct 34 ms 58616 KB Output is correct
16 Correct 34 ms 58616 KB Output is correct
17 Correct 39 ms 58616 KB Output is correct
18 Correct 34 ms 58624 KB Output is correct
19 Correct 38 ms 58616 KB Output is correct
20 Correct 36 ms 58624 KB Output is correct
21 Correct 33 ms 58616 KB Output is correct
22 Correct 36 ms 58616 KB Output is correct
23 Correct 37 ms 58624 KB Output is correct
24 Correct 36 ms 58616 KB Output is correct
25 Correct 34 ms 58656 KB Output is correct
26 Correct 34 ms 58656 KB Output is correct
27 Correct 35 ms 58616 KB Output is correct
28 Correct 33 ms 58616 KB Output is correct
29 Correct 34 ms 58616 KB Output is correct
30 Correct 33 ms 58616 KB Output is correct
31 Correct 717 ms 72876 KB Output is correct
32 Correct 96 ms 62448 KB Output is correct
33 Correct 747 ms 70900 KB Output is correct
34 Correct 688 ms 71128 KB Output is correct
35 Correct 729 ms 72672 KB Output is correct
36 Correct 757 ms 72592 KB Output is correct
37 Correct 440 ms 70252 KB Output is correct
38 Correct 447 ms 70128 KB Output is correct
39 Correct 383 ms 69872 KB Output is correct
40 Correct 413 ms 70000 KB Output is correct
41 Correct 449 ms 69744 KB Output is correct
42 Correct 415 ms 69616 KB Output is correct
43 Correct 93 ms 63212 KB Output is correct
44 Correct 411 ms 69748 KB Output is correct
45 Correct 410 ms 69620 KB Output is correct
46 Correct 372 ms 69460 KB Output is correct
47 Correct 251 ms 68720 KB Output is correct
48 Correct 250 ms 68976 KB Output is correct
49 Correct 277 ms 69104 KB Output is correct
50 Correct 313 ms 69108 KB Output is correct
51 Correct 291 ms 69236 KB Output is correct
52 Correct 3174 ms 118788 KB Output is correct
53 Correct 4900 ms 120960 KB Output is correct
54 Correct 1426 ms 106788 KB Output is correct
55 Correct 2555 ms 116936 KB Output is correct
56 Correct 3881 ms 120028 KB Output is correct
57 Correct 4139 ms 120328 KB Output is correct
58 Correct 1296 ms 106848 KB Output is correct
59 Correct 2218 ms 116288 KB Output is correct
60 Correct 2648 ms 120196 KB Output is correct
61 Correct 3325 ms 121060 KB Output is correct
62 Correct 1767 ms 120056 KB Output is correct
63 Correct 1873 ms 121072 KB Output is correct
64 Correct 4876 ms 126152 KB Output is correct
65 Correct 336 ms 77148 KB Output is correct
66 Execution timed out 5071 ms 124588 KB Time limit exceeded
67 Halted 0 ms 0 KB -