Code Submission Evaluation System Login

Datatähti 2019 alku

Start:2018-10-01 00:00:00
End:2018-10-15 00:00:00
 

Tasks | Messages | Scoreboard | Statistics


CSES - Datatähti 2019 alku - Results
History
2018-10-14 22:24:15
2018-10-14 22:19:530
2018-10-14 22:18:0665
2018-10-14 22:16:3465
2018-10-14 21:59:1965
2018-10-14 21:52:0665
2018-10-14 20:44:5565
2018-10-14 20:44:2065
2018-10-14 20:43:1130
2018-10-14 20:42:3665
2018-10-14 20:42:0665
2018-10-14 20:41:1765
2018-10-14 20:35:2465
2018-10-14 20:34:5747
2018-10-14 20:33:5747
2018-10-14 20:33:0747
2018-10-14 20:32:1947
2018-10-14 20:27:5065
2018-10-14 20:22:4365
2018-10-14 20:17:0865
2018-10-14 20:12:4665
2018-10-14 20:10:4165
2018-10-14 20:07:4565
2018-10-14 19:58:530
2018-10-14 19:57:5565
2018-10-14 19:36:0518
2018-10-14 19:32:130
2018-10-14 19:30:4118
2018-10-14 19:29:2665
2018-10-14 19:28:2465
2018-10-14 19:22:4565
2018-10-14 18:46:0665
2018-10-14 18:34:1830
2018-10-14 18:32:0130
2018-10-14 18:29:2612
2018-10-14 18:20:5212
2018-10-14 18:16:540
2018-10-14 01:49:2112
2018-10-14 01:43:3112
2018-10-14 01:22:2447
2018-10-12 19:01:390
2018-10-12 19:00:16
2018-10-10 14:09:360
2018-10-10 14:06:300
2018-10-09 20:13:240
2018-10-09 16:17:170
2018-10-09 14:59:0112
2018-10-08 22:39:0312
Task:Taulukko
Sender:N00B.exe
Submission time:2018-10-14 22:18:06
Language:C++
Status:READY
Score:65

Feedback

groupverdictscore
#1ACCEPTED12
#2ACCEPTED35
#3ACCEPTED18
#4TIME LIMIT EXCEEDED0

Test results

testverdicttime (s)group
#1ACCEPTED0.01 / 1.001details
#2ACCEPTED0.03 / 1.001details
#3ACCEPTED0.01 / 1.001details
#4ACCEPTED0.01 / 1.001details
#5ACCEPTED0.01 / 1.001details
#6ACCEPTED0.02 / 1.001details
#7ACCEPTED0.02 / 1.001details
#8ACCEPTED0.01 / 1.001details
#9ACCEPTED0.03 / 1.001details
#10ACCEPTED0.02 / 1.001details
#11ACCEPTED0.03 / 1.001details
#12ACCEPTED0.01 / 1.001details
#13ACCEPTED0.02 / 1.001details
#14ACCEPTED0.02 / 1.001details
#15ACCEPTED0.02 / 1.002details
#16ACCEPTED0.01 / 1.002details
#17ACCEPTED0.02 / 1.002details
#18ACCEPTED0.01 / 1.002details
#19ACCEPTED0.02 / 1.002details
#20ACCEPTED0.02 / 1.002details
#21ACCEPTED0.01 / 1.002details
#22ACCEPTED0.02 / 1.002details
#23ACCEPTED0.03 / 1.002details
#24ACCEPTED0.04 / 1.002details
#25ACCEPTED0.02 / 1.002details
#26ACCEPTED0.02 / 1.002details
#27ACCEPTED0.02 / 1.002details
#28ACCEPTED0.02 / 1.002details
#29ACCEPTED0.07 / 1.003details
#30ACCEPTED0.93 / 1.003details
#31ACCEPTED0.06 / 1.003details
#32ACCEPTED0.07 / 1.003details
#33ACCEPTED0.09 / 1.003details
#34ACCEPTED0.07 / 1.003details
#35ACCEPTED0.94 / 1.003details
#36ACCEPTED0.10 / 1.003details
#37ACCEPTED0.06 / 1.004details
#38ACCEPTED0.94 / 1.004details
#39ACCEPTED0.06 / 1.004details
#40ACCEPTED0.07 / 1.004details
#41ACCEPTED0.10 / 1.004details
#42ACCEPTED0.95 / 1.004details
#43ACCEPTED0.16 / 1.004details
#44ACCEPTED0.22 / 1.004details
#45ACCEPTED0.35 / 1.004details
#46ACCEPTED0.06 / 1.004details
#47ACCEPTED0.14 / 1.004details
#48TIME LIMIT EXCEEDED-- / 1.004details
#49ACCEPTED0.07 / 1.004details
#50ACCEPTED0.30 / 1.004details
#51ACCEPTED0.06 / 1.004details
#52ACCEPTED0.31 / 1.004details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:42:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if(nn.size() <= k)
     ~~~~~~~~~~^~~~
input/code.cpp:28:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &k);
  ~~~~~^~~~~~~~~~~~~~~~~
input/code.cpp:35:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",(nums + i));
   ~~~~~^~~~~~~~~~~~~~~~~

Code

#include <iostream>
#include <stdio.h>
#include <unordered_set>
#include <map>
#include <string>
#define USETI unordered_set<int>
#define CNT(c, val) c.count(val)
#define NSRT(c, val) c.insert(val)
#define PRTI(i) printf("%d", i)
#define PRT(s) printf(s)
#define LBRK printf("\n")
#define PAUSE getchar();getchar()
#define FORS(num, val, n) for(int num = val; num < n; num++)
#define FOR(num, n) for(int num = 0; num < n; num++)
#define SITUATION LBRK; PRT("dNumbers = "); PRTI(dNumbers); LBRK; PRT("Start and end = "); PRTI(start); PRT(" "); PRTI(end); LBRK; PRT("Ans = "); PRTI(ans); LBRK; PAUSE; PAUSE

typedef long long ll;

using namespace std;

int main() {

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

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

	int* nums = (int*)malloc(4*n);
	USETI nn;

	FOR(i, n)
	{ 
		scanf("%d",(nums + i));
		NSRT(nn, *(nums + i));
		
		//if(nn.size() <= k)
		//{ ans++; }
	}

	if(nn.size() <= k)
	{
		ll f = n;
		ans = f * ((f + 1) / 2.0);
		printf("%lld", ans);
		free(nums);
		return 0;
	}

	nn.clear();
	map<int, int> m;

	int start = 0;
	int end = -1;
	int* endP = nums + end;
	int* startP = nums + start;
	int dNumbers = 0;

	//ll waste = 0;
	bool wasteFlag = false;
	int endPrev;

	while (dNumbers <= k)
	{
		end++;
		endP++;
		if (m[*endP] == 0)
		{ dNumbers++; }

		//LBRK;
		//PRT("add number "); PRTI(*(nums + end));
		//LBRK;

		m[*endP] += 1;
	}

	ans += (ll)(end - start);

	//SITUATION;

	while (start < n - k)
	{
		//LBRK;
		//PRT("remove number "); PRTI(*(nums + start));
		//LBRK;
		m[*startP] -= 1;
		if (m[*startP] == 0)
		{
			dNumbers--;
			wasteFlag = false;
		}

		start++;
		if (start >= n - k)
		{
			break;
		}
		startP++;

		if(!wasteFlag)
		{
			endPrev = end;
			end++;
			endP++;

			if (end >= n)
			{
				end = n;
				endP = nums + n;
			}

			else
			{
				//LBRK;
				//PRT("add number "); PRTI(*(nums + end));
				//LBRK;
				if (m[*endP] == 0)
				{
					dNumbers++;
				}
				m[*endP] += 1;
			}


			if (dNumbers > k)
			{
				while (end - start >= k + 1)
				{
					//LBRK;
					//PRT("remove number "); PRTI(*(nums + end));
					//LBRK;
					m[*endP] -= 1;
					if (m[*endP] == 0)
					{
						if (dNumbers == k + 1)
						{
							m[*endP] += 1;
							break;
						}
						dNumbers--;
					}
					end--;
					endP--;
					/*
					if (dNumbers <= k)
					{
					end++;
					endP++;
					if (m[*endP] == 0)
					{
					dNumbers++;
					}

					else
					{
					PRT("x"); return 0;
					}

					//LBRK;
					//PRT("add number "); PRTI(*(nums + end));
					//LBRK;

					m[*endP] += 1;
					break;
					}
					*/
				}
			}



			while (dNumbers <= k)
			{
				end++;
				endP++;

				if (end >= n)
				{
					end = n;
					break;
				}

				if (m[*endP] == 0)
				{
					dNumbers++;
				}

				m[*endP] += 1;
			}
		}

		if(!wasteFlag && endPrev == end)
		{ wasteFlag = true; }

		ans += (ll)(end - start);

		//SITUATION;
	}

	ll lk = k;
	ans += lk * ((lk + 1) / 2.0);
	printf("%lld", ans);

	free(nums);
	/*
	LBRK;
	PRT("Wasted move "); printf("%lld", waste);
	PAUSE;
	*/

	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: ACCEPTED

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
190
view   save

Test 3

Group: 1

Verdict: ACCEPTED

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
110
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: ACCEPTED

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
379
view   save

Test 7

Group: 1

Verdict: ACCEPTED

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
245
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: ACCEPTED

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
1488
view   save

Test 11

Group: 1

Verdict: ACCEPTED

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
743
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: ACCEPTED

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

correct output
994
view   save

user output
994
view   save

Test 15

Group: 2

Verdict: ACCEPTED

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
12502500
view   save

Test 16

Group: 2

Verdict: ACCEPTED

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
10148
view   save

Test 17

Group: 2

Verdict: ACCEPTED

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

correct output
5000
view   save

user output
5000
view   save

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: ACCEPTED

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
12502500
view   save

Test 20

Group: 2

Verdict: ACCEPTED

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
22451
view   save

Test 21

Group: 2

Verdict: ACCEPTED

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

correct output
9999
view   save

user output
9999
view   save

Test 22

Group: 2

Verdict: ACCEPTED

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

correct output
12502500
view   save

user output
12502500
view   save

Test 23

Group: 2

Verdict: ACCEPTED

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

correct output
2669737
view   save

user output
2669737
view   save

Test 24

Group: 2

Verdict: ACCEPTED

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

correct output
498978
view   save

user output
498978
view   save

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: ACCEPTED

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
12502500
view   save

Test 28

Group: 2

Verdict: ACCEPTED

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

correct output
12502500
view   save

user output
12502500
view   save

Test 29

Group: 3

Verdict: ACCEPTED

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
125000250000
view   save

Test 30

Group: 3

Verdict: ACCEPTED

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

correct output
500000
view   save

user output
500000
view   save

Test 31

Group: 3

Verdict: ACCEPTED

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
125000250000
view   save

Test 32

Group: 3

Verdict: ACCEPTED

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
125000250000
view   save

Test 33

Group: 3

Verdict: ACCEPTED

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
2245355
view   save

Test 34

Group: 3

Verdict: ACCEPTED

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
1570486882
view   save

Test 35

Group: 3

Verdict: ACCEPTED

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

correct output
999999
view   save

user output
999999
view   save

Test 36

Group: 3

Verdict: ACCEPTED

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
483793169
view   save

Test 37

Group: 4

Verdict: ACCEPTED

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
125000250000
view   save

Test 38

Group: 4

Verdict: ACCEPTED

input
500000 1
709486749 350496125 796065873 ...
view   save

correct output
500000
view   save

user output
500000
view   save

Test 39

Group: 4

Verdict: ACCEPTED

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
125000250000
view   save

Test 40

Group: 4

Verdict: ACCEPTED

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
125000250000
view   save

Test 41

Group: 4

Verdict: ACCEPTED

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
2255047
view   save

Test 42

Group: 4

Verdict: ACCEPTED

input
500000 2
414942284 362802746 108881396 ...
view   save

correct output
999999
view   save

user output
999999
view   save

Test 43

Group: 4

Verdict: ACCEPTED

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

correct output
260458849
view   save

user output
260458849
view   save

Test 44

Group: 4

Verdict: ACCEPTED

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

correct output
3694803834
view   save

user output
3694803834
view   save

Test 45

Group: 4

Verdict: ACCEPTED

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

correct output
41655235436
view   save

user output
41655235436
view   save

Test 46

Group: 4

Verdict: ACCEPTED

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
125000250000
view   save

Test 47

Group: 4

Verdict: ACCEPTED

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

correct output
125000250000
view   save

user output
125000250000
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
(no output)
view   save

Test 49

Group: 4

Verdict: ACCEPTED

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
125000250000
view   save

Test 50

Group: 4

Verdict: ACCEPTED

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

correct output
125000250000
view   save

user output
125000250000
view   save

Test 51

Group: 4

Verdict: ACCEPTED

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
125000250000
view   save

Test 52

Group: 4

Verdict: ACCEPTED

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

correct output
125000250000
view   save

user output
125000250000
view   save