Task: | Inversiot |
Sender: | Kuha |
Submission time: | 2018-01-07 19:09:18 +0200 |
Language: | C++ |
Status: | READY |
Result: | 100 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 11 |
#2 | ACCEPTED | 35 |
#3 | ACCEPTED | 54 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.04 s | 1 | details |
#2 | ACCEPTED | 0.04 s | 1 | details |
#3 | ACCEPTED | 0.05 s | 1 | details |
#4 | ACCEPTED | 0.06 s | 1 | details |
#5 | ACCEPTED | 0.04 s | 1 | details |
#6 | ACCEPTED | 0.06 s | 2 | details |
#7 | ACCEPTED | 0.04 s | 2 | details |
#8 | ACCEPTED | 0.03 s | 2 | details |
#9 | ACCEPTED | 0.05 s | 2 | details |
#10 | ACCEPTED | 0.04 s | 2 | details |
#11 | ACCEPTED | 0.14 s | 3 | details |
#12 | ACCEPTED | 0.14 s | 3 | details |
#13 | ACCEPTED | 0.14 s | 3 | details |
#14 | ACCEPTED | 0.14 s | 3 | details |
#15 | ACCEPTED | 0.14 s | 3 | details |
Code
#include <bits/stdc++.h> #define N (1<<17) #define ll long long #define ld long double #define M 1000000007 #define INF 0x5ADFACE5 #define LINF 0x51DEEFFEC7C0DECALL #define pii pair<int, int> #define pll pair<long long, long long> #define F first #define S second using namespace std; int ans[1111111]; int main () { ll n, k; cin>>n>>k; ll q = n; ll it = 1; while (k > 0) { k -= n - it; if (k < 0) it -= k; ans[it++] = q--; } for (ll i = n; i >= 1; i--) { if (!ans[i]) ans[i] = q--; } for (int i = 1; i <= n; i++) cout<<ans[i]<<" "; 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 1 |
correct output |
---|
2 1 3 4 5 |
user output |
---|
1 2 3 5 4 |
Test 3
Group: 1
Verdict: ACCEPTED
input |
---|
5 2 |
correct output |
---|
3 1 2 4 5 |
user output |
---|
1 2 5 3 4 |
Test 4
Group: 1
Verdict: ACCEPTED
input |
---|
5 4 |
correct output |
---|
5 1 2 3 4 |
user output |
---|
5 1 2 3 4 |
Test 5
Group: 1
Verdict: ACCEPTED
input |
---|
5 10 |
correct output |
---|
5 4 3 2 1 |
user output |
---|
5 4 3 2 1 |
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 1 |
correct output |
---|
2 1 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 8
Group: 2
Verdict: ACCEPTED
input |
---|
100 990 |
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 9
Group: 2
Verdict: ACCEPTED
input |
---|
100 1980 |
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 10
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 11
Group: 3
Verdict: ACCEPTED
input |
---|
1000000 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: ACCEPTED
input |
---|
1000000 1 |
correct output |
---|
2 1 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 13
Group: 3
Verdict: ACCEPTED
input |
---|
1000000 99999900000 |
correct output |
---|
1000000 999999 999998 999997 9... |
user output |
---|
1000000 999999 999998 999997 9... |
Test 14
Group: 3
Verdict: ACCEPTED
input |
---|
1000000 199999800000 |
correct output |
---|
1000000 999999 999998 999997 9... |
user output |
---|
1000000 999999 999998 999997 9... |
Test 15
Group: 3
Verdict: ACCEPTED
input |
---|
1000000 499999500000 |
correct output |
---|
1000000 999999 999998 999997 9... |
user output |
---|
1000000 999999 999998 999997 9... |