CSES - Datatähti 2017 alku - Results
Submission details
Task:Järjestys
Sender:tuomask
Submission time:2016-10-08 14:28:34 +0300
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.05 s1details
#20.14 s2details
#3--3details

Code

#include <iostream>
#include <sstream>
#include <cstdlib>
#include <cstring>

using namespace std;

int main() {
	std::ostringstream turns_oss;

	unsigned int length;
	unsigned int turns_count = 0;
	
    cin >> length;    
    
    int array[length];
    
    for (unsigned int i=0; i<length-1; i++) {
    	char input[6];
    	cin.getline(input, 6, ' ');
    	array[i] = atoi(input);
    }
    char input[6];
    cin.getline(input, 6);
    array[length-1] = atoi(input);
    
    
    int lastnotdone(length); // This is same as:
    lastnotdone--;           // int lastnotdone = length-1
    
    
	int nextmax(0);
    
	while (lastnotdone > 0) {
	
		int max(0);
		int max_i(0);
		for (int i=0; i<=lastnotdone; i++) {
			if (array[i] > max) {
				max = array[i];
				max_i = i;
			}
			if (max == nextmax) {
				break;
			}
		}
		nextmax = max;
		nextmax--;
		
		
		if (max_i == lastnotdone) {
			lastnotdone--;
			continue;
		}
		
		
		/*int temp;
		
		if (max_i != 0) {
			for (int i=0; i<=max_i/2; i++) {
				temp = array[i];
				array[i] = array[max_i-i];
				array[max_i-i] = temp;
			}
			
		}
		
		for (int i=0; i<=lastnotdone/2; i++) {
			temp = array[i];
			array[i] = array[lastnotdone-i];
			array[lastnotdone-i] = temp;
		}*/
		
		
		/*cout << "bef. ";
		for (int i=0; i<length; i++) {
			cout << array[i] << " ";
		}
		cout << '\n';*/
		
		int old_arr[lastnotdone+1];
		
		for (int i=0; i<=lastnotdone; i++) {
			old_arr[i] = array[i];
		}
		
		for (int i=0; i<=lastnotdone; i++) {
			/*if (old_arr[i] == NULL) {
				old_arr[i] = array[i];
			}*/
			
			if (i<max_i) {
				old_arr[i+max_i] = array[i+max_i];
				array[i+max_i] = old_arr[i];
			} else {
				old_arr[lastnotdone-i] = array[lastnotdone-i];
				array[lastnotdone-i] = old_arr[i];
			}
		}
		
		/*cout << "aft. ";
		for (int i=0; i<length; i++) {
			cout << array[i] << " ";
		}
		cout << '\n' << '\n';*/
		
		
		if (max_i != 0) {
			turns_oss << (max_i+1) << (lastnotdone+1) << " ";
			turns_count += 2;
		} else {
			turns_oss << (lastnotdone+1) << " ";
			turns_count++;
		}
		
		lastnotdone--;		
	}
	
	
	
	cout << turns_count << '\n';
	cout << turns_oss.str() << endl;
}






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
13
710 49 38 37 6 25 4 3 

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
(empty)

Test 3

Group: 3

Verdict:

input
100000
94703 47808 62366 31885 7091 8...

correct output
399956
98676 98676 98675 98676 62994 ...

user output
(empty)