Submission #495007

#	Time	Username	Problem	Language	Result	Execution time	Memory
495007		Amer	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	8 / 100	3067 ms	2252 KiB

sortbooks

#include <iostream>

using namespace std;

const int maxN = 100005;

int arr[maxN];

int solve(int start, int finish, int mood)
{
	int len = finish - start + 1;

	int newArr[maxN];



	for (int i = 0; i < len; i++)
	{
		newArr[i] = arr[start - 1 + i];
	}

	for (int i = 0; i < len; i++)
	{
		for (int j = 0; j < len - i - 1; j++)
		{
			if (newArr[j] > newArr[j + 1])
			{
				if (newArr[j] + newArr[j + 1] > mood)
				{
					return false;
				}

				swap(newArr[j], newArr[j + 1]);
			}
		}
	}

	return true;
}

int main()
{
    int n, m;

    cin >> n >> m;

	for (int i = 0; i < n; i++)
	{
		cin >> arr[i];
	}

	for (int i = 0; i < m; i++)
	{
		int start, finish, mood;

		cin >> start >> finish >> mood;

		cout << solve(start, finish, mood)<<endl;
	}
}

/*
5 2
3 5 1 8 2
1 3 6
2 5 3
*/

• Subtask 1: 8 / 8
• Subtask 2: 0 / 9
• Subtask 3: 0 / 13
• Subtask 4: 0 / 17
• Subtask 5: 0 / 30
• Subtask 6: 0 / 23