CSES - Datatähti 2017 loppu

Submission details
Task:	Mex-luku
Sender:	mangolassi
Submission time:	2017-01-19 12:51:23 +0200
Language:	C++
Status:	READY
Result:	100

Feedback
group	verdict	score
#1	ACCEPTED	28
#2	ACCEPTED	72

Test results
test	verdict	time	group
#1	ACCEPTED	0.04 s	1	details
#2	ACCEPTED	0.05 s	1	details
#3	ACCEPTED	0.04 s	1	details
#4	ACCEPTED	0.04 s	1	details
#5	ACCEPTED	0.03 s	1	details
#6	ACCEPTED	0.05 s	1	details
#7	ACCEPTED	0.04 s	1	details
#8	ACCEPTED	0.04 s	1	details
#9	ACCEPTED	0.03 s	1	details
#10	ACCEPTED	0.03 s	1	details
#11	ACCEPTED	0.07 s	2	details
#12	ACCEPTED	0.07 s	2	details
#13	ACCEPTED	0.07 s	2	details
#14	ACCEPTED	0.08 s	2	details
#15	ACCEPTED	0.08 s	2	details
#16	ACCEPTED	0.07 s	2	details
#17	ACCEPTED	0.07 s	2	details
#18	ACCEPTED	0.07 s	2	details
#19	ACCEPTED	0.07 s	2	details
#20	ACCEPTED	0.07 s	2	details

Code

#include <iostream>

struct BIT {
	int* sum;
	int n;

	BIT(int size) {
		n = size;
		sum = new int[n+1];
		for (int i = 1; i < n+1; ++i) {
			sum[i] = 0;
		}
	}

	void change(int i, int c) {
		++i;
		while(i <= n) {
			sum[i] += c;
			i += (i & -i);
		}
	}

	int get(int i) {
		++i;
		int res = 0;
		while(i > 0) {
			res += sum[i];
			i -= (i & -i);
		}
		return res;
	}		
};

const int N = 100000;
int amount [N];
int nums   [N];

int main() {
	std::ios_base::sync_with_stdio(false);
	std::cin.tie(0);

	int n, k;
	std::cin >> n >> k;
	for (int i = 0; i < n; ++i) {
		std::cin >> nums[i];
	}
	for (int i = 0; i < k + 1; ++i) {
		amount[i] = 0;
	}
	BIT tree (k + 10);
	for (int i = 0; i < k; ++i) {
		if (nums[i] <= k) {
			if (! amount[nums[i]]) {
				tree.change(nums[i], 1);
			}
			++amount[nums[i]];
		}
	}
	for (int i = 0; i + k < n; ++i) {
		//tree.print();
		int low = 0;
		int high = k+1;
		while(low != high) {
			int mid = (low + high) / 2;
			if (tree.get(mid) > mid) {
				low = mid + 1;
			} else {
				high = mid;
			}
		}
		std::cout << low << " ";

		int leaver = nums[i];
		if (leaver <= k) {
			--(amount[leaver]);
			if (amount[leaver] == 0) {
				tree.change(leaver, -1);
			}
		}
		int joiner = nums[i + k];
		if (joiner <= k) {
			++(amount[joiner]);
			if (amount[joiner] == 1) {
				tree.change(joiner, 1);
			}
		}	
	}
	int low = 0;
	int high = k+1;
	while(low != high) {
		int mid = (low + high) / 2;
		if (tree.get(mid) > mid) {
			low = mid + 1;
		} else {
			high = mid;
		}
	}
	std::cout << low << "\n";
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
`100 10 1000000000 9 1 0 5 7 2 8 6 3 4...` view save

correct output
`4 10 9 1 1 1 1 1 1 1 1 4 10 3 ...` view save

user output
`4 10 9 1 1 1 1 1 1 1 1 4 10 3 ...` view save

Test 2

Group: 1

Verdict: ACCEPTED

input
`100 10 1000000000 4 3 8 1 0 9 5 7 2 6...` view save

correct output
`6 10 4 3 3 1 1 1 1 1 3 3 10 6 ...` view save

user output
`6 10 4 3 3 1 1 1 1 1 3 3 10 6 ...` view save

Test 3

Group: 1

Verdict: ACCEPTED

input
`100 10 1000000000 9 2 3 1 0 8 5 6 4 7...` view save

correct output
`7 10 9 2 2 1 0 1 1 1 2 9 10 4 ...` view save

user output
`7 10 9 2 2 1 0 1 1 1 2 9 10 4 ...` view save

Test 4

Group: 1

Verdict: ACCEPTED

input
`100 10 1000000000 3 0 4 6 5 7 1 2 8 9...` view save

correct output
`9 10 3 0 0 0 0 0 4 2 2 2 10 6 ...` view save

user output
`9 10 3 0 0 0 0 0 4 2 2 2 10 6 ...` view save

Test 5

Group: 1

Verdict: ACCEPTED

input
`100 10 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 ...` view save

correct output
`10 10 10 10 10 10 10 10 10 10 ...` view save

user output
`10 10 10 10 10 10 10 10 10 10 ...` view save

Test 6

Group: 1

Verdict: ACCEPTED

input
`100 10 1000000000 0 5 1 9 3 4 6 7 2 8...` view save

correct output
`8 10 0 5 1 1 1 1 1 5 2 5 10 0 ...` view save

user output
`8 10 0 5 1 1 1 1 1 5 2 5 10 0 ...` view save

Test 7

Group: 1

Verdict: ACCEPTED

input
`100 10 1000000000 1 2 9 3 8 0 4 7 5 6...` view save

correct output
`6 10 1 1 1 1 2 0 0 2 3 9 10 6 ...` view save

user output
`6 10 1 1 1 1 2 0 0 2 3 9 10 6 ...` view save

Test 8

Group: 1

Verdict: ACCEPTED

input
`100 10 1000000000 5 0 6 7 1 4 8 3 9 2...` view save

correct output
`2 10 5 0 0 0 0 0 0 0 0 1 10 9 ...` view save

user output
`2 10 5 0 0 0 0 0 0 0 0 1 10 9 ...` view save

Test 9

Group: 1

Verdict: ACCEPTED

input
`100 10 1000000000 7 3 0 1 4 9 2 5 6 8...` view save

correct output
`8 10 7 3 0 0 0 0 7 5 5 5 10 8 ...` view save

user output
`8 10 7 3 0 0 0 0 7 5 5 5 10 8 ...` view save

Test 10

Group: 1

Verdict: ACCEPTED

input
`100 10 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 ...` view save

correct output
`10 10 10 10 10 10 10 10 10 10 ...` view save

user output
`10 10 10 10 10 10 10 10 10 10 ...` view save

Test 11

Group: 2

Verdict: ACCEPTED

input
`100000 10000 1000000000 4786 3512 3285 1919...` view save

correct output
`9547 10000 4786 3512 3285 1919...` view save

user output
`9547 10000 4786 3512 3285 1919...` view save

Test 12

Group: 2

Verdict: ACCEPTED

input
`100000 10000 1000000000 7981 3955 790 45 34...` view save

correct output
`7657 10000 7981 3955 790 45 45...` view save

user output
`7657 10000 7981 3955 790 45 45...` view save

Test 13

Group: 2

Verdict: ACCEPTED

input
`100000 10000 1000000000 2329 1825 9435 3800...` view save

correct output
`5701 10000 2329 1825 1825 1825...` view save

user output
`5701 10000 2329 1825 1825 1825...` view save

Test 14

Group: 2

Verdict: ACCEPTED

input
`100000 10000 1000000000 2754 6029 8007 6286...` view save

correct output
`1423 10000 2754 2754 2754 2754...` view save

user output
`1423 10000 2754 2754 2754 2754...` view save

Test 15

Group: 2

Verdict: ACCEPTED

input
`100000 10000 0 1 2 3 4 5 6 7 8 9 10 11 12 1...` view save

correct output
`10000 10000 10000 10000 10000 ...` view save

user output
`10000 10000 10000 10000 10000 ...` view save

Test 16

Group: 2

Verdict: ACCEPTED

input
`100000 10000 1000000000 7560 4634 7044 3853...` view save

correct output
`9855 10000 7560 4634 4634 3853...` view save

user output
`9855 10000 7560 4634 4634 3853...` view save

Test 17

Group: 2

Verdict: ACCEPTED

input
`100000 10000 1000000000 7945 6674 3975 3002...` view save

correct output
`6373 10000 7945 6674 3975 3002...` view save

user output
`6373 10000 7945 6674 3975 3002...` view save

Test 18

Group: 2

Verdict: ACCEPTED

input
`100000 10000 1000000000 2506 6827 6871 8593...` view save

correct output
`2978 10000 2506 2506 2506 2506...` view save

user output
`2978 10000 2506 2506 2506 2506...` view save

Test 19

Group: 2

Verdict: ACCEPTED

input
`100000 10000 1000000000 2769 5036 539 4409 ...` view save

correct output
`2249 10000 2769 2769 539 539 5...` view save

user output
`2249 10000 2769 2769 539 539 5...` view save

Test 20

Group: 2

Verdict: ACCEPTED

input
`100000 10000 0 1 2 3 4 5 6 7 8 9 10 11 12 1...` view save

correct output
`10000 10000 10000 10000 10000 ...` view save

user output
`10000 10000 10000 10000 10000 ...` view save

Datatähti 2017 loppu

Mex-luku

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

Tasks

Submissions (mangolassi)