CSES - BOI 2026 Mirror Day 2

Submission details
Task:	Sort
Sender:	frederikvase
Submission time:	2026-04-17 13:01:43 +0300
Language:	C++ (C++20)
Status:	READY
Result:	18

Feedback
subtask	verdict	score
#1	ACCEPTED	6
#2	ACCEPTED	5
#3	ACCEPTED	7
#4	TIME LIMIT EXCEEDED	0
#5	TIME LIMIT EXCEEDED	0
#6	TIME LIMIT EXCEEDED	0
#7	TIME LIMIT EXCEEDED	0

Test results
test	verdict	time	subtask
#1	ACCEPTED	0.00 s	2, 6, 7	details
#2	ACCEPTED	0.00 s	1, 2, 3, 6, 7	details
#3	ACCEPTED	0.00 s	2, 6, 7	details
#4	ACCEPTED	0.00 s	1, 2, 3, 6, 7	details
#5	ACCEPTED	0.00 s	1, 2, 3, 6, 7	details
#6	ACCEPTED	0.00 s	1, 2, 3, 6, 7	details
#7	ACCEPTED	0.00 s	1, 2, 3, 6, 7	details
#8	ACCEPTED	0.00 s	1, 2, 3, 6, 7	details
#9	ACCEPTED	0.00 s	1, 2, 3, 6, 7	details
#10	ACCEPTED	0.00 s	1, 2, 3, 6, 7	details
#11	ACCEPTED	0.00 s	2, 6, 7	details
#12	ACCEPTED	0.00 s	2, 6, 7	details
#13	ACCEPTED	0.00 s	2, 6, 7	details
#14	ACCEPTED	0.00 s	2, 6, 7	details
#15	ACCEPTED	0.00 s	2, 6, 7	details
#16	ACCEPTED	0.11 s	3, 7	details
#17	ACCEPTED	0.25 s	3, 7	details
#18	ACCEPTED	0.28 s	3, 7	details
#19	ACCEPTED	0.26 s	3, 7	details
#20	ACCEPTED	0.26 s	3, 7	details
#21	ACCEPTED	0.24 s	3, 7	details
#22	ACCEPTED	0.26 s	3, 7	details
#23	ACCEPTED	0.24 s	3, 7	details
#24	TIME LIMIT EXCEEDED	--	4, 7	details
#25	TIME LIMIT EXCEEDED	--	4, 7	details
#26	TIME LIMIT EXCEEDED	--	4, 7	details
#27	ACCEPTED	0.08 s	4, 7	details
#28	TIME LIMIT EXCEEDED	--	4, 7	details
#29	TIME LIMIT EXCEEDED	--	4, 7	details
#30	ACCEPTED	0.72 s	5, 6, 7	details
#31	TIME LIMIT EXCEEDED	--	5, 6, 7	details
#32	TIME LIMIT EXCEEDED	--	5, 6, 7	details
#33	TIME LIMIT EXCEEDED	--	5, 6, 7	details
#34	ACCEPTED	0.01 s	5, 6, 7	details
#35	TIME LIMIT EXCEEDED	--	5, 6, 7	details
#36	ACCEPTED	1.46 s	6, 7	details
#37	TIME LIMIT EXCEEDED	--	6, 7	details
#38	TIME LIMIT EXCEEDED	--	6, 7	details
#39	TIME LIMIT EXCEEDED	--	6, 7	details
#40	ACCEPTED	0.01 s	6, 7	details
#41	TIME LIMIT EXCEEDED	--	6, 7	details
#42	TIME LIMIT EXCEEDED	--	7	details
#43	TIME LIMIT EXCEEDED	--	7	details
#44	TIME LIMIT EXCEEDED	--	7	details
#45	TIME LIMIT EXCEEDED	--	7	details
#46	TIME LIMIT EXCEEDED	--	7	details
#47	TIME LIMIT EXCEEDED	--	7	details
#48	TIME LIMIT EXCEEDED	--	7	details
#49	ACCEPTED	0.20 s	7	details
#50	TIME LIMIT EXCEEDED	--	7	details
#51	TIME LIMIT EXCEEDED	--	7	details
#52	ACCEPTED	0.00 s	1, 2, 3, 5, 6, 7	details
#53	ACCEPTED	0.00 s	1, 2, 3, 4, 5, 6, 7	details
#54	ACCEPTED	0.00 s	2, 5, 6, 7	details
#55	ACCEPTED	0.00 s	1, 2, 3, 4, 6, 7	details
#56	ACCEPTED	0.00 s	1, 2, 3, 6, 7	details
#57	ACCEPTED	0.00 s	6, 7	details
#58	ACCEPTED	0.02 s	3, 4, 7	details
#59	ACCEPTED	0.02 s	3, 7	details
#60	ACCEPTED	0.00 s	2, 6, 7	details
#61	ACCEPTED	0.00 s	2, 6, 7	details
#62	ACCEPTED	0.00 s	2, 6, 7	details
#63	ACCEPTED	0.00 s	2, 6, 7	details
#64	ACCEPTED	0.00 s	2, 6, 7	details

Code

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

void imp() {
	cout << "-1\n";
}

signed main() {
	cin.tie(0)->sync_with_stdio(0);
	ll n, q;
	cin >> n >> q;

	vector<ll> x(n);
	set<ll> values;
	for (ll &e : x) cin >> e, values.insert(e);
	{
		map<ll, ll> mp;
		int t = 0;
		for (ll e : values) {
			mp[e] = t++;
		}
		for (ll &e : x) e = mp[e];
	}

	vector<ll> sorted = x;
	sort(begin(sorted), end(sorted));

	vector<ll> prefixinplace(n + 1);
	for (ll i = 0; i < n; i++) {
		prefixinplace[i + 1] = prefixinplace[i] + ll(x[i] == sorted[i]);
	}

	vector<ll> prefixmax(n), suffixmin(n);
	prefixmax[0] = x[0];
	for (ll i = 1; i < n; i++) {
		prefixmax[i] = max(x[i], prefixmax[i - 1]);
	}
	suffixmin[n - 1] = x[n - 1];
	for (ll i = n - 1; i--; ) {
		suffixmin[i] = min(x[i], suffixmin[i + 1]);
	}

	while (q--) {
		ll a, b;
		cin >> a >> b;

		if (prefixinplace[n] == n) {
			cout << "0\n";
			continue;
		} else if (a == n || b == n) {
			cout << "1\n";
			continue;
		}

		if (a + b <= n) {
			if (prefixinplace[n - b] - prefixinplace[a] != n - b - a || 
					prefixmax[a - 1] > suffixmin[n - b]) {
				imp();
				continue;
			}

			ll res = 2;
			if (prefixinplace[a] == a) res--;
			if (prefixinplace[n] - prefixinplace[n - b] == b) res--;
			cout << res << "\n";

			continue;
		}

		if (prefixinplace[n] - prefixinplace[a] == n - a ||
			prefixinplace[n - b] == n - b) {
			cout << "1\n";
			continue;
		}

		// Answer is at least 2
		ll overlap = a + b - n;

		ll ba = 0, bb = 0, bam = 0, bbm = 0;
		{
			map<int, int> freq;
			for (int i = 0; i < a; i++) {
				freq[sorted[i]]++;
			}
			for (int i = 0; i < a; i++) {
				if (freq[x[i]]) {
					freq[x[i]]--;
				} else {
					ba++;
					if (i >= n - b) bam++;
				}
			}
		}
		{
			map<int, int> freq;
			for (int i = n - b; i < n; i++) {
				freq[sorted[i]]++;
			}
			for (int i = n - 1; i >= n - b; i--) {
				if (freq[x[i]]) {
					freq[x[i]]--;
				} else {
					bb++;
					if (i < a) bbm++;
				}
			}
		}

		auto Sol = [](ll overlap, ll ba, ll bb, ll bam, ll bbm) -> ll {
			bb -= bbm;
			ba -= overlap;
			if (max(ba, bb) <= 0) return 2;
			ll lo = 1, hi = 5e5;
			while (lo < hi) {
				ll mid = lo + (hi - lo) / 2;
				ll nbb = bb - overlap * ((mid + 1) / 2);
				ll nba = ba - overlap * (mid / 2);
				if (max(nbb, nba) <= 0) {
					hi = mid;
				} else {
					lo = mid + 1;
				}
			}
			return 2 + lo;
		};

		ll res = min(Sol(overlap, ba, bb, bam, bbm), Sol(overlap, bb, ba, bbm, bam));
		cout << res << "\n";
	}
}

Test details

Test 1

Subtask: 2, 6, 7

Verdict: ACCEPTED

input
`6 3 3 1 4 1 5 9 4 1 3 3 2 5` view save

correct output
`1 -1 2` view save

user output
`1 -1 2` view save

Test 2

Subtask: 1, 2, 3, 6, 7

Verdict: ACCEPTED

input
`2 1 548813503 548813503 1 1` view save

correct output
`0` view save

user output
`0` view save

Test 3

Subtask: 2, 6, 7

Verdict: ACCEPTED

input
`1 1 417021999 1 1` view save

correct output
`0` view save

user output
`0` view save

Test 4

Subtask: 1, 2, 3, 6, 7

Verdict: ACCEPTED

input
`10 10 20751947 20751947 20751947 494...` view save

correct output
`-1 -1 1 1 -1 ...` view save

user output
`-1 -1 1 1 -1 ...` view save

Test 5

Subtask: 1, 2, 3, 6, 7

Verdict: ACCEPTED

input
`10 10 12780811 19475241 19475241 683...` view save

correct output
`0 0 0 0 0 ...` view save

user output
`0 0 0 0 0 ...` view save

Test 6

Subtask: 1, 2, 3, 6, 7

Verdict: ACCEPTED

input
`10 10 14574963 14574963 14574963 864...` view save

correct output
`0 0 0 0 0 ...` view save

user output
`0 0 0 0 0 ...` view save

Test 7

Subtask: 1, 2, 3, 6, 7

Verdict: ACCEPTED

input
`10 10 237541216 237541216 35036522 6...` view save

correct output
`-1 -1 -1 2 -1 ...` view save

user output
`-1 -1 -1 2 -1 ...` view save

Test 8

Subtask: 1, 2, 3, 6, 7

Verdict: ACCEPTED

input
`10 10 319425549 513116712 539199939 ...` view save

correct output
`-1 -1 -1 -1 -1 ...` view save

user output
`-1 -1 -1 -1 -1 ...` view save

Test 9

Subtask: 1, 2, 3, 6, 7

Verdict: ACCEPTED

input
`10 10 54363219 54363219 110986323 11...` view save

correct output
`0 0 0 0 0 ...` view save

user output
`0 0 0 0 0 ...` view save

Test 10

Subtask: 1, 2, 3, 6, 7

Verdict: ACCEPTED

input
`10 5 55687086 550701455 326656159 5...` view save

correct output
`-1 -1 -1 -1 -1` view save

user output
`-1 -1 -1 -1 -1` view save

Test 11

Subtask: 2, 6, 7

Verdict: ACCEPTED

input
`10 10 35889584 588130796 815837475 8...` view save

correct output
`-1 -1 1 1 1 ...` view save

user output
`-1 -1 1 1 1 ...` view save

Test 12

Subtask: 2, 6, 7

Verdict: ACCEPTED

input
`10 10 679842175 48724877 720966351 6...` view save

correct output
`2 3 2 1 1 ...` view save

user output
`2 3 2 1 1 ...` view save

Test 13

Subtask: 2, 6, 7

Verdict: ACCEPTED

input
`10 10 893310183 811950921 338863962 ...` view save

correct output
`2 1 1 2 5 ...` view save

user output
`2 1 1 2 5 ...` view save

Test 14

Subtask: 2, 6, 7

Verdict: ACCEPTED

input
`10 10 221045363 282395847 441913686 ...` view save

correct output
`0 0 0 0 0 ...` view save

user output
`0 0 0 0 0 ...` view save

Test 15

Subtask: 2, 6, 7

Verdict: ACCEPTED

input
`10 10 509019662 983949268 960017302 ...` view save

correct output
`3 -1 3 3 3 ...` view save

user output
`3 -1 3 3 3 ...` view save

Test 16

Subtask: 3, 7

Verdict: ACCEPTED

input
`200000 200000 2277053 2277053 2277053 227705...` view save

correct output
`-1 -1 -1 -1 -1 ...` view save

user output
`-1 -1 -1 -1 -1 ...` view save

Test 17

Subtask: 3, 7

Verdict: ACCEPTED

input
`200000 200000 6767 16596 16596 27202 37272 4...` view save

correct output
`-1 -1 -1 -1 -1 ...` view save

user output
`-1 -1 -1 -1 -1 ...` view save

Test 18

Subtask: 3, 7

Verdict: ACCEPTED

input
`200000 200000 5393 5910 9099 15755 15755 164...` view save

correct output
`-1 -1 -1 -1 -1 ...` view save

user output
`-1 -1 -1 -1 -1 ...` view save

Test 19

Subtask: 3, 7

Verdict: ACCEPTED

input
`200000 200000 3779 4629 8999 10468 22605 227...` view save

correct output
`-1 1 2 -1 -1 ...` view save

user output
`-1 1 2 -1 -1 ...` view save

Test 20

Subtask: 3, 7

Verdict: ACCEPTED

input
`200000 200000 878 2791 10849 11861 13405 239...` view save

correct output
`-1 -1 -1 -1 -1 ...` view save

user output
`-1 -1 -1 -1 -1 ...` view save

Test 21

Subtask: 3, 7

Verdict: ACCEPTED

input
`200000 200000 430 1479 1992 2829 7152 14093 ...` view save

correct output
`-1 -1 -1 -1 -1 ...` view save

user output
`-1 -1 -1 -1 -1 ...` view save

Test 22

Subtask: 3, 7

Verdict: ACCEPTED

input
`199997 200000 2733 10526 13882 14035 14689 3...` view save

correct output
`-1 -1 -1 -1 -1 ...` view save

user output
`-1 -1 -1 -1 -1 ...` view save

Test 23

Subtask: 3, 7

Verdict: ACCEPTED

input
`200000 200000 12345 13538 15407 18490 18984 ...` view save

correct output
`0 0 0 0 0 ...` view save

user output
`0 0 0 0 0 ...` view save

Test 24

Subtask: 4, 7

Verdict: TIME LIMIT EXCEEDED

input
`200000 200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`-1 1 -1 -1 -1 ...` view save

user output
(empty)

Test 25

Subtask: 4, 7

Verdict: TIME LIMIT EXCEEDED

input
`200000 200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`1 -1 1 -1 1 ...` view save

user output
(empty)

Test 26

Subtask: 4, 7

Verdict: TIME LIMIT EXCEEDED

input
`200000 200000 2 2 1 1 2 1 2 1 2 2 2 1 1 1 2 ...` view save

correct output
`4 3 2 2 6 ...` view save

user output
(empty)

Test 27

Subtask: 4, 7

Verdict: ACCEPTED

input
`200000 200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`0 0 0 0 0 ...` view save

user output
`0 0 0 0 0 ...` view save

Test 28

Subtask: 4, 7

Verdict: TIME LIMIT EXCEEDED

input
`200000 200000 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...` view save

correct output
`8513 1099 35939 9299 19597 ...` view save

user output
(empty)

Test 29

Subtask: 4, 7

Verdict: TIME LIMIT EXCEEDED

input
`200000 200000 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...` view save

correct output
`178345 169257 62115 96143 64796 ...` view save

user output
(empty)

Test 30

Subtask: 5, 6, 7

Verdict: ACCEPTED

input
`5000 5000 1 2 3 4 5 6 7 8 9 10 11 12 13 ...` view save

correct output
`1 1 -1 1 -1 ...` view save

user output
`1 1 -1 1 -1 ...` view save

Test 31

Subtask: 5, 6, 7

Verdict: TIME LIMIT EXCEEDED

input
`5000 5000 1 2 3 4 5 6 7 8 9 72 145 47 19...` view save

correct output
`-1 2 -1 2 -1 ...` view save

user output
(empty)

Test 32

Subtask: 5, 6, 7

Verdict: TIME LIMIT EXCEEDED

input
`4999 5000 1 2 3 4 5 6 7 8 9 10 11 12 13 ...` view save

correct output
`-1 2 -1 -1 -1 ...` view save

user output
(empty)

Test 33

Subtask: 5, 6, 7

Verdict: TIME LIMIT EXCEEDED

input
`5000 5000 4033 4368 3086 3208 4313 388 8...` view save

correct output
`3 3 3 3 11 ...` view save

user output
(empty)

Test 34

Subtask: 5, 6, 7

Verdict: ACCEPTED

input
`5000 5000 1 2 3 4 5 6 7 8 9 10 11 12 13 ...` view save

correct output
`0 0 0 0 0 ...` view save

user output
`0 0 0 0 0 ...` view save

Test 35

Subtask: 5, 6, 7

Verdict: TIME LIMIT EXCEEDED

input
`5000 5000 5000 4999 4998 4997 4996 4995 ...` view save

correct output
`2039 1910 -1 687 673 ...` view save

user output
(empty)

Test 36

Subtask: 6, 7

Verdict: ACCEPTED

input
`5000 5000 202010 457852 826471 926337 10...` view save

correct output
`-1 -1 2 -1 -1 ...` view save

user output
`-1 -1 2 -1 -1 ...` view save

Test 37

Subtask: 6, 7

Verdict: TIME LIMIT EXCEEDED

input
`5000 5000 190583 326486 431922 462939 72...` view save

correct output
`-1 -1 -1 -1 2 ...` view save

user output
(empty)

Test 38

Subtask: 6, 7

Verdict: TIME LIMIT EXCEEDED

input
`5000 5000 821998255 400550008 71790232 5...` view save

correct output
`5 3 3 2 5 ...` view save

user output
(empty)

Test 39

Subtask: 6, 7

Verdict: TIME LIMIT EXCEEDED

input
`5000 5000 266174928 446601941 191252234 ...` view save

correct output
`3 3 414 4 3 ...` view save

user output
(empty)

Test 40

Subtask: 6, 7

Verdict: ACCEPTED

input
`5000 5000 11621 243915 243915 949123 137...` view save

correct output
`0 0 0 0 0 ...` view save

user output
`0 0 0 0 0 ...` view save

Test 41

Subtask: 6, 7

Verdict: TIME LIMIT EXCEEDED

input
`5000 5000 999767052 998555066 997822810 ...` view save

correct output
`919 459 505 833 809 ...` view save

user output
(empty)

Test 42

Subtask: 7

Verdict: TIME LIMIT EXCEEDED

input
`200000 200000 478025 478025 478025 478025 47...` view save

correct output
`-1 -1 2 2 2 ...` view save

user output
(empty)

Test 43

Subtask: 7

Verdict: TIME LIMIT EXCEEDED

input
`200000 200000 1810 2088 3022 3097 7459 7943 ...` view save

correct output
`2 -1 -1 2 -1 ...` view save

user output
(empty)

Test 44

Subtask: 7

Verdict: TIME LIMIT EXCEEDED

input
`199531 200000 11328 26391 30353 37063 44412 ...` view save

correct output
`-1 2 -1 2 2 ...` view save

user output
(empty)

Test 45

Subtask: 7

Verdict: TIME LIMIT EXCEEDED

input
`200000 200000 106738201 369187074 412614650 ...` view save

correct output
`2 12 3 19 3 ...` view save

user output
(empty)

Test 46

Subtask: 7

Verdict: TIME LIMIT EXCEEDED

input
`200000 200000 670611290 43427363 8475380 309...` view save

correct output
`3 5 3 3 3 ...` view save

user output
(empty)

Test 47

Subtask: 7

Verdict: TIME LIMIT EXCEEDED

input
`200000 200000 907542569 504758282 948727805 ...` view save

correct output
`3 33 3 3 3 ...` view save

user output
(empty)

Test 48

Subtask: 7

Verdict: TIME LIMIT EXCEEDED

input
`200000 200000 487056731 460461648 142698485 ...` view save

correct output
`3 3 3 3 3 ...` view save

user output
(empty)

Test 49

Subtask: 7

Verdict: ACCEPTED

input
`200000 200000 12772 23236 23236 23236 41149 ...` view save

correct output
`0 0 0 0 0 ...` view save

user output
`0 0 0 0 0 ...` view save

Test 50

Subtask: 7

Verdict: TIME LIMIT EXCEEDED

input
`200000 200000 999993539 999993361 999993361 ...` view save

correct output
`125375 16687 -1 84781 46147 ...` view save

user output
(empty)

Test 51

Subtask: 7

Verdict: TIME LIMIT EXCEEDED

input
`200000 200000 999993539 999993361 999993361 ...` view save

correct output
`94788 177608 95881 56377 179957 ...` view save

user output
(empty)

Test 52

Subtask: 1, 2, 3, 5, 6, 7

Verdict: ACCEPTED

input
`5 1 2 1 3 5 4 2 2` view save

correct output
`2` view save

user output
`2` view save

Test 53

Subtask: 1, 2, 3, 4, 5, 6, 7

Verdict: ACCEPTED

input
`2 1 1 2 1 1` view save

correct output
`0` view save

user output
`0` view save

Test 54

Subtask: 2, 5, 6, 7

Verdict: ACCEPTED

input
`4 1 2 1 4 3 3 2` view save

correct output
`2` view save

user output
`2` view save

Test 55

Subtask: 1, 2, 3, 4, 6, 7

Verdict: ACCEPTED

input
`10 10 1 1 1 1 2 2 1 1 2 2 7 1 2 6 4 5 ...` view save

correct output
`-1 1 -1 -1 -1 ...` view save

user output
`-1 1 -1 -1 -1 ...` view save

Test 56

Subtask: 1, 2, 3, 6, 7

Verdict: ACCEPTED

input
`10 10 181777772 181777772 181777772 ...` view save

correct output
`-1 -1 -1 -1 -1 ...` view save

user output
`-1 -1 -1 -1 -1 ...` view save

Test 57

Subtask: 6, 7

Verdict: ACCEPTED

input
`100 10 92800811 524548163 939127795 9...` view save

correct output
`-1 -1 3 -1 3 ...` view save

user output
`-1 -1 3 -1 3 ...` view save

Test 58

Subtask: 3, 4, 7

Verdict: ACCEPTED

input
`100 100000 2 2 2 1 2 2 2 2 1 2 1 1 1 2 2 ...` view save

correct output
`-1 -1 -1 -1 -1 ...` view save

user output
`-1 -1 -1 -1 -1 ...` view save

Test 59

Subtask: 3, 7

Verdict: ACCEPTED

input
`100 100000 172695325 172695325 172695325 ...` view save

correct output
`-1 -1 -1 -1 -1 ...` view save

user output
`-1 -1 -1 -1 -1 ...` view save

Test 60

Subtask: 2, 6, 7

Verdict: ACCEPTED

input
`4 10 869194539 239439572 968540665 ...` view save

correct output
`-1 2 -1 -1 -1 ...` view save

user output
`-1 2 -1 -1 -1 ...` view save

Test 61

Subtask: 2, 6, 7

Verdict: ACCEPTED

input
`10 10 55366041 112170735 112170735 5...` view save

correct output
`-1 -1 2 1 1 ...` view save

user output
`-1 -1 2 1 1 ...` view save

Test 62

Subtask: 2, 6, 7

Verdict: ACCEPTED

input
`10 10 156018639 156018639 445832758 ...` view save

correct output
`-1 1 -1 -1 2 ...` view save

user output
`-1 1 -1 -1 2 ...` view save

Test 63

Subtask: 2, 6, 7

Verdict: ACCEPTED

input
`10 10 702507512 702507512 892090406 ...` view save

correct output
`-1 2 -1 2 2 ...` view save

user output
`-1 2 -1 2 2 ...` view save

Test 64

Subtask: 2, 6, 7

Verdict: ACCEPTED

input
`10 10 720324490 720324490 720324490 ...` view save

correct output
`-1 2 2 1 -1 ...` view save

user output
`-1 2 2 1 -1 ...` view save

BOI 2026 Mirror Day 2

Sort

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Test 22

Test 23

Test 24

Test 25

Test 26

Test 27

Test 28

Test 29

Test 30

Test 31

Test 32

Test 33

Test 34

Test 35

Test 36

Test 37

Test 38

Test 39

Test 40

Test 41

Test 42

Test 43

Test 44

Test 45

Test 46

Test 47

Test 48

Test 49

Test 50

Test 51

Test 52

Test 53

Test 54

Test 55

Test 56

Test 57

Test 58

Test 59

Test 60

Test 61

Test 62

Test 63

Test 64

Tasks

Submissions (frederikvase)