oj.uz

답안 #543839

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
543839 2022-03-31T13:43:23 Z amunduzbaev 새 집 (APIO18_new_home) C++17
57 / 100
 5000 ms 766264 KB 
#include "bits/stdc++.h"
using namespace std;

namespace NLOGsq{

#define ar array
#define pq priority_queue

const int N = 3e5 + 5;
const int M = N * 30;
const int MX = 1e8 + 5;
 
struct node{
	pq<int> in[2], del[2];
	int f[2];
	
	node (){
		f[0] = f[1] = 0;
	}
};
 
node def;
 
struct ST{
	vector<node> tree;
	int last;
	ST(){
		tree.push_back(def);
		last = 0;
	}
	
	void make_l(int x){
		//~ tree.push_back(def);
		if(tree[x].f[0]) return;
		tree.push_back(def);
		tree[x].f[0] = ++last; // tree[x].f[1] = ++last;
		//~ assert(last < M);
	}
	void make_r(int x){
		//~ tree.push_back(def);
		if(tree[x].f[1]) return;
		tree.push_back(def);
		tree[x].f[1] = ++last; // tree[x].f[1] = ++last;
		//~ assert(last < M);
	}
	
	void add(int l, int r, int s, int t, int lx = 0, int rx = MX, int x = 0){
		if(lx > r || rx < l) return;
		if(lx >= l && rx <= r){
			if(t == 1){
				tree[x].in[0].push(s + (lx - l));
			} else {
				tree[x].in[1].push(s - (lx - l));
			} return;
		} int m = (lx + rx) >> 1;
		//~ make(x);
		if(lx <= r && m >= l){
			make_l(x);
			add(l, r, s, t, lx, m, tree[x].f[0]);
		} if(m + 1 <= r && rx >= l){
			make_r(x);
			add(l, r, s, t, m+1, rx, tree[x].f[1]);
		}
		//~ add(l, r, s, t, lx, m, tree[x].f[0]), add(l, r, s, t, m+1, rx, tree[x].f[1]);
	}
	
	void bal(pq<int>& a, pq<int>& b){
		while(!a.empty() && !b.empty() && a.top() == b.top()){
			a.pop();
			b.pop();
		}
	}
	
	void del(int l, int r, int s, int t, int lx = 0, int rx = MX, int x = 0){
		if(lx > r || rx < l) return;
		if(lx >= l && rx <= r){
			if(t == 1){
				tree[x].del[0].push(s + (lx - l));
			} else {
				tree[x].del[1].push(s - (lx - l));
			} return;
		} int m = (lx + rx) >> 1;
		if(lx <= r && m >= l){
			make_l(x);
			del(l, r, s, t, lx, m, tree[x].f[0]);
		} if(m + 1 <= r && rx >= l){
			make_r(x);
			del(l, r, s, t, m+1, rx, tree[x].f[1]);
		}
	}
	
	int get(int i, int lx = 0, int rx = MX, int x = 0){
		int res = 0;
		bal(tree[x].in[0], tree[x].del[0]);
		bal(tree[x].in[1], tree[x].del[1]);
		if(!tree[x].in[0].empty()) res = max(res, tree[x].in[0].top() + (i - lx));
		if(!tree[x].in[1].empty()) res = max(res, tree[x].in[1].top() - (i - lx));
		if(lx == rx) return res;
		int m = (lx + rx) >> 1;
		if(i <= m) return max((tree[x].f[0] ? get(i, lx, m, tree[x].f[0]) : 0), res);
		else return max((tree[x].f[1] ? get(i, m+1, rx, tree[x].f[1]) : 0), res);
	}
}tree;
/*

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

*/

int x[N], t[N], a[N], b[N], l[N], y[N];
multiset<int> ss[N];

void solve(int n, int k, int q){ // assert(false);
	for(int i=0;i<n;i++){
		cin>>x[i]>>t[i]>>a[i]>>b[i];
		--t[i];
	}

	auto add = [&](int l, int r){
		if(l == r) return;
		int m = (l + r) >> 1;
		tree.add(l, m, 0, 1);
		tree.add(m + 1, r, r - m - 1, -1);
	}; auto inc = [&](int x) { tree.add(x, MX, 0, 1); };
	auto dec = [&](int x) { tree.add(0, x, x, -1); };
	
	auto dadd = [&](int l, int r){
		if(l == r) return;
		int m = (l + r) >> 1;
		tree.del(l, m, 0, 1);
		tree.del(m + 1, r, r - m - 1, -1);
	}; auto dinc = [&](int x) { tree.del(x, MX, 0, 1); };
	auto ddec = [&](int x) { tree.del(0, x, x, -1); };
	
	//~ bool is = 1;
	//~ for(int i=0;i<k;i++){
		//~ if(stor[i].empty()) { is = 0; break; }
		//~ sort(stor[i].begin(), stor[i].end(), [&](int i, int j){
			//~ return (x[i] < x[j]);
		//~ });
		//~ for(int j=1;j<(int)stor[i].size();j++){
			//~ add(x[stor[i][j-1]], x[stor[i][j]]);
		//~ }
		
		//~ dec(x[stor[i][0]]);
		//~ inc(x[stor[i].back()]);
	//~ }
	
	vector<int> in(n); iota(in.begin(), in.end(), 0);
	vector<int> out(n); iota(out.begin(), out.end(), 0);
	sort(in.begin(), in.end(), [&](int i, int j){
		return (a[i] < a[j]);
	});
	sort(out.begin(), out.end(), [&](int i, int j){
		return (b[i] < b[j]);
	});
	vector<int> p(q);
	
	for(int i=0;i<q;i++){ p[i] = i;
		cin>>l[i]>>y[i];
	}
	
	sort(p.begin(), p.end(), [&](int i, int j){
		return (y[i] < y[j]);
	});
	
	int I = 0, O = 0, c = k;
	auto NEW = [&](int i){
		auto it = ss[t[i]].upper_bound(x[i]);
		if(ss[t[i]].empty()) c--;
		if(it == ss[t[i]].end()){
			if(it != ss[t[i]].begin()){
				it--;
				dinc(*it);
				add(*it, x[i]);
				inc(x[i]);
			} else {
				inc(x[i]);
				dec(x[i]);
			}
		} else {
			if(it == ss[t[i]].begin()){
				ddec(*it);
				add(x[i], *it);
				dec(x[i]);
			} else {
				auto R = it; it--;
				dadd(*it, *R);
				add(*it, x[i]);
				add(x[i], *R);
			}
		}
		
		ss[t[i]].insert(x[i]);
	};
	
	auto DEL = [&](int i){
		ss[t[i]].erase(ss[t[i]].find(x[i]));
		if(ss[t[i]].empty()) c++;
		auto it = ss[t[i]].upper_bound(x[i]);
		if(it == ss[t[i]].end()){
			if(it == ss[t[i]].begin()){
				dinc(x[i]);
				ddec(x[i]);
			} else {
				it--;
				dadd(*it, x[i]);
				dinc(x[i]);
				inc(*it);
			}
		} else {
			if(it == ss[t[i]].begin()){
				dadd(x[i], *it);
				ddec(x[i]);
				dec(*it);
			} else {
				auto R = it; it--;
				dadd(*it, x[i]);
				dadd(x[i], *R);
				add(*it, *R);
			}
		}
	};
	
	vector<int> res(q);
	for(auto i : p){
		while(I < n && a[in[I]] <= y[i]){
			NEW(in[I]);
			I++;
		}
		
		while(O < n && b[out[O]] < y[i]){
			DEL(out[O]);
			O++;
		}
		
		if(!c) res[i] = tree.get(l[i]);
		else res[i] = -1;
	}
	
	for(int i=0;i<q;i++) cout<<res[i]<<"\n";
}
};

namespace temp{
const int N = 3e5 + 5;
const int M = N * 30;
const int MX = 1e8 + 5;

struct ST{
	int tree[M][2], f[M][2];
	int last;
	
	ST(){
		memset(tree, -1, sizeof tree);
		last = 0;
	}
	
	void make(int x){
		if(!f[x][0]) f[x][0] = ++last;
		if(!f[x][1]) f[x][1] = ++last;
	}
	
	void umax(int l, int r, int s, int t, int lx = 0, int rx = MX, int x = 0){
		if(lx > r || rx < l) return;
		if(lx >= l && rx <= r){
			if(t == 1) tree[x][0] = max(tree[x][0], s + (lx - l));
			else tree[x][1] = max(tree[x][1], s - (lx - l));
			return;
		} int m = (lx + rx) >> 1;
		make(x);
		umax(l, r, s, t, lx, m, f[x][0]);
		umax(l, r, s, t, m+1, rx, f[x][1]);
	}
	
	int get(int i, int lx = 0, int rx = MX, int x = 0){
		int res = 0;
		if(~tree[x][0]) res = max(res, tree[x][0] + (i - lx));
		if(~tree[x][1]) res = max(res, tree[x][1] - (i - lx));
		if(lx == rx) return res;
		int m = (lx + rx) >> 1;
		if(i <= m) return max((f[x][0] ? get(i, lx, m, f[x][0]) : 0), res);
		else return max((f[x][1] ? get(i, m+1, rx, f[x][1]) : 0), res);
	}
}tree;

int x[N], t[N], a[N], b[N], l[N], y[N];
multiset<int> ss[N];
vector<int> stor[N];

void solve(int n, int k, int q){
	for(int i=0;i<n;i++){
		cin>>x[i]>>t[i]>>a[i]>>b[i];
		--t[i];
		stor[t[i]].push_back(i);
	}

	auto add = [&](int l, int r){
		if(l == r) return;
		int m = (l + r) >> 1;
		tree.umax(l, m, 0, 1);
		tree.umax(m + 1, r, r - m - 1, -1);
	}; auto inc = [&](int x) { tree.umax(x, MX, 0, 1); };
	auto dec = [&](int x) { tree.umax(0, x, x, -1); };
	
	//~ auto dadd = [&](int l, int r){
		//~ if(l == r) return;
		//~ int m = (l + r) >> 1;
		//~ tree.del(l, m, 0, 1);
		//~ tree.del(m + 1, r, r - m - 1, -1);
	//~ }; auto dinc = [&](int x) { tree.del(x, MX, 0, 1); };
	//~ auto ddec = [&](int x) { tree.del(0, x, x, -1); };
	
	//~ bool is = 1;
	//~ for(int i=0;i<k;i++){
		//~ if(stor[i].empty()) { is = 0; break; }
		//~ sort(stor[i].begin(), stor[i].end(), [&](int i, int j){
			//~ return (x[i] < x[j]);
		//~ });
		//~ for(int j=1;j<(int)stor[i].size();j++){
			//~ add(x[stor[i][j-1]], x[stor[i][j]]);
		//~ }
		
		//~ dec(x[stor[i][0]]);
		//~ inc(x[stor[i].back()]);
	//~ }
	
	//~ vector<int> in(n); iota(in.begin(), in.end(), 0);
	vector<int> out(n); iota(out.begin(), out.end(), 0);
	//~ sort(in.begin(), in.end(), [&](int i, int j){
		//~ return (a[i] < a[j]);
	//~ });
	sort(out.begin(), out.end(), [&](int i, int j){
		return (b[i] < b[j]);
	});
	vector<int> p(q);
	
	for(int i=0;i<q;i++){ p[i] = i;
		cin>>l[i]>>y[i];
	}
	
	sort(p.begin(), p.end(), [&](int i, int j){
		return (y[i] < y[j]);
	});
	
	int O = 0, c = 0;
	
	for(int i=0;i<k;i++){
		if(stor[i].empty()) { c++; break; }
		sort(stor[i].begin(), stor[i].end(), [&](int i, int j){
			return (x[i] < x[j]);
		});
		
		for(int j=1;j<(int)stor[i].size();j++){
			add(x[stor[i][j-1]], x[stor[i][j]]);
		}
		
		inc(x[stor[i].back()]);
		dec(x[stor[i][0]]);
	}
	
	auto DEL = [&](int i){
		ss[t[i]].erase(ss[t[i]].find(x[i]));
		if(ss[t[i]].empty()) c++;
		auto it = ss[t[i]].upper_bound(x[i]);
		if(it == ss[t[i]].end()){
			if(it == ss[t[i]].begin()){
				//~ dinc(x[i]);
				//~ ddec(x[i]);
			} else {
				it--;
				//~ dadd(*it, x[i]);
				//~ dinc(x[i]);
				inc(*it);
			}
		} else {
			if(it == ss[t[i]].begin()){
				//~ dadd(x[i], *it);
				//~ ddec(x[i]);
				dec(*it);
			} else {
				auto R = it; it--;
				//~ dadd(*it, x[i]);
				//~ dadd(x[i], *R);
				add(*it, *R);
			}
		}
	};
	
	vector<int> res(q);
	for(auto i : p){
		//~ while(I < n && a[in[I]] <= y[i]){
			//~ NEW(in[I]);
			//~ I++;
		//~ }
		
		while(O < n && b[out[O]] < y[i]){
			DEL(out[O]);
			O++;
		}
		
		if(!c) res[i] = tree.get(l[i]);
		else res[i] = -1;
	}
	
	for(int i=0;i<q;i++) cout<<res[i]<<"\n";
}

};

signed main(){
	ios::sync_with_stdio(0); cin.tie(0);
	
	int n, k, q; cin>>n>>k>>q;
	if(n <= 60000 && q <= 60000){
		NLOGsq::solve(n, k, q);
	} else {
		temp::solve(n, k, q);
	}
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 105932 KB Output is correct
2 Correct 46 ms 106004 KB Output is correct
3 Correct 45 ms 105976 KB Output is correct
4 Correct 50 ms 106356 KB Output is correct
5 Correct 47 ms 106048 KB Output is correct
6 Correct 59 ms 115948 KB Output is correct
7 Correct 49 ms 108564 KB Output is correct
8 Correct 53 ms 110740 KB Output is correct
9 Correct 48 ms 108356 KB Output is correct
10 Correct 59 ms 115724 KB Output is correct
11 Correct 54 ms 110984 KB Output is correct
12 Correct 55 ms 115968 KB Output is correct
13 Correct 50 ms 110964 KB Output is correct
14 Correct 52 ms 110996 KB Output is correct
15 Correct 50 ms 110960 KB Output is correct
16 Correct 52 ms 110856 KB Output is correct
17 Correct 55 ms 111004 KB Output is correct
18 Correct 51 ms 110912 KB Output is correct
19 Correct 52 ms 110916 KB Output is correct
20 Correct 54 ms 110976 KB Output is correct
21 Correct 45 ms 106048 KB Output is correct
22 Correct 49 ms 108356 KB Output is correct
23 Correct 55 ms 110788 KB Output is correct
24 Correct 58 ms 110872 KB Output is correct
25 Correct 58 ms 110916 KB Output is correct
26 Correct 55 ms 111220 KB Output is correct
27 Correct 54 ms 106104 KB Output is correct
28 Correct 54 ms 110972 KB Output is correct
29 Correct 54 ms 110972 KB Output is correct
30 Correct 58 ms 110944 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 105932 KB Output is correct
2 Correct 46 ms 106004 KB Output is correct
3 Correct 45 ms 105976 KB Output is correct
4 Correct 50 ms 106356 KB Output is correct
5 Correct 47 ms 106048 KB Output is correct
6 Correct 59 ms 115948 KB Output is correct
7 Correct 49 ms 108564 KB Output is correct
8 Correct 53 ms 110740 KB Output is correct
9 Correct 48 ms 108356 KB Output is correct
10 Correct 59 ms 115724 KB Output is correct
11 Correct 54 ms 110984 KB Output is correct
12 Correct 55 ms 115968 KB Output is correct
13 Correct 50 ms 110964 KB Output is correct
14 Correct 52 ms 110996 KB Output is correct
15 Correct 50 ms 110960 KB Output is correct
16 Correct 52 ms 110856 KB Output is correct
17 Correct 55 ms 111004 KB Output is correct
18 Correct 51 ms 110912 KB Output is correct
19 Correct 52 ms 110916 KB Output is correct
20 Correct 54 ms 110976 KB Output is correct
21 Correct 45 ms 106048 KB Output is correct
22 Correct 49 ms 108356 KB Output is correct
23 Correct 55 ms 110788 KB Output is correct
24 Correct 58 ms 110872 KB Output is correct
25 Correct 58 ms 110916 KB Output is correct
26 Correct 55 ms 111220 KB Output is correct
27 Correct 54 ms 106104 KB Output is correct
28 Correct 54 ms 110972 KB Output is correct
29 Correct 54 ms 110972 KB Output is correct
30 Correct 58 ms 110944 KB Output is correct
31 Correct 3543 ms 759564 KB Output is correct
32 Correct 293 ms 111564 KB Output is correct
33 Correct 3020 ms 755948 KB Output is correct
34 Correct 3848 ms 754696 KB Output is correct
35 Correct 4030 ms 765328 KB Output is correct
36 Correct 3379 ms 760628 KB Output is correct
37 Correct 2907 ms 761972 KB Output is correct
38 Correct 2468 ms 757696 KB Output is correct
39 Correct 1776 ms 759756 KB Output is correct
40 Correct 1788 ms 758552 KB Output is correct
41 Correct 2305 ms 760136 KB Output is correct
42 Correct 2300 ms 763860 KB Output is correct
43 Correct 115 ms 112700 KB Output is correct
44 Correct 2352 ms 759852 KB Output is correct
45 Correct 2052 ms 757272 KB Output is correct
46 Correct 1944 ms 756564 KB Output is correct
47 Correct 1124 ms 759440 KB Output is correct
48 Correct 1138 ms 758892 KB Output is correct
49 Correct 1291 ms 761636 KB Output is correct
50 Correct 1361 ms 766264 KB Output is correct
51 Correct 1344 ms 760860 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1114 ms 183856 KB Output is correct
2 Correct 821 ms 199032 KB Output is correct
3 Correct 926 ms 182828 KB Output is correct
4 Correct 1066 ms 194516 KB Output is correct
5 Correct 714 ms 198284 KB Output is correct
6 Correct 789 ms 198544 KB Output is correct
7 Correct 823 ms 182820 KB Output is correct
8 Correct 1064 ms 194264 KB Output is correct
9 Correct 1152 ms 198948 KB Output is correct
10 Correct 1020 ms 200228 KB Output is correct
11 Correct 748 ms 197800 KB Output is correct
12 Correct 860 ms 199668 KB Output is correct

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5045 ms 184652 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 105932 KB Output is correct
2 Correct 46 ms 106004 KB Output is correct
3 Correct 45 ms 105976 KB Output is correct
4 Correct 50 ms 106356 KB Output is correct
5 Correct 47 ms 106048 KB Output is correct
6 Correct 59 ms 115948 KB Output is correct
7 Correct 49 ms 108564 KB Output is correct
8 Correct 53 ms 110740 KB Output is correct
9 Correct 48 ms 108356 KB Output is correct
10 Correct 59 ms 115724 KB Output is correct
11 Correct 54 ms 110984 KB Output is correct
12 Correct 55 ms 115968 KB Output is correct
13 Correct 50 ms 110964 KB Output is correct
14 Correct 52 ms 110996 KB Output is correct
15 Correct 50 ms 110960 KB Output is correct
16 Correct 52 ms 110856 KB Output is correct
17 Correct 55 ms 111004 KB Output is correct
18 Correct 51 ms 110912 KB Output is correct
19 Correct 52 ms 110916 KB Output is correct
20 Correct 54 ms 110976 KB Output is correct
21 Correct 45 ms 106048 KB Output is correct
22 Correct 49 ms 108356 KB Output is correct
23 Correct 55 ms 110788 KB Output is correct
24 Correct 58 ms 110872 KB Output is correct
25 Correct 58 ms 110916 KB Output is correct
26 Correct 55 ms 111220 KB Output is correct
27 Correct 54 ms 106104 KB Output is correct
28 Correct 54 ms 110972 KB Output is correct
29 Correct 54 ms 110972 KB Output is correct
30 Correct 58 ms 110944 KB Output is correct
31 Correct 3543 ms 759564 KB Output is correct
32 Correct 293 ms 111564 KB Output is correct
33 Correct 3020 ms 755948 KB Output is correct
34 Correct 3848 ms 754696 KB Output is correct
35 Correct 4030 ms 765328 KB Output is correct
36 Correct 3379 ms 760628 KB Output is correct
37 Correct 2907 ms 761972 KB Output is correct
38 Correct 2468 ms 757696 KB Output is correct
39 Correct 1776 ms 759756 KB Output is correct
40 Correct 1788 ms 758552 KB Output is correct
41 Correct 2305 ms 760136 KB Output is correct
42 Correct 2300 ms 763860 KB Output is correct
43 Correct 115 ms 112700 KB Output is correct
44 Correct 2352 ms 759852 KB Output is correct
45 Correct 2052 ms 757272 KB Output is correct
46 Correct 1944 ms 756564 KB Output is correct
47 Correct 1124 ms 759440 KB Output is correct
48 Correct 1138 ms 758892 KB Output is correct
49 Correct 1291 ms 761636 KB Output is correct
50 Correct 1361 ms 766264 KB Output is correct
51 Correct 1344 ms 760860 KB Output is correct
52 Correct 815 ms 412588 KB Output is correct
53 Correct 833 ms 427732 KB Output is correct
54 Correct 1997 ms 765288 KB Output is correct
55 Correct 1747 ms 468384 KB Output is correct
56 Correct 1458 ms 428996 KB Output is correct
57 Correct 2060 ms 760984 KB Output is correct
58 Correct 1637 ms 469576 KB Output is correct
59 Correct 1403 ms 431064 KB Output is correct
60 Correct 1976 ms 764096 KB Output is correct
61 Correct 132 ms 117976 KB Output is correct
62 Correct 797 ms 412732 KB Output is correct
63 Correct 1438 ms 423332 KB Output is correct
64 Correct 1634 ms 462448 KB Output is correct
65 Correct 2137 ms 765820 KB Output is correct
66 Correct 2334 ms 763172 KB Output is correct
67 Correct 321 ms 123624 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 105932 KB Output is correct
2 Correct 46 ms 106004 KB Output is correct
3 Correct 45 ms 105976 KB Output is correct
4 Correct 50 ms 106356 KB Output is correct
5 Correct 47 ms 106048 KB Output is correct
6 Correct 59 ms 115948 KB Output is correct
7 Correct 49 ms 108564 KB Output is correct
8 Correct 53 ms 110740 KB Output is correct
9 Correct 48 ms 108356 KB Output is correct
10 Correct 59 ms 115724 KB Output is correct
11 Correct 54 ms 110984 KB Output is correct
12 Correct 55 ms 115968 KB Output is correct
13 Correct 50 ms 110964 KB Output is correct
14 Correct 52 ms 110996 KB Output is correct
15 Correct 50 ms 110960 KB Output is correct
16 Correct 52 ms 110856 KB Output is correct
17 Correct 55 ms 111004 KB Output is correct
18 Correct 51 ms 110912 KB Output is correct
19 Correct 52 ms 110916 KB Output is correct
20 Correct 54 ms 110976 KB Output is correct
21 Correct 45 ms 106048 KB Output is correct
22 Correct 49 ms 108356 KB Output is correct
23 Correct 55 ms 110788 KB Output is correct
24 Correct 58 ms 110872 KB Output is correct
25 Correct 58 ms 110916 KB Output is correct
26 Correct 55 ms 111220 KB Output is correct
27 Correct 54 ms 106104 KB Output is correct
28 Correct 54 ms 110972 KB Output is correct
29 Correct 54 ms 110972 KB Output is correct
30 Correct 58 ms 110944 KB Output is correct
31 Correct 3543 ms 759564 KB Output is correct
32 Correct 293 ms 111564 KB Output is correct
33 Correct 3020 ms 755948 KB Output is correct
34 Correct 3848 ms 754696 KB Output is correct
35 Correct 4030 ms 765328 KB Output is correct
36 Correct 3379 ms 760628 KB Output is correct
37 Correct 2907 ms 761972 KB Output is correct
38 Correct 2468 ms 757696 KB Output is correct
39 Correct 1776 ms 759756 KB Output is correct
40 Correct 1788 ms 758552 KB Output is correct
41 Correct 2305 ms 760136 KB Output is correct
42 Correct 2300 ms 763860 KB Output is correct
43 Correct 115 ms 112700 KB Output is correct
44 Correct 2352 ms 759852 KB Output is correct
45 Correct 2052 ms 757272 KB Output is correct
46 Correct 1944 ms 756564 KB Output is correct
47 Correct 1124 ms 759440 KB Output is correct
48 Correct 1138 ms 758892 KB Output is correct
49 Correct 1291 ms 761636 KB Output is correct
50 Correct 1361 ms 766264 KB Output is correct
51 Correct 1344 ms 760860 KB Output is correct
52 Correct 1114 ms 183856 KB Output is correct
53 Correct 821 ms 199032 KB Output is correct
54 Correct 926 ms 182828 KB Output is correct
55 Correct 1066 ms 194516 KB Output is correct
56 Correct 714 ms 198284 KB Output is correct
57 Correct 789 ms 198544 KB Output is correct
58 Correct 823 ms 182820 KB Output is correct
59 Correct 1064 ms 194264 KB Output is correct
60 Correct 1152 ms 198948 KB Output is correct
61 Correct 1020 ms 200228 KB Output is correct
62 Correct 748 ms 197800 KB Output is correct
63 Correct 860 ms 199668 KB Output is correct
64 Execution timed out 5045 ms 184652 KB Time limit exceeded
65 Halted 0 ms 0 KB -