CSES - Datatähti 2017 alku - Results
Submission details
Task:Järjestys
Sender:JesseNiininen
Submission time:2016-10-11 19:15:42 +0300
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.06 s1details
#20.05 s2details
#3--3details

Code

#include <iostream>
#include <vector>
#include <algorithm>
#include <random>

using namespace std;

void reverse(int * numbers, int startIndex, int stopIndex){
	while (startIndex < stopIndex){
		int temp = numbers[startIndex];
		numbers[startIndex] = numbers[stopIndex];
		numbers[stopIndex] = temp;
		startIndex++;
		stopIndex--;
	}
}

int main() {

	int n;
	cin >> n;

	int * numbers = new int[n];
	int maxNumber = n;
	int startIndex = 0;
	int stopIndex = n - 1;
	vector<int> reversals(n * 2);

	/*for (int i = 0; i < n; i++){
		std::cin >> numbers[i];
	}*/

	vector<int> shuffled;
	for (int i = 0; i < n; i++){
		shuffled.push_back(i + 1);
	}

	auto engine = std::default_random_engine(0);
	std::shuffle(std::begin(shuffled), std::end(shuffled), engine);

	for (int i = 0; i < n; i++){
		numbers[i] = shuffled[i];
	}

	cout << "Starting";

	while (startIndex != stopIndex){

		bool traverseBackwards = startIndex > stopIndex;
		int minIndex = traverseBackwards ? stopIndex : startIndex;
		int maxIndex = traverseBackwards ? startIndex : stopIndex;

		int currentNumber = maxNumber;
		int currentNumberIndex = 0;

		for (int i = minIndex - 1; i != maxIndex; ++i){
			if (numbers[i + 1] == currentNumber){
				currentNumberIndex = i + 1;
				break;
			}
		}

		if (currentNumberIndex == stopIndex) {
			if (traverseBackwards) {
				stopIndex++;
			}
			else {
				stopIndex--;
			}
			maxNumber--;
			continue;
		}

		if (currentNumberIndex != startIndex) {
			if (traverseBackwards) {
				reverse(numbers, currentNumberIndex, startIndex);
				reversals.push_back(startIndex - currentNumberIndex + 1);
			}
			else {
				reverse(numbers, startIndex, currentNumberIndex);
				reversals.push_back(currentNumberIndex - startIndex + 1);
			}
		}

		if (traverseBackwards) {
			reversals.push_back(startIndex - stopIndex + 1);

			int temp = startIndex;
			startIndex = stopIndex;
			stopIndex = temp - 1;
		}
		else {
			reversals.push_back(stopIndex - startIndex + 1);

			int temp = startIndex;
			startIndex = stopIndex;
			stopIndex = temp + 1;
		}
		maxNumber--;
	}

	cout << "done";

	/*cout << reversals.size() << endl;
	for (size_t i = 0; i < reversals.size(); ++i)
		cout << reversals[i] << " ";*/


}

Test details

Test 1

Group: 1

Verdict:

input
10
9 3 4 7 6 5 10 2 8 1

correct output
32
10 10 9 10 9 8 7 9 4 2 1 4 5 2...

user output
Startingdone

Test 2

Group: 2

Verdict:

input
1000
650 716 982 41 133 1000 876 92...

correct output
3984
207 207 206 207 128 127 126 12...

user output
Startingdone

Test 3

Group: 3

Verdict:

input
100000
94703 47808 62366 31885 7091 8...

correct output
399956
98676 98676 98675 98676 62994 ...

user output
(empty)