CSES - Datatähti Open 2019 - Results
Submission details
Task:Binary tree
Sender:Diuven
Submission time:2019-01-18 06:01:55 +0200
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.01 s1details
#20.02 s1details
#30.01 s1details
#40.02 s1details
#50.01 s1details
#60.03 s1details
#70.02 s1details
#80.01 s1details
#90.02 s1details
#100.01 s1details
#110.02 s1details
#120.02 s1details
#130.01 s1details
#140.02 s1details
#150.03 s1details
#160.01 s1details
#170.01 s1details
#180.02 s1details
#190.02 s1details
#200.02 s1details
#210.02 s1details
#220.01 s1details
#230.03 s1details
#240.01 s1details
#250.01 s1details
#260.02 s1details
#270.02 s1details
#280.03 s1details
#290.03 s1details
#300.01 s1details
#310.02 s1details
#320.02 s1details
#330.02 s1details
#340.03 s1details
#350.01 s1details
#360.02 s2details
#370.02 s2details
#380.02 s2details
#390.01 s2details
#400.01 s2details
#410.02 s2details
#420.02 s2details
#430.02 s2details
#440.02 s2details
#450.02 s2details
#460.02 s3details
#470.02 s3details
#480.02 s3details
#490.03 s3details
#500.01 s3details
#510.02 s3details
#520.02 s3details
#530.02 s3details
#540.02 s3details
#550.06 s3details
#560.05 s3details
#570.05 s3details
#580.06 s3details
#590.06 s3details
#600.06 s3details
#610.05 s3details
#620.05 s3details
#630.05 s3details
#640.05 s3details
#650.05 s3details
#660.05 s3details
#670.03 s3details
#680.03 s3details
#690.01 s3details
#700.02 s3details
#710.01 s3details
#720.03 s3details
#730.02 s3details
#740.02 s3details
#750.01 s3details
#760.01 s3details
#770.02 s3details

Code

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

const int MX = 200010;
const int MOD = 1e9+7;
const int inf = 2e9;
const ll linf = 2e18;

int n, m;

struct{
	struct node {
		int l, r; ll idx, sum;
	} tree[MX*61];
	int bck, dep;
	
	void init(int d){
		dep = d, bck = 2;
		tree[0] = {0, 0, 0, 0};
		tree[1] = {0, 0, 1, 0};
	}

	int upt(int v, ll s, ll e, ll l, ll r, int idx){
		if(r<s || e<l) return v;

		if(v==0){
			v = bck++;
			tree[v] = {0, 0, idx, 0};
		}

		node &nd = tree[v];
		if(l<=s && e<=r){
			nd.sum = e-s+1;
			return v;
		}

		nd.l = upt(nd.l, s, (s+e)/2, l, r, idx*2);
		nd.r = upt(nd.r, (s+e)/2+1, e, l, r, idx*2+1);
		nd.sum = tree[nd.l].sum + tree[nd.r].sum;
		return v;
	}
	void upt(ll idx){
		ll k = (1<<(dep-1));
		ll l = idx, r = idx;
		while(l<k) l<<=1;
		while(r<k) r = r*2+1;

		upt(1, 0, k-1, l-k, r-k, 1);
	}

	ll sum(int v, ll s, ll e, ll l, ll r){
		if(r<s || e<l) return 0;
		node &nd = tree[v];
		if(l<=s && e<=r) return tree[v].sum;
		return sum(nd.l, s, (s+e)/2, l, r) + sum(nd.r, (s+e)/2+1, e, l, r);
	}

	ll sum(ll l, ll r){
		ll k = (1<<(dep-1));
		return sum(1, 0, k-1, l, r);
	}
} Seg;

int main(){
	ios::sync_with_stdio(0), cin.tie(0);
	cin>>n>>m;

	Seg.init(n);

	for(int i=1; i<=m; i++){
		ll k; cin>>k; Seg.upt(k);
	}
	ll k = 1<<(n-1);
	ll l = k/2 - Seg.sum(0, k/2-1), r = k/2 - Seg.sum(k/2, k-1);
	cout<<l<<' '<<r<<'\n';
	ll ans = l%MOD * r%MOD * 2 % MOD;

	cout<<ans<<'\n';

	return 0;
}

Test details

Test 1

Group: 1

Verdict:

input
4 3
10
5
13

correct output
12

user output
2 3
12

Test 2

Group: 1

Verdict:

input
2 0

correct output
2

user output
1 1
2

Test 3

Group: 1

Verdict:

input
2 1
2

correct output
0

user output
0 1
0

Test 4

Group: 1

Verdict:

input
2 1
3

correct output
0

user output
1 0
0

Test 5

Group: 1

Verdict:

input
2 2
2
3

correct output
0

user output
0 0
0

Test 6

Group: 1

Verdict:

input
6 0

correct output
512

user output
16 16
512

Test 7

Group: 1

Verdict:

input
6 1
29

correct output
448

user output
16 14
448

Test 8

Group: 1

Verdict:

input
6 1
63

correct output
480

user output
16 15
480

Test 9

Group: 1

Verdict:

input
6 10
50
63
56
5
...

correct output
132

user output
12 11
264

Test 10

Group: 1

Verdict:

input
6 10
25
57
62
42
...

correct output
162

user output
9 9
162

Test 11

Group: 1

Verdict:

input
6 10
14
26
34
42
...

correct output
126

user output
7 9
126

Test 12

Group: 1

Verdict:

input
6 10
21
60
23
59
...

correct output
128

user output
8 8
128

Test 13

Group: 1

Verdict:

input
6 10
8
30
32
16
...

correct output
0

user output
0 11
0

Test 14

Group: 1

Verdict:

input
6 20
46
39
55
24
...

correct output
48

user output
8 6
96

Test 15

Group: 1

Verdict:

input
6 25
36
23
27
33
...

correct output
4

user output
3 5
30

Test 16

Group: 1

Verdict:

input
6 62
42
11
4
61
...

correct output
0

user output
0 0
0

Test 17

Group: 1

Verdict:

input
6 32
62
38
57
35
...

correct output
0

user output
0 0
0

Test 18

Group: 1

Verdict:

input
6 21
38
51
47
35
...

correct output
60

user output
6 5
60

Test 19

Group: 1

Verdict:

input
6 31
59
15
3
26
...

correct output
0

user output
16 0
0

Test 20

Group: 1

Verdict:

input
6 14
13
53
55
26
...

correct output
256

user output
16 8
256

Test 21

Group: 1

Verdict:

input
5 10
5
17
21
7
...

correct output
6

user output
5 3
30

Test 22

Group: 1

Verdict:

input
6 5
38
18
31
44
...

correct output
312

user output
12 13
312

Test 23

Group: 1

Verdict:

input
3 0

correct output
8

user output
2 2
8

Test 24

Group: 1

Verdict:

input
3 1
2

correct output
0

user output
0 2
0

Test 25

Group: 1

Verdict:

input
3 1
3

correct output
0

user output
2 0
0

Test 26

Group: 1

Verdict:

input
3 2
4
6

correct output
2

user output
1 1
2

Test 27

Group: 1

Verdict:

input
3 2
4
7

correct output
2

user output
1 1
2

Test 28

Group: 1

Verdict:

input
3 2
5
6

correct output
2

user output
1 1
2

Test 29

Group: 1

Verdict:

input
3 2
5
7

correct output
2

user output
1 1
2

Test 30

Group: 1

Verdict:

input
3 2
3
6

correct output
0

user output
2 1
4

Test 31

Group: 1

Verdict:

input
3 3
4
5
6

correct output
0

user output
0 1
0

Test 32

Group: 1

Verdict:

input
3 3
4
6
7

correct output
0

user output
1 0
0

Test 33

Group: 1

Verdict:

input
3 4
4
5
6
7

correct output
0

user output
0 0
0

Test 34

Group: 1

Verdict:

input
5 0

correct output
128

user output
8 8
128

Test 35

Group: 1

Verdict:

input
5 1
14

correct output
96

user output
8 6
96

Test 36

Group: 2

Verdict:

input
2 0

correct output
2

user output
1 1
2

Test 37

Group: 2

Verdict:

input
3 0

correct output
8

user output
2 2
8

Test 38

Group: 2

Verdict:

input
4 0

correct output
32

user output
4 4
32

Test 39

Group: 2

Verdict:

input
23 0

correct output
92960636

user output
2097152 2097152
92960636

Test 40

Group: 2

Verdict:

input
36 0

correct output
635008130

user output
4 4
32

Test 41

Group: 2

Verdict:

input
42 0

correct output
993282280

user output
256 256
131072

Test 42

Group: 2

Verdict:

input
57 0

correct output
608377687

user output
8388608 8388608
487370169

Test 43

Group: 2

Verdict:

input
58 0

correct output
433510734

user output
16777216 16777216
949480669

Test 44

Group: 2

Verdict:

input
59 0

correct output
734042929

user output
33554432 33554432
797922655

Test 45

Group: 2

Verdict:

input
60 0

correct output
936171702

user output
67108864 67108864
191690599

Test 46

Group: 3

Verdict:

input
2 0

correct output
2

user output
1 1
2

Test 47

Group: 3

Verdict:

input
2 1
2

correct output
0

user output
0 1
0

Test 48

Group: 3

Verdict:

input
2 1
3

correct output
0

user output
1 0
0

Test 49

Group: 3

Verdict:

input
2 2
2
3

correct output
0

user output
0 0
0

Test 50

Group: 3

Verdict:

input
59 0

correct output
734042929

user output
33554432 33554432
797922655

Test 51

Group: 3

Verdict:

input
60 0

correct output
936171702

user output
67108864 67108864
191690599

Test 52

Group: 3

Verdict:

input
60 1
2

correct output
0

user output
0 67108864
0

Test 53

Group: 3

Verdict:

input
60 1
576460752303423487

correct output
399775198

user output
67108864 67108864
191690599

Test 54

Group: 3

Verdict:

input
60 1
1152921504606846975

correct output
667973450

user output
67108864 67108864
191690599

Test 55

Group: 3

Verdict:

input
60 100000
793144025126277478
493960657696318193
320344157019848454
997683950258055349
...

correct output
12813436

user output
67108864 67108864
191690599

Test 56

Group: 3

Verdict:

input
60 100000
986789393060040220
494066507202684187
290830182157570659
210871095549437400
...

correct output
95910570

user output
67108864 67108864
191690599

Test 57

Group: 3

Verdict:

input
60 100000
562299894758506682
731132428235172865
481500339045425690
208947005967360560
...

correct output
331624281

user output
67108864 67108864
191690599

Test 58

Group: 3

Verdict:

input
60 100000
257846911019866261
803021202233459674
658685893766403373
874237705485665885
...

correct output
880725152

user output
67108864 67108864
191690599

Test 59

Group: 3

Verdict:

input
60 100000
681388061028265547
990382999862855868
290694941402209648
491574111397234946
...

correct output
768320742

user output
67108864 67108864
191690599

Test 60

Group: 3

Verdict:

input
60 100000
816968727394104576
879176301780517486
1075817811951859004
632046213104404023
...

correct output
111155168

user output
67108864 67108864
191690599

Test 61

Group: 3

Verdict:

input
60 100000
406817930303406656
101704482575856800
406817930303412346
813635860606874021
...

correct output
295651662

user output
67108864 67108864
191690599

Test 62

Group: 3

Verdict:

input
59 100000
234885934259928845
244746379456935555
40048493361902167
530369614866009610
...

correct output
78892926

user output
33554432 33554432
797922655

Test 63

Group: 3

Verdict:

input
16 65534
26355
15205
3420
22822
...

correct output
0

user output
0 0
0

Test 64

Group: 3

Verdict:

input
60 99999
1030879879260090869
925369330408563145
403438777989811739
321883235203598800
...

correct output
596899803

user output
67108864 67108864
191690599

Test 65

Group: 3

Verdict:

input
60 100000
418885324976523921
418885324976523063
837770649953084829
104721331244134167
...

correct output
0

user output
67108856 67108864
117948782

Test 66

Group: 3

Verdict:

input
43 100000
5497882741157
4163319796881
3705445016042
8647080351851
...

correct output
317037701

user output
512 512
524288

Test 67

Group: 3

Verdict:

input
3 0

correct output
8

user output
2 2
8

Test 68

Group: 3

Verdict:

input
3 1
2

correct output
0

user output
0 2
0

Test 69

Group: 3

Verdict:

input
3 1
3

correct output
0

user output
2 0
0

Test 70

Group: 3

Verdict:

input
3 2
4
6

correct output
2

user output
1 1
2

Test 71

Group: 3

Verdict:

input
3 2
4
7

correct output
2

user output
1 1
2

Test 72

Group: 3

Verdict:

input
3 2
5
6

correct output
2

user output
1 1
2

Test 73

Group: 3

Verdict:

input
3 2
5
7

correct output
2

user output
1 1
2

Test 74

Group: 3

Verdict:

input
3 2
3
6

correct output
0

user output
2 1
4

Test 75

Group: 3

Verdict:

input
3 3
4
5
6

correct output
0

user output
0 1
0

Test 76

Group: 3

Verdict:

input
3 3
4
6
7

correct output
0

user output
1 0
0

Test 77

Group: 3

Verdict:

input
3 4
4
5
6
7

correct output
0

user output
0 0
0