CodeForces 359B - Permutation(思维)
2016-11-27 15:46
483 查看
B. Permutation
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
A permutation p is an ordered group of numbers p1, p2, …, pn, consisting of n distinct positive integers, each is no more than n. We’ll define number n as the length of permutation p1, p2, …, pn.
Simon has a positive integer n and a non-negative integer k, such that 2k ≤ n. Help him find permutation a of length 2n, such that it meets this equation: .
Input
The first line contains two integers n and k (1 ≤ n ≤ 50000, 0 ≤ 2k ≤ n).
Output
Print 2n integers a1, a2, …, a2n — the required permutation a. It is guaranteed that the solution exists. If there are multiple solutions, you can print any of them.
Examples
input
1 0
output
1 2
input
2 1
output
3 2 1 4
input
4 0
output
2 7 4 6 1 3 5 8
Note
Record |x| represents the absolute value of number x.
In the first sample |1 - 2| - |1 - 2| = 0.
In the second sample |3 - 2| + |1 - 4| - |3 - 2 + 1 - 4| = 1 + 3 - 2 = 2.
In the third sample |2 - 7| + |4 - 6| + |1 - 3| + |5 - 8| - |2 - 7 + 4 - 6 + 1 - 3 + 5 - 8| = 12 - 12 = 0.
题意:
公式。
解题思路:
构造一个d为1的递减数列,那么如果有一对非顺序对(前小后大),那么差值+2.
AC代码:
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
A permutation p is an ordered group of numbers p1, p2, …, pn, consisting of n distinct positive integers, each is no more than n. We’ll define number n as the length of permutation p1, p2, …, pn.
Simon has a positive integer n and a non-negative integer k, such that 2k ≤ n. Help him find permutation a of length 2n, such that it meets this equation: .
Input
The first line contains two integers n and k (1 ≤ n ≤ 50000, 0 ≤ 2k ≤ n).
Output
Print 2n integers a1, a2, …, a2n — the required permutation a. It is guaranteed that the solution exists. If there are multiple solutions, you can print any of them.
Examples
input
1 0
output
1 2
input
2 1
output
3 2 1 4
input
4 0
output
2 7 4 6 1 3 5 8
Note
Record |x| represents the absolute value of number x.
In the first sample |1 - 2| - |1 - 2| = 0.
In the second sample |3 - 2| + |1 - 4| - |3 - 2 + 1 - 4| = 1 + 3 - 2 = 2.
In the third sample |2 - 7| + |4 - 6| + |1 - 3| + |5 - 8| - |2 - 7 + 4 - 6 + 1 - 3 + 5 - 8| = 12 - 12 = 0.
题意:
公式。
解题思路:
构造一个d为1的递减数列,那么如果有一对非顺序对(前小后大),那么差值+2.
AC代码:
#include<bits/stdc++.h> using namespace std; const int maxn =2e5+5; int a[maxn]; int main() { int n,k; scanf("%d%d",&n,&k); n<<=1; int i,j; for(int i = 1,j = n;i <= n;i++,j--) a[i] = j; for(int i = 1;i <= n;i+=2) { if(k) swap(a[i],a[i+1]),k--; else break; } for(int i = 1;i <= n;i++) printf("%s%d",i==1?"":" ",a[i]); return 0; }
相关文章推荐
- Codeforces 864D D. Make a Permutation!【思维+线段树+二分+这是一个煞笔做法】
- 【CodeForces】500B - New Year Permutation(思维)
- CodeForces - 359B Permutation
- Codeforces 483C Diverse Permutation【思维构造】
- Codeforces_359B_Permutation
- Codeforces 500B:New Year Permutation(并查集||Floyd+思维)
- CodeForces - 359B Permutation
- Codeforces 500B - New Year Permutation (思维)
- CodeForces 567B Berland National Library【思维】
- codeforces 705 B. Spider Man (思维)
- Codeforces 272D Dima and Two Sequences【思维+模拟】
- 【数学思维】CodeForces - 233B Non-square Equation
- Codeforces 817C Really Big Numbers【思维+二分】
- Codeforces 864D - Make a Permutation! 【贪心】
- Codeforces 677D Vanya and Treasure【dp+极限思维剪枝】
- Codeforces 602C The Two Routes【最短路+思维】
- Codeforces 313D Ilya and Roads【Dp+思维】
- codeforces- 949B - A Leapfrog in the Array(思维)
- CodeForces - 864D Make a Permutation! 水题(用了优先队列)
- Codeforces 673B Problems for Round【思维】