Task: | Urkupillit |
Sender: | Totska |
Submission time: | 2021-12-09 14:23:57 +0200 |
Language: | C++ (C++17) |
Status: | READY |
Result: | 100 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 12 |
#2 | ACCEPTED | 33 |
#3 | ACCEPTED | 55 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.01 s | 1 | details |
#2 | ACCEPTED | 0.01 s | 1 | details |
#3 | ACCEPTED | 0.01 s | 1 | details |
#4 | ACCEPTED | 0.01 s | 1 | details |
#5 | ACCEPTED | 0.01 s | 1 | details |
#6 | ACCEPTED | 0.01 s | 2 | details |
#7 | ACCEPTED | 0.01 s | 2 | details |
#8 | ACCEPTED | 0.01 s | 2 | details |
#9 | ACCEPTED | 0.01 s | 2 | details |
#10 | ACCEPTED | 0.01 s | 2 | details |
#11 | ACCEPTED | 0.02 s | 3 | details |
#12 | ACCEPTED | 0.02 s | 3 | details |
#13 | ACCEPTED | 0.02 s | 3 | details |
#14 | ACCEPTED | 0.02 s | 3 | details |
#15 | ACCEPTED | 0.02 s | 3 | details |
Code
#include <bits/stdc++.h>using namespace std;typedef long long ll;#define fr(o) for(ll z=0; z < o; z++)ll n, k, big, i, maxinc;vector<ll> l;void move(ll x){l[i + (n-1-x)] = big;big--;ll dc = 0;for(ll j = i+n-1; j != i + (n-1-x); j--){l[j] = big - dc;dc++;}}void movemax(){l[i-1] = big;i--; big--;}int main(){cin >> n >> k;i = n-1; big = n;maxinc = n-1;l.resize(2*n - 1);for(ll z = 1; z < n+1; z++){l[n-2 + z] = z;}ll infront = 0;while(k >= maxinc && maxinc != 0){// movemax();k -= maxinc;maxinc--;infront++;}if(infront > 0){for (ll p = i - infront; p < i; p++){l[p] = big;big--;}i -= infront;}if(k < maxinc){move(k);k = 0;}for (ll m = i; m < i+n; m++){cout << l[m] << " ";}cout << endl;}
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 |