QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #235122 | #6428. K Co-prime Permutation | Yangmf# | AC ✓ | 48ms | 11560kb | C++17 | 1.4kb | 2023-11-02 14:34:52 | 2023-11-02 14:34:52 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> pii;
#define ld long double
#define M(x) {x%=mod;if(x<0) x+=mod;}
#define error \
{ \
cout << "No\n"; \
return; \
}
#define all(x) (x.begin(), x.end())
template <typename A, typename B>
bool smax(A &a, const B &b) { return a < b ? a = b, 1 : 0; }
template <typename A, typename B>
bool smin(A &a, const B &b) { return b < a ? a = b, 1 : 0; }
const int N = 1e6 + 10;
int a[N];
int n, m,k;
const int inf=1e18;
ld eps = 1e-9;
bool eql(ld x, ld y) { return fabs(x - y) < eps; }
bool lt(ld x, ld y) { return !eql(x, y) && x < y; }
bool rt(ld x, ld y) { return !eql(x,y)&& x>y;}
void solve()
{
cin>>n>>k;
if(k==0){
cout<<-1<<"\n";
} else {
for(int i=1;i<=n;i++) a[i]=i;
if(k%2==0){
for(int i=1;i<=k;i+=2){
swap(a[i],a[i+1]);
}
} else {
for(int i=2;i<=k;i+=2){
swap(a[i],a[i+1]);
}
}
for(int i=1;i<=n;i++){
cout<<a[i]<<" \n"[i==n];
}
}
}
signed main()
{
// freopen("D://Desktop//VSCODE//input.txt", "r", stdin);
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
t=1;
// cin >> t;
while (t--)
{
solve();
}
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3668kb
input:
5 3
output:
1 3 2 4 5
result:
ok ac
Test #2:
score: 0
Accepted
time: 0ms
memory: 3728kb
input:
1 0
output:
-1
result:
ok ac
Test #3:
score: 0
Accepted
time: 39ms
memory: 11548kb
input:
1000000 3789
output:
1 3 2 5 4 7 6 9 8 11 10 13 12 15 14 17 16 19 18 21 20 23 22 25 24 27 26 29 28 31 30 33 32 35 34 37 36 39 38 41 40 43 42 45 44 47 46 49 48 51 50 53 52 55 54 57 56 59 58 61 60 63 62 65 64 67 66 69 68 71 70 73 72 75 74 77 76 79 78 81 80 83 82 85 84 87 86 89 88 91 90 93 92 95 94 97 96 99 98 101 100 103 ...
result:
ok ac
Test #4:
score: 0
Accepted
time: 31ms
memory: 11476kb
input:
1000000 578768
output:
2 1 4 3 6 5 8 7 10 9 12 11 14 13 16 15 18 17 20 19 22 21 24 23 26 25 28 27 30 29 32 31 34 33 36 35 38 37 40 39 42 41 44 43 46 45 48 47 50 49 52 51 54 53 56 55 58 57 60 59 62 61 64 63 66 65 68 67 70 69 72 71 74 73 76 75 78 77 80 79 82 81 84 83 86 85 88 87 90 89 92 91 94 93 96 95 98 97 100 99 102 101 ...
result:
ok ac
Test #5:
score: 0
Accepted
time: 0ms
memory: 3624kb
input:
500 1
output:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 ...
result:
ok ac
Test #6:
score: 0
Accepted
time: 25ms
memory: 8812kb
input:
600000 600000
output:
2 1 4 3 6 5 8 7 10 9 12 11 14 13 16 15 18 17 20 19 22 21 24 23 26 25 28 27 30 29 32 31 34 33 36 35 38 37 40 39 42 41 44 43 46 45 48 47 50 49 52 51 54 53 56 55 58 57 60 59 62 61 64 63 66 65 68 67 70 69 72 71 74 73 76 75 78 77 80 79 82 81 84 83 86 85 88 87 90 89 92 91 94 93 96 95 98 97 100 99 102 101 ...
result:
ok ac
Test #7:
score: 0
Accepted
time: 24ms
memory: 9736kb
input:
600000 1
output:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 ...
result:
ok ac
Test #8:
score: 0
Accepted
time: 0ms
memory: 3672kb
input:
600000 0
output:
-1
result:
ok ac
Test #9:
score: 0
Accepted
time: 48ms
memory: 11560kb
input:
1000000 999997
output:
1 3 2 5 4 7 6 9 8 11 10 13 12 15 14 17 16 19 18 21 20 23 22 25 24 27 26 29 28 31 30 33 32 35 34 37 36 39 38 41 40 43 42 45 44 47 46 49 48 51 50 53 52 55 54 57 56 59 58 61 60 63 62 65 64 67 66 69 68 71 70 73 72 75 74 77 76 79 78 81 80 83 82 85 84 87 86 89 88 91 90 93 92 95 94 97 96 99 98 101 100 103 ...
result:
ok ac
Test #10:
score: 0
Accepted
time: 26ms
memory: 11420kb
input:
1000000 510000
output:
2 1 4 3 6 5 8 7 10 9 12 11 14 13 16 15 18 17 20 19 22 21 24 23 26 25 28 27 30 29 32 31 34 33 36 35 38 37 40 39 42 41 44 43 46 45 48 47 50 49 52 51 54 53 56 55 58 57 60 59 62 61 64 63 66 65 68 67 70 69 72 71 74 73 76 75 78 77 80 79 82 81 84 83 86 85 88 87 90 89 92 91 94 93 96 95 98 97 100 99 102 101 ...
result:
ok ac
Test #11:
score: 0
Accepted
time: 43ms
memory: 11500kb
input:
999877 23324
output:
2 1 4 3 6 5 8 7 10 9 12 11 14 13 16 15 18 17 20 19 22 21 24 23 26 25 28 27 30 29 32 31 34 33 36 35 38 37 40 39 42 41 44 43 46 45 48 47 50 49 52 51 54 53 56 55 58 57 60 59 62 61 64 63 66 65 68 67 70 69 72 71 74 73 76 75 78 77 80 79 82 81 84 83 86 85 88 87 90 89 92 91 94 93 96 95 98 97 100 99 102 101 ...
result:
ok ac
Test #12:
score: 0
Accepted
time: 0ms
memory: 3616kb
input:
1 1
output:
1
result:
ok ac
Test #13:
score: 0
Accepted
time: 0ms
memory: 3688kb
input:
2 0
output:
-1
result:
ok ac
Test #14:
score: 0
Accepted
time: 0ms
memory: 3688kb
input:
2 1
output:
1 2
result:
ok ac
Test #15:
score: 0
Accepted
time: 0ms
memory: 3676kb
input:
2 2
output:
2 1
result:
ok ac