CSES - Leirikisa 9.12.2021 - Results
Submission details
Task:Urkupillit
Sender:andreibe
Submission time:2021-12-09 16:30:32 +0200
Language:C++ (C++11)
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED12
#2ACCEPTED33
#3ACCEPTED55
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1details
#2ACCEPTED0.01 s1details
#3ACCEPTED0.01 s1details
#4ACCEPTED0.01 s1details
#5ACCEPTED0.01 s1details
#6ACCEPTED0.01 s2details
#7ACCEPTED0.01 s2details
#8ACCEPTED0.01 s2details
#9ACCEPTED0.01 s2details
#10ACCEPTED0.01 s2details
#11ACCEPTED0.02 s3details
#12ACCEPTED0.02 s3details
#13ACCEPTED0.02 s3details
#14ACCEPTED0.02 s3details
#15ACCEPTED0.03 s3details

Code

#include <iostream>
#include <string>
#include <math.h>
#include <map>
#include <algorithm>
#include <vector>
#include <fstream>
#include <set>
#include <unordered_map>
#include <queue>
#include <climits>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define LOOP(i,a,l) for (int i = a; i < l; i++)
#define LUO_VERKKO LOOP(i,0,m) {int a,b; cin >> a >> b; v[a].push_back(b); v[b].push_back(a);}
#define COLLECT for (int i = 0; i < n; i++) cin >> s[i]
#define A 999999999999999999LL
//https://cses.fi/dt/
ll n;
int s[101010];
int main() {
	ll k;
	cin >> n >> k;
	for (int i = 0; i < n; i++)
	{
		s[i] = i+1;
	}
	int amount = 1;

	while ( ( k - (n - amount) ) >= 0) {
		if (amount - 1 <= n - amount) {
			int temp = s[amount - 1];
			s[amount - 1] = s[n - amount];
			s[n - amount] = temp;
		}
		k = k - (n - amount);
		amount++;
		if (k == 0) {
			k = n - amount;
			break;
		};
	}
	sort(s + (amount-1), s + n);
	swap(s[n-k-1], s[n - 1]);
	sort(s+n-k, s + n);
	
	for (int i = 0; i < n; i++)
	{
		cout << s[i] << " ";
	}
}

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
1 5 2 3 4 

Test 4

Group: 1

Verdict: ACCEPTED

input
5 1

correct output
2 1 3 4 5 

user output
1 2 3 5 4 

Test 5

Group: 1

Verdict: ACCEPTED

input
5 2

correct output
3 1 2 4 5 

user output
1 2 5 3 4 

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 ...
Truncated

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...
Truncated

Test 8

Group: 2

Verdict: ACCEPTED

input
100 2279

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

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

Test 9

Group: 2

Verdict: ACCEPTED

input
100 2528

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

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

Test 10

Group: 2

Verdict: ACCEPTED

input
100 4483

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

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

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 ...
Truncated

Test 12

Group: 3

Verdict: ACCEPTED

input
100000 4999950000

correct output
100000 99999 99998 99997 99996...

user output
100000 99999 99998 99997 99996...
Truncated

Test 13

Group: 3

Verdict: ACCEPTED

input
100000 2969035543

correct output
100000 99999 99998 99997 99996...

user output
100000 99999 99998 99997 99996...
Truncated

Test 14

Group: 3

Verdict: ACCEPTED

input
100000 2495939870

correct output
100000 99999 99998 99997 99996...

user output
100000 99999 99998 99997 99996...
Truncated

Test 15

Group: 3

Verdict: ACCEPTED

input
100000 1279770330

correct output
100000 99999 99998 99997 99996...

user output
100000 99999 99998 99997 99996...
Truncated