oj.uz

답안 #872168

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
872168 2023-11-12T12:11:04 Z willychan 푸드 코트 (JOI21_foodcourt) C++17
100 / 100
 611 ms 52992 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
//#include<bits/extc++.h>
//__gnu_pbds
struct SegTree{
	struct node{
		int Minn = 0;
		int SMinn = (1e18);
		int maxtag= -1;
		int addtag = 0;
		void add(int v){
			Minn+=v;
			if(SMinn<1e18) SMinn+=v;
			if(maxtag!=-1) maxtag+=v;
			addtag +=v;		
		}
		void chmax(int v){
			if(v<=Minn) return;
			//addtag = max(v,addtag);
			maxtag = max(maxtag,v);
			Minn = v;

		}
	};
	node merge(node a,node b){
		node re;
		re.Minn = min(a.Minn,b.Minn);
		if(a.Minn == b.Minn){
			re.SMinn = min(a.SMinn,b.SMinn);
		}else if(a.Minn<b.Minn){
			re.SMinn = min(a.SMinn,b.Minn);
		}else{
			re.SMinn = min(b.SMinn,a.Minn);
		}
		return re;
	}
	vector<node> arr;
	int n;
	void init(int _n){
		n = _n;
		arr.resize(4*n)	;
	}
	void push(int ind){
		if(arr[ind].addtag){
			if(2*ind<4*n) arr[2*ind].add(arr[ind].addtag);
			if(2*ind+1<4*n) arr[2*ind+1].add(arr[ind].addtag);
		}
		arr[ind].addtag=0;
		if(arr[ind].maxtag!=-1){
			if(2*ind<4*n) arr[2*ind].chmax(arr[ind].maxtag);
			if(2*ind+1<4*n) arr[2*ind+1].chmax(arr[ind].maxtag);
		}
		arr[ind].maxtag=-1;
	}
	void built(int ind,int L,int R){
		if(L==R) return;
		int M = (L+R)/2;
		built(2*ind,L,M);
		built(2*ind,M+1,R);
		arr[ind] = merge(arr[2*ind],arr[2*ind+1]);
	}
	void Radd(int ind,int l,int r,int L,int R,int v){
		//cout<<l<<" "<<r<<" "<<L<<" "<<R<<endl;
		push(ind);
		if(L==l && r==R){
			arr[ind].add(v);
			return;
		}
		int M = (L+R)/2;
		if(r<=M) Radd(2*ind,l,r,L,M,v);
		else if(l>M) Radd(2*ind+1,l,r,M+1,R,v);
		else{
			Radd(2*ind,l,M,L,M,v);
			Radd(2*ind+1,M+1,r,M+1,R,v);
		}
		arr[ind] = merge(arr[2*ind],arr[2*ind+1]);
	}
	void Rchmax(int ind,int l,int r,int L,int R,int v){
		//cout<<l<<" "<<r<<" "<<L<<" "<<R<<endl;
		push(ind);
		if(l==L && r==R && v<arr[ind].SMinn){
			assert(arr[ind].addtag==0);
			arr[ind].chmax(v);
			return;
		}
		int M = (L+R)/2;
		if(r<=M) Rchmax(2*ind,l,r,L,M,v);
		else if(l>M) Rchmax(2*ind+1,l,r,M+1,R,v);
		else{
			Rchmax(2*ind,l,M,L,M,v);
			Rchmax(2*ind+1,M+1,r,M+1,R,v);
		}
		arr[ind] = merge(arr[2*ind],arr[2*ind+1]);
	}
	int query(int ind,int x,int L,int R){
		push(ind);
		if(L==R) return arr[ind].Minn;
		arr[ind] = merge(arr[2*ind],arr[2*ind+1]);
		int M = (L+R)/2;
		if(x<=M) return query(2*ind,x,L,M);
		else return query(2*ind+1,x,M+1,R);
	}
} seg;

struct bit{
	vector<ll> arr;
	int n;
	void init(int _n){
		n = _n;
		arr.resize(n+1);
	}
	void add(int ind,ll v){
		while(ind<=n) {
			arr[ind]+=v;
			ind+=(ind&-ind);
		}
	}
	int query(int ind){
		int ans = 0;	
		while(ind){
			ans+=arr[ind];
			ind-=(ind&-ind);
		}
		return ans;
	}
};
bit sum;



vector<int> ans;
vector<pair<int,int> > Q;
vector<tuple<int,int,int,int> > T;

void do_stuff(int l,int r,int v){
	for(int i=l;i<=r;i++){
		sum.add(get<0>(T[i]),v*get<3>(T[i]));	
		sum.add(get<1>(T[i])+1,-v*get<3>(T[i]));	
	}
}


void total_bs(vector<int> &q,int l,int r){
	if(l==r){
		for(auto i : q) ans[i]=get<2>(T[l]);
		return;
	}
	int m = (l+r)/2;
	do_stuff(l,m,1);
	vector<int> L;
	vector<int> R;
	for(auto i : q){
		if(sum.query(Q[i].first)<Q[i].second) R.push_back(i);
		else L.push_back(i);
	}
	vector<int>().swap(q);
	total_bs(R,m+1,r);
	do_stuff(l,m,-1);
	total_bs(L,l,m);
}


signed main(){
	ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int n,m,q;cin>>n>>m>>q;
	seg.init(n);
	seg.built(1,1,n);
	int cnt = 0;
	bit inpeople;
	inpeople.init(n);
	sum.init(n);
	vector<int> ask;
	while(q--){
		int t;cin>>t;
		if(t==1){
			int l,r,c,k;cin>>l>>r>>c>>k;
			seg.Radd(1,l,r,1,n,k);
			inpeople.add(l,k);
			inpeople.add(r+1,-k);
			T.push_back({l,r,c,k});
		}
		if(t==2){
			int l,r,k;cin>>l>>r>>k;
			seg.Radd(1,l,r,1,n,-k);
			seg.Rchmax(1,l,r,1,n,0);
		}
		if(t==3){
			int a,b;cin>>a>>b;	
			int g = seg.query(1,a,1,n);
			ans.push_back(0);
			if(g>=b){
				int k = inpeople.query(a)-g+b;
				Q.push_back({a,k});
				ask.push_back(cnt);
			}else{
				Q.push_back({0,0});
			}
			cnt++;
		}
	}
	
	total_bs(ask,0,T.size()-1);
	for(auto i : ans) cout<<i<<"\n";
	return 0;
}

// segment tree beats + parellal binary search

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 604 KB Output is correct
2 Correct 3 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 2 ms 860 KB Output is correct
9 Correct 3 ms 788 KB Output is correct
10 Correct 2 ms 860 KB Output is correct
11 Correct 3 ms 860 KB Output is correct
12 Correct 3 ms 860 KB Output is correct
13 Correct 1 ms 724 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 2 ms 600 KB Output is correct
16 Correct 2 ms 860 KB Output is correct
17 Correct 2 ms 764 KB Output is correct
18 Correct 3 ms 860 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 3 ms 1116 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 604 KB Output is correct
2 Correct 3 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 2 ms 860 KB Output is correct
9 Correct 3 ms 788 KB Output is correct
10 Correct 2 ms 860 KB Output is correct
11 Correct 3 ms 860 KB Output is correct
12 Correct 3 ms 860 KB Output is correct
13 Correct 1 ms 724 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 2 ms 600 KB Output is correct
16 Correct 2 ms 860 KB Output is correct
17 Correct 2 ms 764 KB Output is correct
18 Correct 3 ms 860 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 3 ms 1116 KB Output is correct
21 Correct 3 ms 860 KB Output is correct
22 Correct 3 ms 872 KB Output is correct
23 Correct 3 ms 604 KB Output is correct
24 Correct 3 ms 856 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 3 ms 860 KB Output is correct
28 Correct 3 ms 608 KB Output is correct
29 Correct 3 ms 824 KB Output is correct
30 Correct 3 ms 728 KB Output is correct
31 Correct 3 ms 860 KB Output is correct
32 Correct 3 ms 860 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 1 ms 860 KB Output is correct
35 Correct 2 ms 604 KB Output is correct
36 Correct 3 ms 856 KB Output is correct
37 Correct 2 ms 600 KB Output is correct
38 Correct 2 ms 860 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 88 ms 11628 KB Output is correct
2 Correct 98 ms 12320 KB Output is correct
3 Correct 90 ms 12360 KB Output is correct
4 Correct 95 ms 12236 KB Output is correct
5 Correct 96 ms 12360 KB Output is correct
6 Correct 96 ms 12356 KB Output is correct
7 Correct 16 ms 2844 KB Output is correct
8 Correct 17 ms 2648 KB Output is correct
9 Correct 92 ms 12972 KB Output is correct
10 Correct 93 ms 12112 KB Output is correct
11 Correct 89 ms 12112 KB Output is correct
12 Correct 94 ms 12224 KB Output is correct
13 Correct 75 ms 9672 KB Output is correct
14 Correct 94 ms 13868 KB Output is correct
15 Correct 87 ms 9968 KB Output is correct
16 Correct 92 ms 13036 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 477 ms 40504 KB Output is correct
2 Correct 400 ms 32560 KB Output is correct
3 Correct 498 ms 43912 KB Output is correct
4 Correct 336 ms 41552 KB Output is correct
5 Correct 328 ms 33728 KB Output is correct
6 Correct 461 ms 43588 KB Output is correct
7 Correct 73 ms 8084 KB Output is correct
8 Correct 82 ms 8640 KB Output is correct
9 Correct 400 ms 45108 KB Output is correct
10 Correct 412 ms 44472 KB Output is correct
11 Correct 464 ms 42372 KB Output is correct
12 Correct 456 ms 42016 KB Output is correct
13 Correct 455 ms 43016 KB Output is correct
14 Correct 501 ms 42536 KB Output is correct
15 Correct 552 ms 42848 KB Output is correct
16 Correct 554 ms 43008 KB Output is correct
17 Correct 545 ms 43920 KB Output is correct
18 Correct 492 ms 42620 KB Output is correct
19 Correct 513 ms 43872 KB Output is correct
20 Correct 519 ms 43516 KB Output is correct
21 Correct 551 ms 42208 KB Output is correct
22 Correct 551 ms 42560 KB Output is correct
23 Correct 525 ms 43864 KB Output is correct
24 Correct 541 ms 42564 KB Output is correct
25 Correct 371 ms 36536 KB Output is correct
26 Correct 380 ms 43204 KB Output is correct
27 Correct 399 ms 45016 KB Output is correct

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 604 KB Output is correct
2 Correct 3 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 2 ms 860 KB Output is correct
9 Correct 3 ms 788 KB Output is correct
10 Correct 2 ms 860 KB Output is correct
11 Correct 3 ms 860 KB Output is correct
12 Correct 3 ms 860 KB Output is correct
13 Correct 1 ms 724 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 2 ms 600 KB Output is correct
16 Correct 2 ms 860 KB Output is correct
17 Correct 2 ms 764 KB Output is correct
18 Correct 3 ms 860 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 3 ms 1116 KB Output is correct
21 Correct 88 ms 11628 KB Output is correct
22 Correct 98 ms 12320 KB Output is correct
23 Correct 90 ms 12360 KB Output is correct
24 Correct 95 ms 12236 KB Output is correct
25 Correct 96 ms 12360 KB Output is correct
26 Correct 96 ms 12356 KB Output is correct
27 Correct 16 ms 2844 KB Output is correct
28 Correct 17 ms 2648 KB Output is correct
29 Correct 92 ms 12972 KB Output is correct
30 Correct 93 ms 12112 KB Output is correct
31 Correct 89 ms 12112 KB Output is correct
32 Correct 94 ms 12224 KB Output is correct
33 Correct 75 ms 9672 KB Output is correct
34 Correct 94 ms 13868 KB Output is correct
35 Correct 87 ms 9968 KB Output is correct
36 Correct 92 ms 13036 KB Output is correct
37 Correct 92 ms 11312 KB Output is correct
38 Correct 71 ms 11124 KB Output is correct
39 Correct 14 ms 2644 KB Output is correct
40 Correct 18 ms 2648 KB Output is correct
41 Correct 92 ms 12324 KB Output is correct
42 Correct 92 ms 12312 KB Output is correct
43 Correct 117 ms 12216 KB Output is correct
44 Correct 109 ms 12284 KB Output is correct
45 Correct 95 ms 12240 KB Output is correct
46 Correct 115 ms 12072 KB Output is correct
47 Correct 34 ms 12228 KB Output is correct
48 Correct 89 ms 12876 KB Output is correct
49 Correct 97 ms 9176 KB Output is correct
50 Correct 125 ms 11832 KB Output is correct
51 Correct 140 ms 12156 KB Output is correct
52 Correct 141 ms 12232 KB Output is correct
53 Correct 72 ms 11556 KB Output is correct
54 Correct 93 ms 12872 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 70 ms 11344 KB Output is correct
2 Correct 80 ms 12480 KB Output is correct
3 Correct 83 ms 13920 KB Output is correct
4 Correct 56 ms 12244 KB Output is correct
5 Correct 70 ms 12792 KB Output is correct
6 Correct 80 ms 13724 KB Output is correct
7 Correct 22 ms 3848 KB Output is correct
8 Correct 22 ms 3648 KB Output is correct
9 Correct 49 ms 13640 KB Output is correct
10 Correct 51 ms 11616 KB Output is correct
11 Correct 74 ms 13632 KB Output is correct
12 Correct 72 ms 13820 KB Output is correct

Subtask #7
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 604 KB Output is correct
2 Correct 3 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 2 ms 860 KB Output is correct
9 Correct 3 ms 788 KB Output is correct
10 Correct 2 ms 860 KB Output is correct
11 Correct 3 ms 860 KB Output is correct
12 Correct 3 ms 860 KB Output is correct
13 Correct 1 ms 724 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 2 ms 600 KB Output is correct
16 Correct 2 ms 860 KB Output is correct
17 Correct 2 ms 764 KB Output is correct
18 Correct 3 ms 860 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 3 ms 1116 KB Output is correct
21 Correct 3 ms 860 KB Output is correct
22 Correct 3 ms 872 KB Output is correct
23 Correct 3 ms 604 KB Output is correct
24 Correct 3 ms 856 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 3 ms 860 KB Output is correct
28 Correct 3 ms 608 KB Output is correct
29 Correct 3 ms 824 KB Output is correct
30 Correct 3 ms 728 KB Output is correct
31 Correct 3 ms 860 KB Output is correct
32 Correct 3 ms 860 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 1 ms 860 KB Output is correct
35 Correct 2 ms 604 KB Output is correct
36 Correct 3 ms 856 KB Output is correct
37 Correct 2 ms 600 KB Output is correct
38 Correct 2 ms 860 KB Output is correct
39 Correct 88 ms 11628 KB Output is correct
40 Correct 98 ms 12320 KB Output is correct
41 Correct 90 ms 12360 KB Output is correct
42 Correct 95 ms 12236 KB Output is correct
43 Correct 96 ms 12360 KB Output is correct
44 Correct 96 ms 12356 KB Output is correct
45 Correct 16 ms 2844 KB Output is correct
46 Correct 17 ms 2648 KB Output is correct
47 Correct 92 ms 12972 KB Output is correct
48 Correct 93 ms 12112 KB Output is correct
49 Correct 89 ms 12112 KB Output is correct
50 Correct 94 ms 12224 KB Output is correct
51 Correct 75 ms 9672 KB Output is correct
52 Correct 94 ms 13868 KB Output is correct
53 Correct 87 ms 9968 KB Output is correct
54 Correct 92 ms 13036 KB Output is correct
55 Correct 92 ms 11312 KB Output is correct
56 Correct 71 ms 11124 KB Output is correct
57 Correct 14 ms 2644 KB Output is correct
58 Correct 18 ms 2648 KB Output is correct
59 Correct 92 ms 12324 KB Output is correct
60 Correct 92 ms 12312 KB Output is correct
61 Correct 117 ms 12216 KB Output is correct
62 Correct 109 ms 12284 KB Output is correct
63 Correct 95 ms 12240 KB Output is correct
64 Correct 115 ms 12072 KB Output is correct
65 Correct 34 ms 12228 KB Output is correct
66 Correct 89 ms 12876 KB Output is correct
67 Correct 97 ms 9176 KB Output is correct
68 Correct 125 ms 11832 KB Output is correct
69 Correct 140 ms 12156 KB Output is correct
70 Correct 141 ms 12232 KB Output is correct
71 Correct 72 ms 11556 KB Output is correct
72 Correct 93 ms 12872 KB Output is correct
73 Correct 70 ms 11344 KB Output is correct
74 Correct 80 ms 12480 KB Output is correct
75 Correct 83 ms 13920 KB Output is correct
76 Correct 56 ms 12244 KB Output is correct
77 Correct 70 ms 12792 KB Output is correct
78 Correct 80 ms 13724 KB Output is correct
79 Correct 22 ms 3848 KB Output is correct
80 Correct 22 ms 3648 KB Output is correct
81 Correct 49 ms 13640 KB Output is correct
82 Correct 51 ms 11616 KB Output is correct
83 Correct 74 ms 13632 KB Output is correct
84 Correct 72 ms 13820 KB Output is correct
85 Correct 102 ms 11052 KB Output is correct
86 Correct 99 ms 12988 KB Output is correct
87 Correct 82 ms 12048 KB Output is correct
88 Correct 91 ms 12876 KB Output is correct
89 Correct 63 ms 9772 KB Output is correct
90 Correct 101 ms 12784 KB Output is correct
91 Correct 84 ms 9292 KB Output is correct
92 Correct 84 ms 9548 KB Output is correct
93 Correct 103 ms 12744 KB Output is correct
94 Correct 105 ms 13152 KB Output is correct
95 Correct 90 ms 11852 KB Output is correct
96 Correct 99 ms 12620 KB Output is correct
97 Correct 121 ms 12664 KB Output is correct
98 Correct 92 ms 9804 KB Output is correct
99 Correct 37 ms 13248 KB Output is correct
100 Correct 69 ms 11212 KB Output is correct
101 Correct 84 ms 12632 KB Output is correct
102 Correct 87 ms 13260 KB Output is correct

Subtask #8
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 604 KB Output is correct
2 Correct 3 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 2 ms 860 KB Output is correct
9 Correct 3 ms 788 KB Output is correct
10 Correct 2 ms 860 KB Output is correct
11 Correct 3 ms 860 KB Output is correct
12 Correct 3 ms 860 KB Output is correct
13 Correct 1 ms 724 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 2 ms 600 KB Output is correct
16 Correct 2 ms 860 KB Output is correct
17 Correct 2 ms 764 KB Output is correct
18 Correct 3 ms 860 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 3 ms 1116 KB Output is correct
21 Correct 3 ms 860 KB Output is correct
22 Correct 3 ms 872 KB Output is correct
23 Correct 3 ms 604 KB Output is correct
24 Correct 3 ms 856 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 3 ms 860 KB Output is correct
28 Correct 3 ms 608 KB Output is correct
29 Correct 3 ms 824 KB Output is correct
30 Correct 3 ms 728 KB Output is correct
31 Correct 3 ms 860 KB Output is correct
32 Correct 3 ms 860 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 1 ms 860 KB Output is correct
35 Correct 2 ms 604 KB Output is correct
36 Correct 3 ms 856 KB Output is correct
37 Correct 2 ms 600 KB Output is correct
38 Correct 2 ms 860 KB Output is correct
39 Correct 88 ms 11628 KB Output is correct
40 Correct 98 ms 12320 KB Output is correct
41 Correct 90 ms 12360 KB Output is correct
42 Correct 95 ms 12236 KB Output is correct
43 Correct 96 ms 12360 KB Output is correct
44 Correct 96 ms 12356 KB Output is correct
45 Correct 16 ms 2844 KB Output is correct
46 Correct 17 ms 2648 KB Output is correct
47 Correct 92 ms 12972 KB Output is correct
48 Correct 93 ms 12112 KB Output is correct
49 Correct 89 ms 12112 KB Output is correct
50 Correct 94 ms 12224 KB Output is correct
51 Correct 75 ms 9672 KB Output is correct
52 Correct 94 ms 13868 KB Output is correct
53 Correct 87 ms 9968 KB Output is correct
54 Correct 92 ms 13036 KB Output is correct
55 Correct 477 ms 40504 KB Output is correct
56 Correct 400 ms 32560 KB Output is correct
57 Correct 498 ms 43912 KB Output is correct
58 Correct 336 ms 41552 KB Output is correct
59 Correct 328 ms 33728 KB Output is correct
60 Correct 461 ms 43588 KB Output is correct
61 Correct 73 ms 8084 KB Output is correct
62 Correct 82 ms 8640 KB Output is correct
63 Correct 400 ms 45108 KB Output is correct
64 Correct 412 ms 44472 KB Output is correct
65 Correct 464 ms 42372 KB Output is correct
66 Correct 456 ms 42016 KB Output is correct
67 Correct 455 ms 43016 KB Output is correct
68 Correct 501 ms 42536 KB Output is correct
69 Correct 552 ms 42848 KB Output is correct
70 Correct 554 ms 43008 KB Output is correct
71 Correct 545 ms 43920 KB Output is correct
72 Correct 492 ms 42620 KB Output is correct
73 Correct 513 ms 43872 KB Output is correct
74 Correct 519 ms 43516 KB Output is correct
75 Correct 551 ms 42208 KB Output is correct
76 Correct 551 ms 42560 KB Output is correct
77 Correct 525 ms 43864 KB Output is correct
78 Correct 541 ms 42564 KB Output is correct
79 Correct 371 ms 36536 KB Output is correct
80 Correct 380 ms 43204 KB Output is correct
81 Correct 399 ms 45016 KB Output is correct
82 Correct 92 ms 11312 KB Output is correct
83 Correct 71 ms 11124 KB Output is correct
84 Correct 14 ms 2644 KB Output is correct
85 Correct 18 ms 2648 KB Output is correct
86 Correct 92 ms 12324 KB Output is correct
87 Correct 92 ms 12312 KB Output is correct
88 Correct 117 ms 12216 KB Output is correct
89 Correct 109 ms 12284 KB Output is correct
90 Correct 95 ms 12240 KB Output is correct
91 Correct 115 ms 12072 KB Output is correct
92 Correct 34 ms 12228 KB Output is correct
93 Correct 89 ms 12876 KB Output is correct
94 Correct 97 ms 9176 KB Output is correct
95 Correct 125 ms 11832 KB Output is correct
96 Correct 140 ms 12156 KB Output is correct
97 Correct 141 ms 12232 KB Output is correct
98 Correct 72 ms 11556 KB Output is correct
99 Correct 93 ms 12872 KB Output is correct
100 Correct 70 ms 11344 KB Output is correct
101 Correct 80 ms 12480 KB Output is correct
102 Correct 83 ms 13920 KB Output is correct
103 Correct 56 ms 12244 KB Output is correct
104 Correct 70 ms 12792 KB Output is correct
105 Correct 80 ms 13724 KB Output is correct
106 Correct 22 ms 3848 KB Output is correct
107 Correct 22 ms 3648 KB Output is correct
108 Correct 49 ms 13640 KB Output is correct
109 Correct 51 ms 11616 KB Output is correct
110 Correct 74 ms 13632 KB Output is correct
111 Correct 72 ms 13820 KB Output is correct
112 Correct 102 ms 11052 KB Output is correct
113 Correct 99 ms 12988 KB Output is correct
114 Correct 82 ms 12048 KB Output is correct
115 Correct 91 ms 12876 KB Output is correct
116 Correct 63 ms 9772 KB Output is correct
117 Correct 101 ms 12784 KB Output is correct
118 Correct 84 ms 9292 KB Output is correct
119 Correct 84 ms 9548 KB Output is correct
120 Correct 103 ms 12744 KB Output is correct
121 Correct 105 ms 13152 KB Output is correct
122 Correct 90 ms 11852 KB Output is correct
123 Correct 99 ms 12620 KB Output is correct
124 Correct 121 ms 12664 KB Output is correct
125 Correct 92 ms 9804 KB Output is correct
126 Correct 37 ms 13248 KB Output is correct
127 Correct 69 ms 11212 KB Output is correct
128 Correct 84 ms 12632 KB Output is correct
129 Correct 87 ms 13260 KB Output is correct
130 Correct 501 ms 47964 KB Output is correct
131 Correct 377 ms 36168 KB Output is correct
132 Correct 595 ms 48264 KB Output is correct
133 Correct 453 ms 47708 KB Output is correct
134 Correct 411 ms 46348 KB Output is correct
135 Correct 472 ms 49660 KB Output is correct
136 Correct 432 ms 52992 KB Output is correct
137 Correct 420 ms 52664 KB Output is correct
138 Correct 469 ms 48288 KB Output is correct
139 Correct 476 ms 48496 KB Output is correct
140 Correct 536 ms 49412 KB Output is correct
141 Correct 492 ms 48960 KB Output is correct
142 Correct 509 ms 48600 KB Output is correct
143 Correct 564 ms 48240 KB Output is correct
144 Correct 499 ms 48364 KB Output is correct
145 Correct 511 ms 48376 KB Output is correct
146 Correct 549 ms 48132 KB Output is correct
147 Correct 611 ms 48256 KB Output is correct
148 Correct 563 ms 48752 KB Output is correct
149 Correct 551 ms 48304 KB Output is correct
150 Correct 202 ms 50200 KB Output is correct
151 Correct 409 ms 48072 KB Output is correct
152 Correct 390 ms 49560 KB Output is correct
153 Correct 410 ms 51236 KB Output is correct