CSES - Datatähti 2019 alku

CSES - Datatähti 2019 alku - Results

Submission details
Task:	Taulukko
Sender:	N00B.exe
Submission time:	2018-10-12 19:01:39 +0300
Language:	C++
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	WRONG ANSWER	0
#2	WRONG ANSWER	0
#3	TIME LIMIT EXCEEDED	0
#4	TIME LIMIT EXCEEDED	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.03 s	1	details
#2	WRONG ANSWER	0.02 s	1	details
#3	WRONG ANSWER	0.01 s	1	details
#4	ACCEPTED	0.02 s	1	details
#5	ACCEPTED	0.01 s	1	details
#6	WRONG ANSWER	0.01 s	1	details
#7	WRONG ANSWER	0.03 s	1	details
#8	ACCEPTED	0.01 s	1	details
#9	ACCEPTED	0.01 s	1	details
#10	WRONG ANSWER	0.01 s	1	details
#11	WRONG ANSWER	0.01 s	1	details
#12	ACCEPTED	0.01 s	1	details
#13	ACCEPTED	0.01 s	1	details
#14	WRONG ANSWER	0.02 s	1	details
#15	WRONG ANSWER	0.40 s	2	details
#16	WRONG ANSWER	0.53 s	2	details
#17	TIME LIMIT EXCEEDED	--	2	details
#18	ACCEPTED	0.01 s	2	details
#19	WRONG ANSWER	0.57 s	2	details
#20	WRONG ANSWER	0.61 s	2	details
#21	TIME LIMIT EXCEEDED	--	2	details
#22	TIME LIMIT EXCEEDED	--	2	details
#23	TIME LIMIT EXCEEDED	--	2	details
#24	TIME LIMIT EXCEEDED	--	2	details
#25	ACCEPTED	0.03 s	2	details
#26	ACCEPTED	0.03 s	2	details
#27	WRONG ANSWER	0.03 s	2	details
#28	WRONG ANSWER	0.02 s	2	details
#29	TIME LIMIT EXCEEDED	--	3	details
#30	TIME LIMIT EXCEEDED	--	3	details
#31	WRONG ANSWER	0.07 s	3	details
#32	TIME LIMIT EXCEEDED	--	3	details
#33	TIME LIMIT EXCEEDED	--	3	details
#34	TIME LIMIT EXCEEDED	--	3	details
#35	TIME LIMIT EXCEEDED	--	3	details
#36	TIME LIMIT EXCEEDED	--	3	details
#37	TIME LIMIT EXCEEDED	--	4	details
#38	TIME LIMIT EXCEEDED	--	4	details
#39	WRONG ANSWER	0.07 s	4	details
#40	TIME LIMIT EXCEEDED	--	4	details
#41	TIME LIMIT EXCEEDED	--	4	details
#42	TIME LIMIT EXCEEDED	--	4	details
#43	TIME LIMIT EXCEEDED	--	4	details
#44	TIME LIMIT EXCEEDED	--	4	details
#45	TIME LIMIT EXCEEDED	--	4	details
#46	WRONG ANSWER	0.06 s	4	details
#47	WRONG ANSWER	0.32 s	4	details
#48	TIME LIMIT EXCEEDED	--	4	details
#49	WRONG ANSWER	0.05 s	4	details
#50	WRONG ANSWER	0.55 s	4	details
#51	WRONG ANSWER	0.05 s	4	details
#52	WRONG ANSWER	0.09 s	4	details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:30:35: warning: format '%d' expects argument of type 'int', but argument 2 has type 'double' [-Wformat=]
   printf("%d", (n*((n + 1.0) / 2)));
                ~~~~~~~~~~~~~~~~~~~^
input/code.cpp:12:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &k);
  ~~~~~^~~~~~~~~~~~~~~~~

Code

#include <iostream>
#include <map>

using namespace std;

int main() {

	ios_base::sync_with_stdio(0);
	cin.tie(0);

	int n, k, ans = 0;
	scanf("%d %d", &n, &k);

	map<int, int> m;


	int* numbers = (int*)malloc(4 * n);

	for(int i = 0; i < n; i++)
	{
		cin >> *(numbers + i);
		//scanf("%d", (numbers + i));
	}

	if (k == 0)
	{ printf("0"); return 0; }

	if(k >= n)
	{
		printf("%d", (n*((n + 1.0) / 2)));
		return 0;
	}

	int dAmount = 0;

	for(int i = 0; i < n; i++)
	{
		int index = *(numbers + i);

		if(m[index] == 0)
		{ m[index] = 1; dAmount++; }

		else
		{ m[index] += 1; }
	}

	if (dAmount <= k)
	{ ans = n * ((n + 1.0) / 2); }

	else
	{
		int start = 0;
		int end = n - 1;
		bool goRight = false;
		int growIndex, shrinkIndex;
		int a, b;
		int currentDNumbers = dAmount;
		int d = currentDNumbers - k;
		int min = 2147483647;

		if(d <= end - start - d)
		{
			for(int k = 0; k < d; k++)
			{
				m[*(numbers + start)] -= 1;
				
				if(m[*(numbers + start)] == 0)
				{ currentDNumbers--; }

				start++;
			}
		}

		else
		{
			start += d;
			m.clear();
			currentDNumbers = 0;

			for(int k = 0; k < (end-start + 1); k++)
			{
				if(m[*(numbers + start + k)] == 0)
				{ m[*(numbers + start + k)] = 1; currentDNumbers++; }

				else {
					m[*(numbers + start + k)] += 1;
				}
			}
		}

		while(end - start > (k - 1))
		{
			growIndex = (goRight) ? end + 1 : start - 1;

			if (growIndex > n - 1)
			{
				if (end - start == k)
				{ break; }

				d = min - k;

				if (d <= 1)
				{
					d = 1;
					m[*(numbers + start)] -= 1;

					if (m[*(numbers + start)] == 0)
					{ currentDNumbers--; }

					if (currentDNumbers <= k)
					{ ans++; }

					start++;
					goRight = !goRight;
				}

				else if (d <= end - start - d)
				{
					for (int k = 0; k < d; k++)
					{
						m[*(numbers + start)] -= 1;

						if (m[*(numbers + start)] == 0)
						{ currentDNumbers--; }

						start++;
					}
					goRight = !goRight;
				}

				else
				{
					start += d;
					m.clear();
					currentDNumbers = 0;

					for (int k = 0; k < (end - start + 1); k++)
					{
						if (m[*(numbers + start + k)] == 0)
						{ m[*(numbers + start + k)] = 1; currentDNumbers++; }

						else
						{ m[*(numbers + start + k)] += 1; }
					}

					goRight = !goRight;
				}

				if (currentDNumbers < min)
				{ min = currentDNumbers; }
			}

			else if(growIndex < 0)
			{
				if (end - start == k)
				{ break; }

				d = min - k;

				if (d <= 1)
				{
					d = 1;
					m[*(numbers + end)] -= 1;
					
					if (m[*(numbers + end)] == 0)
					{ currentDNumbers--; }
					
					if (currentDNumbers <= k)
					{ ans++; }

					end--;
					goRight = !goRight;
					}

					else if (d <= end - start - d)
					{
						for (int k = 0; k < d; k++)
						{
							m[*(numbers + end)] -= 1;

							if (m[*(numbers + end)] == 0)
							{ currentDNumbers--; }

							end--;
						}
						goRight = !goRight;
					}

					else
					{
						end -= d;
						m.clear();
						currentDNumbers = 0;

						for (int k = end - start; k > -1; k++)
						{
							if (m[*(numbers + end + k)] == 0)
							{ m[*(numbers + end + k)] = 1; currentDNumbers++; }

							else
							{ m[*(numbers + end + k)] += 1; }
						}

						goRight = !goRight;
					}

				}

			else
			{
				shrinkIndex = (goRight) ? start : end;

				a = m[*(numbers + shrinkIndex)];
				b = m[*(numbers + growIndex)];

				m[*(numbers + shrinkIndex)] -= 1;
				m[*(numbers + growIndex)] += 1;

				if (m[*(numbers + shrinkIndex)] == 0 && m[*(numbers + shrinkIndex)] != a)
				{ currentDNumbers--; }

				if (m[*(numbers + growIndex)] == 1 && m[*(numbers + growIndex)] != b)
				{ currentDNumbers++; }

				if (currentDNumbers <= k)
				{ ans++; }

				start += (goRight) ? 1 : -1;
				end += (goRight) ? 1 : -1;

				if(currentDNumbers < min)
				{ min = currentDNumbers; }
			}

		}
		ans += ((2 * n + 1)*k - k * k) / 2;
	}

	printf("%d", ans);
	m.clear();
	free(numbers);

	return 0;
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
`100 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`5050` view save

user output
`5050` view save

Test 2

Group: 1

Verdict: WRONG ANSWER

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

correct output
`190` view save

user output
`5050` view save

Test 3

Group: 1

Verdict: WRONG ANSWER

input
`100 1 5 9 9 6 9 8 1 4 7 7 8 9 5 5 6 ...` view save

correct output
`110` view save

user output
`5050` view save

Test 4

Group: 1

Verdict: ACCEPTED

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

correct output
`5050` view save

user output
`5050` view save

Test 5

Group: 1

Verdict: ACCEPTED

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

correct output
`5050` view save

user output
`5050` view save

Test 6

Group: 1

Verdict: WRONG ANSWER

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

correct output
`379` view save

user output
`5050` view save

Test 7

Group: 1

Verdict: WRONG ANSWER

input
`100 2 4 6 10 8 6 8 10 8 4 7 8 9 6 2 ...` view save

correct output
`245` view save

user output
`5050` view save

Test 8

Group: 1

Verdict: ACCEPTED

input
`100 5 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`5050` view save

user output
`5050` view save

Test 9

Group: 1

Verdict: ACCEPTED

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

correct output
`5050` view save

user output
`5050` view save

Test 10

Group: 1

Verdict: WRONG ANSWER

input
`100 5 5 3 4 1 1 1 1 4 5 5 4 6 6 3 3 ...` view save

correct output
`1488` view save

user output
`5050` view save

Test 11

Group: 1

Verdict: WRONG ANSWER

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

correct output
`743` view save

user output
`5050` view save

Test 12

Group: 1

Verdict: ACCEPTED

input
`100 10 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`5050` view save

user output
`5050` view save

Test 13

Group: 1

Verdict: ACCEPTED

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

correct output
`5050` view save

user output
`5050` view save

Test 14

Group: 1

Verdict: WRONG ANSWER

input
`100 10 80 59 58 87 28 83 83 93 96 24 ...` view save

correct output
`994` view save

user output
`5050` view save

Test 15

Group: 2

Verdict: WRONG ANSWER

input
`5000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`12502500` view save

user output
`6459525` view save

Test 16

Group: 2

Verdict: WRONG ANSWER

input
`5000 1 2 2 2 1 2 1 1 1 2 2 1 2 1 1 1 ...` view save

correct output
`10148` view save

user output
`2097958` view save

Test 17

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`5000 1 434568 634119 102509 107238 72...` view save

correct output
`5000` view save

user output
(empty)

Test 18

Group: 2

Verdict: ACCEPTED

input
`5000 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`12502500` view save

user output
`12502500` view save

Test 19

Group: 2

Verdict: WRONG ANSWER

input
`5000 2 2 1 1 1 2 2 2 2 1 1 1 1 2 1 2 ...` view save

correct output
`12502500` view save

user output
`6461570` view save

Test 20

Group: 2

Verdict: WRONG ANSWER

input
`5000 2 1 3 2 2 3 3 1 2 1 2 1 2 3 1 2 ...` view save

correct output
`22451` view save

user output
`2109595` view save

Test 21

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`5000 2 132968 414421 468358 432744 43...` view save

correct output
`9999` view save

user output
(empty)

Test 22

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`5000 100 93 76 87 71 93 74 69 35 92 96 ...` view save

correct output
`12502500` view save

user output
(empty)

Test 23

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`5000 100 2 57 51 4 35 76 5 40 51 55 20 ...` view save

correct output
`2669737` view save

user output
(empty)

Test 24

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`5000 100 657 823 1773 1801 2785 4107 25...` view save

correct output
`498978` view save

user output
(empty)

Test 25

Group: 2

Verdict: ACCEPTED

input
`5000 4999 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`12502500` view save

user output
`12502500` view save

Test 26

Group: 2

Verdict: ACCEPTED

input
`5000 4999 865706 910619 695192 183574 92...` view save

correct output
`12502500` view save

user output
`12502500` view save

Test 27

Group: 2

Verdict: WRONG ANSWER

input
`5000 5000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`12502500` view save

user output
`5000` view save

Test 28

Group: 2

Verdict: WRONG ANSWER

input
`5000 5000 774752 159472 183796 654476 69...` view save

correct output
`12502500` view save

user output
`5000` view save

Test 29

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`500000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`125000250000` view save

user output
(empty)

Test 30

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`500000 1 28107328 613212742 298033960 7...` view save

correct output
`500000` view save

user output
(empty)

Test 31

Group: 3

Verdict: WRONG ANSWER

input
`500000 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`125000250000` view save

user output
`-2147483648` view save

Test 32

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`500000 2 1 1 2 1 1 2 2 1 2 1 2 1 1 2 1 ...` view save

correct output
`125000250000` view save

user output
(empty)

Test 33

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`500000 2 3 2 2 3 2 2 2 1 1 2 2 3 2 3 2 ...` view save

correct output
`2245355` view save

user output
(empty)

Test 34

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`500000 2 1 1 1 2 2 2 1 1 2 1 1 2 1 2 1 ...` view save

correct output
`1570486882` view save

user output
(empty)

Test 35

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`500000 2 318961563 84011941 882177798 1...` view save

correct output
`999999` view save

user output
(empty)

Test 36

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`500000 2 1 1 2 1 2 1 2 1 2 2 2 2 1 2 1 ...` view save

correct output
`483793169` view save

user output
(empty)

Test 37

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`500000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`125000250000` view save

user output
(empty)

Test 38

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`500000 1 709486749 350496125 796065873 ...` view save

correct output
`500000` view save

user output
(empty)

Test 39

Group: 4

Verdict: WRONG ANSWER

input
`500000 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`125000250000` view save

user output
`-2147483648` view save

Test 40

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`500000 2 1 2 2 2 2 2 1 1 2 2 2 2 2 2 1 ...` view save

correct output
`125000250000` view save

user output
(empty)

Test 41

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`500000 2 3 3 3 3 2 1 3 2 1 3 1 2 1 1 1 ...` view save

correct output
`2255047` view save

user output
(empty)

Test 42

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`500000 2 414942284 362802746 108881396 ...` view save

correct output
`999999` view save

user output
(empty)

Test 43

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`500000 100 59 14 100 74 49 43 91 84 31 16...` view save

correct output
`260458849` view save

user output
(empty)

Test 44

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`500000 1000 505 511 86 321 780 495 106 330...` view save

correct output
`3694803834` view save

user output
(empty)

Test 45

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`500000 10000 4956 8463 8582 980 9278 1747 2...` view save

correct output
`41655235436` view save

user output
(empty)

Test 46

Group: 4

Verdict: WRONG ANSWER

input
`500000 100000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`125000250000` view save

user output
`-2147483648` view save

Test 47

Group: 4

Verdict: WRONG ANSWER

input
`500000 100000 40198 78364 3724 51802 378 130...` view save

correct output
`125000250000` view save

user output
`-2147483648` view save

Test 48

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`500000 100000 320513086 811766509 339605137 ...` view save

correct output
`45001856854` view save

user output
(empty)

Test 49

Group: 4

Verdict: WRONG ANSWER

input
`500000 499999 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`125000250000` view save

user output
`-2147483648` view save

Test 50

Group: 4

Verdict: WRONG ANSWER

input
`500000 499999 995132060 587162982 59723733 8...` view save

correct output
`125000250000` view save

user output
`-2147483648` view save

Test 51

Group: 4

Verdict: WRONG ANSWER

input
`500000 500000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`125000250000` view save

user output
`500000` view save

Test 52

Group: 4

Verdict: WRONG ANSWER

input
`500000 500000 72083718 753463162 730560260 6...` view save

correct output
`125000250000` view save

user output
`500000` view save

Datatähti 2019 alku

Taulukko

Compiler report

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

Tasks

Submissions (N00B.exe)