CSES - Datatähti 2015 loppu - Results
Submission details
Task:Urkupillit
Sender:juusohe
Submission time:2015-01-29 13:45:31 +0200
Language:C++
Status:READY
Result:45
Feedback
groupverdictscore
#1ACCEPTED12
#2ACCEPTED33
#30
Test results
testverdicttimegroup
#1ACCEPTED0.07 s1details
#2ACCEPTED0.05 s1details
#3ACCEPTED0.06 s1details
#4ACCEPTED0.07 s1details
#5ACCEPTED0.06 s1details
#6ACCEPTED0.06 s2details
#7ACCEPTED0.06 s2details
#8ACCEPTED0.08 s2details
#9ACCEPTED0.06 s2details
#10ACCEPTED0.06 s2details
#11ACCEPTED0.09 s3details
#12--3details
#13--3details
#14--3details
#15--3details

Code

#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>

using namespace std;

int main() {
	
	cin.sync_with_stdio(false);
	
	long long n = 0;
	long long k = 0;
	
	cin >> n;
	cin >> k;
	
	vector<long long> pillit;
	
	for (long long i = 1; i <= n; i++) {
		pillit.push_back(i);
	}
	
	long long j = 0;
	long long jmax = 0;

	while (k > n) {
		long long x = pillit[0];
		pillit.erase(pillit.begin());
		pillit.insert(pillit.end() - jmax, x);
		jmax++;
		k -= (n - jmax);
	}

	//for (long long i = 0; i < n; i++) {
	//	cout << pillit[i] << ' ';
	//}
	//cout << '\n';
	
	//cout << k << '\n';

	for (long long i = 0; i < k; i++) {
		
		long long x;
		x = pillit[j];
		pillit[j] = pillit[j + 1];
		pillit[j + 1] = x;
		j++;
		if (j + 1 + jmax == n) {
			j = 0;
			jmax++;
		}
	}
	
	for (long long i = 0; i < n; i++) {
		cout << pillit[i] << ' ';
	}
	
	cout << '\n';
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
5 0

correct output
1 2 3 4 5 

user output
1 2 3 4 5 

Test 2

Group: 1

Verdict: ACCEPTED

input
5 10

correct output
5 4 3 2 1 

user output
5 4 3 2 1 

Test 3

Group: 1

Verdict: ACCEPTED

input
5 3

correct output
4 1 2 3 5 

user output
2 3 4 1 5 

Test 4

Group: 1

Verdict: ACCEPTED

input
5 1

correct output
2 1 3 4 5 

user output
2 1 3 4 5 

Test 5

Group: 1

Verdict: ACCEPTED

input
5 2

correct output
3 1 2 4 5 

user output
2 3 1 4 5 

Test 6

Group: 2

Verdict: ACCEPTED

input
100 0

correct output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

Test 7

Group: 2

Verdict: ACCEPTED

input
100 4950

correct output
100 99 98 97 96 95 94 93 92 91...

user output
100 99 98 97 96 95 94 93 92 91...

Test 8

Group: 2

Verdict: ACCEPTED

input
100 2279

correct output
100 99 98 97 96 95 94 93 92 91...

user output
28 29 30 31 32 33 34 35 36 37 ...

Test 9

Group: 2

Verdict: ACCEPTED

input
100 2528

correct output
100 99 98 97 96 95 94 93 92 91...

user output
31 32 33 34 35 36 37 38 39 40 ...

Test 10

Group: 2

Verdict: ACCEPTED

input
100 4483

correct output
100 99 98 97 96 95 94 93 92 91...

user output
70 71 72 73 74 75 76 77 78 79 ...

Test 11

Group: 3

Verdict: ACCEPTED

input
100000 0

correct output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

Test 12

Group: 3

Verdict:

input
100000 4999950000

correct output
100000 99999 99998 99997 99996...

user output
(empty)

Test 13

Group: 3

Verdict:

input
100000 2969035543

correct output
100000 99999 99998 99997 99996...

user output
(empty)

Test 14

Group: 3

Verdict:

input
100000 2495939870

correct output
100000 99999 99998 99997 99996...

user output
(empty)

Test 15

Group: 3

Verdict:

input
100000 1279770330

correct output
100000 99999 99998 99997 99996...

user output
(empty)