CSES - Datatähti 2017 alku - Results
Submission details
Task:Järjestys
Sender:tuomask
Submission time:2016-10-08 15:05:19 +0300
Language:C++
Status:READY
Result:19
Feedback
groupverdictscore
#1ACCEPTED19
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.05 s1details
#20.05 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[7];
    	cin.getline(input, 6, ' ');
    	array[i] = atoi(input);
    }
    char input[7];
    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 old_arr[lastnotdone+1];
		
		memcpy(old_arr, array, sizeof(array));
		/*for (int i=0; i<=lastnotdone; i++) {
			old_arr[i] = array[i];
		}*/
		
		for (int i=0; i<=lastnotdone; i++) {
			
			if (i<=max_i) {
				array[i+(lastnotdone - max_i)] = old_arr[i];
			} else {
				array[lastnotdone-i] = old_arr[i];
			}
		}
		
		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' << turns_oss.str() << endl;
}






Test details

Test 1

Group: 1

Verdict: ACCEPTED

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
11
7 10 4 9 7 8 4 7 3 4 2 

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
1907
6 1000 904 999 964 998 333 997...

Test 3

Group: 3

Verdict:

input
100000
94703 47808 62366 31885 7091 8...

correct output
399956
98676 98676 98675 98676 62994 ...

user output
(empty)