CSES - Datatähti 2021 alku

Submission details
Task:	Alitaulukot
Sender:	_Ahrou
Submission time:	2020-10-01 23:27:51 +0300
Language:	C++ (C++11)
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	WRONG ANSWER	0
#2	WRONG ANSWER	0
#3	WRONG ANSWER	0

Test results
test	verdict	time	group
#1	WRONG ANSWER	0.04 s	1, 2, 3	details
#2	WRONG ANSWER	0.04 s	1, 2, 3	details
#3	WRONG ANSWER	0.04 s	1, 2, 3	details
#4	WRONG ANSWER	0.04 s	1, 2, 3	details
#5	WRONG ANSWER	0.04 s	1, 2, 3	details
#6	WRONG ANSWER	0.04 s	2, 3	details
#7	WRONG ANSWER	0.04 s	2, 3	details
#8	WRONG ANSWER	0.04 s	2, 3	details
#9	WRONG ANSWER	0.04 s	2, 3	details
#10	WRONG ANSWER	0.04 s	2, 3	details
#11	WRONG ANSWER	0.04 s	3	details
#12	WRONG ANSWER	0.04 s	3	details
#13	WRONG ANSWER	0.04 s	3	details
#14	WRONG ANSWER	0.04 s	3	details
#15	WRONG ANSWER	0.05 s	3	details
#16	WRONG ANSWER	0.04 s	3	details
#17	WRONG ANSWER	0.04 s	3	details

Code

#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <random>
#include <chrono>
std::vector<int> generate_table(int n)
{
	std::vector<int> table;
	table.reserve(n);
	std::random_device rd;
	std::mt19937 gen(rd());
	std::uniform_int_distribution<int> dist(1, 99999999);
	for (int i = 0; i < n; i++)
	{
		table.emplace_back(dist(gen));
	}
	return table;
}
int absolute(int val)
{
	if (val < 0)
		return -val;
	else
		return val;
}
int max_e(const std::vector<int>& elements)
{
	int max;
	max = elements[0];
	for (auto e : elements)
	{
		if (e > max)
			max = e;
	}
	return max;
}
int min_e(const std::vector<int>& elements)
{
	int min;
	min = elements[0];
	for (auto e : elements)
	{
		if (e < min)
			min = e;
	}
	return min;
}
int get_n_sub_tables(std::vector<int>& table, int difference)
{
	int counter = 0;
	for (auto start_e = table.begin(); start_e != table.end(); ++start_e)
	{
		counter++;
		auto max = start_e;
		for (auto cur_e = start_e + 1; cur_e != table.end(); ++cur_e)
		{
			int d = *max - *cur_e;
			if (absolute(d) <= difference)
			{
				std::vector<int> temp;
				for (auto i = start_e; i != cur_e + 1; ++i)
				{
					temp.emplace_back(*i);
				}
				if ((max_e(temp) - min_e(temp) <= difference))
				{
					counter++;
				}
				if (d < 0)
					max = cur_e;
			}
			else
			{
				break;
			}
		}
	}
	return counter;
}
std::vector<std::vector<int>> get_sub_tables(std::vector<int>& table, int difference)
{
	std::vector<std::vector<int>> sub_tables;

	for (auto start_e = table.begin(); start_e != table.end(); ++start_e)
	{
		sub_tables.emplace_back(std::vector<int>{*start_e});
		auto max = start_e;
		for (auto cur_e = start_e + 1; cur_e != table.end(); ++cur_e)
		{
			int d = *max - *cur_e;
			if (absolute(d) <= difference)
			{
				std::vector<int> temp;
				for (auto i = start_e; i != cur_e + 1; ++i)
				{
					temp.emplace_back(*i);
				}
				if ((max_e(temp) - min_e(temp) <= difference))
				{
					sub_tables.emplace_back(temp);
				}
				if (d < 0)
					max = cur_e;
			}
			else
			{
				break;
			}
		}
	}
	return sub_tables;
}
std::vector<std::vector<int>> get_sub_tables_debug(std::vector<int>& table, std::vector<std::vector<int>>& correct, int difference)
{
	std::vector<std::vector<int>> sub_tables;

	for (auto start_e = table.begin(); start_e != table.end(); ++start_e)
	{
		sub_tables.emplace_back(std::vector<int>{*start_e});
		auto max = start_e;
		for (auto cur_e = start_e + 1; cur_e != table.end(); ++cur_e)
		{
			int d = *max - *cur_e;
			if (absolute(d) <= difference)
			{
				std::vector<int> temp;
				for (auto i = start_e; i != cur_e + 1; ++i)
				{
					temp.emplace_back(*i);
				}
				if (std::find(correct.begin(), correct.end(), temp) == correct.end())
				{
					std::cout << "table: [";
					for (auto e : temp)
					{
						std::cout << temp[e] << " ";
					}
					std::cout << "] does not match \n";	
				}
					
				sub_tables.emplace_back(temp);

				if (d < 0)
					max = cur_e;
			}
			else
			{
				break;
			}
		}
	}
	return sub_tables;
}
//int main()
//{
//	int n;
//	int d;
//	std::vector<int> table;
//	std::cin >> n;
//	std::cin >> d;
//	for (int temp, i = 0; i < n; i++)
//	{
//		std::cin >> temp;
//		table.emplace_back(temp);
//	}
//	std::cout << get_sub_tables(table, d).size();
//	return 0;
//}


int main()
{
	std::chrono::steady_clock clock;
	auto table = generate_table(100000);
	int d = 50000000;
	auto start = clock.now();
	std::cout << get_n_sub_tables(table, d) << '\n';
	auto end = clock.now();
	std::cout << std::chrono::duration_cast<std::chrono::milliseconds>(end - start).count();
	return 0;
}
































/*
std::vector<int> generate_table(int n)
{
	std::vector<int> table;
	table.reserve(n);
	std::random_device rd;
	std::mt19937 gen(rd());
	std::uniform_int_distribution<int> dist(1, 99999999);
	for (int i = 0; i < n; i++)
	{
		table.emplace_back(dist(gen));
	}
	return table;
}
std::vector<std::vector<int>> get_all_sub_tables(std::vector<int>& table)
{
	std::vector<std::vector<int>> sub_tables;
	for (int n_digit = 1; n_digit <= table.size(); n_digit++)
	{
		for (auto left_i = table.begin(); left_i != table.end(); ++left_i)
		{
			if (table.end() - left_i < n_digit)
				break;
			std::vector<int> sub_nums;
			for (auto right_i = left_i; right_i != left_i + n_digit; ++right_i)
			{
				if (right_i == table.end())
					break;
				sub_nums.emplace_back(*right_i);
			}
			sub_tables.emplace_back(sub_nums);
		}
	}
	return sub_tables;
}
std::vector<std::vector<int>> get_sub_tables_d(const std::vector<std::vector<int>>& sub_tables, int difference)
{
	std::vector<std::vector<int>> sub_tables_d;
	for (auto table = sub_tables.begin(); table != sub_tables.end(); ++table)
	{
		int min = *std::min_element(table->begin(), table->end());
		int max = *std::max_element(table->begin(), table->end());
		if ((max - min) <= difference)
		{
			sub_tables_d.emplace_back(*table);
		}
	}
	return sub_tables_d;
}
std::vector<std::vector<int>> get_sub_tables_perdigit(std::vector<int>& table, int difference)
{
	std::vector<std::vector<int>> sub_tables;
	for (int n_digit = 1; n_digit <= table.size(); n_digit++)
	{
		int min;
		for (auto left_i = table.begin(); left_i != table.end(); ++left_i)
		{
			if (table.end() - left_i < n_digit)
				break;
			min = *left_i;
			std::vector<int> sub_nums;
			for (auto right_i = left_i; right_i != left_i + n_digit; ++right_i)
			{
				int d = min - (*right_i);
				if (std::abs(d) <= difference)
				{
					sub_nums.emplace_back(*right_i);
					if (d > 0)
						min = *right_i;
				}
				else
					break;
				if (right_i == table.end())
					break;
			}
			if (sub_nums.size() == n_digit)
			{
				int d = max_e(sub_nums) - min_e(sub_nums);
				if (abs(d) <= difference)
				{
					sub_tables.emplace_back(sub_nums);
				}
				
			}
				
		}
	}
	return sub_tables;
}

void print_sub_tables(const std::vector<std::vector<int>>& source)
{
	for (auto table : source)
	{
		std::cout << "[ ";
		for (auto element : table)
		{
			std::cout << element << " ";
		}
		std::cout << "]";
	}
}
*/

Test details

Test 1

Group: 1, 2, 3

Verdict: WRONG ANSWER

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

correct output
`5050` view save

user output
`300778 33` view save

Test 2

Group: 1, 2, 3

Verdict: WRONG ANSWER

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

correct output
`317` view save

user output
`302445 34` view save

Test 3

Group: 1, 2, 3

Verdict: WRONG ANSWER

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

correct output
`119` view save

user output
`298935 33` view save

Test 4

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`100 990000000 111122929 961821360 578238211 ...` view save

correct output
`4006` view save

user output
`300269 36` view save

Test 5

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`100 1000000000 553190572 453407680 667300705 ...` view save

correct output
`5050` view save

user output
`297755 32` view save

Test 6

Group: 2, 3

Verdict: WRONG ANSWER

input
`2000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`2001000` view save

user output
`300316 34` view save

Test 7

Group: 2, 3

Verdict: WRONG ANSWER

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

correct output
`6340` view save

user output
`297883 33` view save

Test 8

Group: 2, 3

Verdict: WRONG ANSWER

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

correct output
`2413` view save

user output
`300043 34` view save

Test 9

Group: 2, 3

Verdict: WRONG ANSWER

input
`2000 999000000 746120950 772769620 721488968 ...` view save

correct output
`1287776` view save

user output
`298340 34` view save

Test 10

Group: 2, 3

Verdict: WRONG ANSWER

input
`2000 1000000000 621947980 510355354 756705418 ...` view save

correct output
`2001000` view save

user output
`299842 33` view save

Test 11

Group: 3

Verdict: WRONG ANSWER

input
`100000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`5000050000` view save

user output
`300809 33` view save

Test 12

Group: 3

Verdict: WRONG ANSWER

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

correct output
`317066` view save

user output
`298595 32` view save

Test 13

Group: 3

Verdict: WRONG ANSWER

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

correct output
`123292` view save

user output
`299575 34` view save

Test 14

Group: 3

Verdict: WRONG ANSWER

input
`100000 999990000 460235639 963048588 47270983 3...` view save

correct output
`4946886742` view save

user output
`300455 33` view save

Test 15

Group: 3

Verdict: WRONG ANSWER

input
`100000 1000000000 885457070 18257718 927615960 3...` view save

correct output
`5000050000` view save

user output
`301294 35` view save

Test 16

Group: 3

Verdict: WRONG ANSWER

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

correct output
`3750075000` view save

user output
`298816 33` view save

Test 17

Group: 3

Verdict: WRONG ANSWER

input
`100000 50000 100000 99999 99998 99997 99996...` view save

correct output
`3750075000` view save

user output
`300076 33` view save

Datatähti 2021 alku

Alitaulukot

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

Tasks

Submissions (_Ahrou)