CSES - Datatähti 2021 alku - Results
Submission details
Task:Alitaulukot
Sender:motsgar
Submission time:2020-10-08 21:50:16 +0300
Language:C++ (C++17)
Status:READY
Result:37
Feedback
groupverdictscore
#1ACCEPTED11
#2ACCEPTED26
#30
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1, 2, 3details
#2ACCEPTED0.01 s1, 2, 3details
#3ACCEPTED0.01 s1, 2, 3details
#4ACCEPTED0.01 s1, 2, 3details
#5ACCEPTED0.01 s1, 2, 3details
#6ACCEPTED0.01 s2, 3details
#7ACCEPTED0.01 s2, 3details
#8ACCEPTED0.01 s2, 3details
#9ACCEPTED0.01 s2, 3details
#10ACCEPTED0.01 s2, 3details
#11--3details
#12ACCEPTED0.01 s3details
#13ACCEPTED0.01 s3details
#14--3details
#15--3details
#16--3details
#17--3details

Code

#include <iostream>
#include <chrono>

using namespace std;

char input1[18];
char input2[1000000];
int inputData[100000];

int main() {
	cin.getline(input1, sizeof(input1));
	cin.getline(input2, sizeof(input2));
	//int realOutput = 0;
	//auto t1 = std::chrono::high_resolution_clock::now();

	//for (int repeat = 0; repeat < 2000; repeat++)
	//{
		int output = 0;
		int dataLength = 0;
		int i = 0;

		while (input1[i] != ' ')
		{
			dataLength = dataLength * 10 + (input1[i] - 48);
			i++;
		}
		i++;

		int maxDifference = 0;
		while (input1[i] != '\0')
		{
			maxDifference = maxDifference * 10 + (input1[i] - 48);
			i++;
		}
		maxDifference++;

		output = dataLength;

		int smallestValue;
		int biggestValue;
		int index;

		i = 0;
		/*
		for (int j = 0; j < dataLength; j++) {
			int value = 0;
			while (input2[i] != ' ' && input2[i] != '\0')
			{

				value = value * 10 + (input2[i] - 48);
				i++;
			}

			inputData[j] = value;
			if (input2[i] == '\0') break;
			i++;
		}
		*/

		int inputDataIndex = 0;
		bool shouldCalculateInput = true;

		for (int j = 0; j < dataLength - 1; j++)
		{
			if (shouldCalculateInput)
			{
				int value = 0;
				while (input2[i] != ' ' && input2[i] != '\0')
				{

					value = value * 10 + (input2[i] - 48);
					i++;
				}

				inputData[inputDataIndex] = value;
				if (input2[i] == '\0') shouldCalculateInput = false;
				i++;
				inputDataIndex++;
			}

			smallestValue = inputData[j];
			biggestValue = inputData[j];
			index = 1;

			if (shouldCalculateInput)
			{
				int value = 0;
				while (input2[i] != ' ' && input2[i] != '\0')
				{

					value = value * 10 + (input2[i] - 48);
					i++;
				}

				inputData[inputDataIndex] = value;
				if (input2[i] == '\0') shouldCalculateInput = false;
				i++;
				inputDataIndex++;
			}

			if (inputData[j] > inputData[j + 1]) { smallestValue = inputData[j + 1]; biggestValue = inputData[j]; }
			else { smallestValue = inputData[j]; biggestValue = inputData[j + 1]; }

			while (true)
			{
				if (abs(smallestValue - inputData[j + index]) < maxDifference && abs(biggestValue - inputData[j + index]) < maxDifference)
				{
					if (smallestValue > inputData[j + index]) smallestValue = inputData[j + index];
					else if (biggestValue < inputData[j + index]) biggestValue = inputData[j + index];

					index++;

					if (shouldCalculateInput)
					{
						int value = 0;
						while (input2[i] != ' ' && input2[i] != '\0')
						{

							value = value * 10 + (input2[i] - 48);
							i++;
						}

						inputData[inputDataIndex] = value;
						if (input2[i] == '\0') shouldCalculateInput = false;
						i++;
						inputDataIndex++;
					}

					if (j + index == dataLength) break;
				}
				else break;
			}
			output += index - 1;
		}
		//realOutput += output;
	//}
	//auto t2 = std::chrono::high_resolution_clock::now();
	//auto duration = std::chrono::duration_cast<std::chrono::nanoseconds>(t2 - t1).count();
	//if (realOutput / 2000 != 2375) std::printf("WRONG ANSWER.  %i\n", realOutput / 2000);
	std::printf("%i", output);
	std::exit(0);
}

Test details

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

input
100 0
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
5050

user output
5050

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

input
100 2
5 5 2 4 3 5 3 4 3 2 3 4 5 4 4 ...

correct output
317

user output
317

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

input
100 10
71 60 61 96 25 10 10 9 84 85 1...

correct output
119

user output
119

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

input
100 990000000
111122929 961821360 578238211 ...

correct output
4006

user output
4006

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

input
100 1000000000
553190572 453407680 667300705 ...

correct output
5050

user output
5050

Test 6

Group: 2, 3

Verdict: ACCEPTED

input
2000 0
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
2001000

user output
2001000

Test 7

Group: 2, 3

Verdict: ACCEPTED

input
2000 2
4 4 1 4 2 3 1 2 1 3 5 2 2 4 4 ...

correct output
6340

user output
6340

Test 8

Group: 2, 3

Verdict: ACCEPTED

input
2000 10
65 88 33 88 41 10 17 38 22 3 8...

correct output
2413

user output
2413

Test 9

Group: 2, 3

Verdict: ACCEPTED

input
2000 999000000
746120950 772769620 721488968 ...

correct output
1287776

user output
1287776

Test 10

Group: 2, 3

Verdict: ACCEPTED

input
2000 1000000000
621947980 510355354 756705418 ...

correct output
2001000

user output
2001000

Test 11

Group: 3

Verdict:

input
100000 0
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
5000050000

user output
(empty)

Test 12

Group: 3

Verdict: ACCEPTED

input
100000 2
3 3 1 3 3 1 1 5 1 2 5 4 1 3 1 ...

correct output
317066

user output
317066

Test 13

Group: 3

Verdict: ACCEPTED

input
100000 10
10 3 6 3 43 60 5 48 15 27 86 4...

correct output
123292

user output
123292

Test 14

Group: 3

Verdict:

input
100000 999990000
460235639 963048588 47270983 3...

correct output
4946886742

user output
(empty)

Test 15

Group: 3

Verdict:

input
100000 1000000000
885457070 18257718 927615960 3...

correct output
5000050000

user output
(empty)

Test 16

Group: 3

Verdict:

input
100000 50000
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

correct output
3750075000

user output
(empty)

Test 17

Group: 3

Verdict:

input
100000 50000
100000 99999 99998 99997 99996...

correct output
3750075000

user output
(empty)