Codeforces Round #277.5 (Div. 2)(一)

In this problem your goal is to sort an array consisting of n integers in at most n swaps. For the given array find the sequence of swaps that makes the array sorted in the non-descending order. Swaps are performed consecutively, one after another.

Note that in this problem you do not have to minimize the number of swaps ― your task is to find any sequence that is no longer than n.

The first line of the input contains integer n (1 ≤ n ≤ 3000) ― the number of array elements. The second line contains elements of array: a0, a1, ..., an - 1 ( - 109 ≤ ai ≤ 109), where ai is the i-th element of the array. The elements are numerated from 0 to n - 1 from left to right. Some integers may appear in the array more than once.

In the first line print k (0 ≤ k ≤ n) ― the number of swaps. Next k lines must contain the descriptions of the k swaps, one per line. Each swap should be printed as a pair of integers i, j (0 ≤ i, j ≤ n - 1), representing the swap of elements ai and aj. You can print indices in the pairs in any order. The swaps are performed in the order they appear in the output, from the first to the last. It is allowed to print i = jand swap the same pair of elements multiple times.

If there are multiple answers, print any of them. It is guaranteed that at least one answer exists.

5
5 2 5 1 4

2
0 3
4 2

6
10 20 20 40 60 60

0

2
101 100

1
0 1






#include 
   
    
#include 
    
      #include 
     
       #include 
      
        using namespace std; int a[3010]; int b[120]; int vis[120]; typedef pair
       
         P; P m[3010]; int main() { #ifdef xxz freopen("in.txt","r",stdin); #endif // [xxz int n; cin>>n; for(int i = 0; i < n; i++) cin>>a[i]; int sum = 0,ans = 0; int i,j; for(i = 0; i < n; i++) { int x = a[i]; int y = i; for( j = i+1; j < n; j++) { if(x > a[j]) { x = a[j]; y = j; } } if(y != i) { m[sum].first = i; m[sum++].second = y; swap(a[i],a[y]); ans++; } } cout<
        
         

         
B. BerSU Balltime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard output
         
The Berland State University is hosting a ballroom dance in celebration of its 100500-th anniversary! n boys and m girls are already busy rehearsing waltz, minuet, polonaise and quadrille moves.
         
We know that several boy&girl pairs are going to be invited to the ball. However, the partners' dancing skill in each pair must differ by at most one.
         
For each boy, we know his dancing skills. Similarly, for each girl we know her dancing skills. Write a code that can determine the largest possible number of pairs that can be formed from n boys and m girls.
Input
         
The first line contains an integer n (1 ≤ n ≤ 100) ― the number of boys. The second line contains sequence a1, a2, ..., an (1 ≤ ai ≤ 100), where ai is the i-th boy's dancing skill.
         
Similarly, the third line contains an integer m (1 ≤ m ≤ 100) ― the number of girls. The fourth line contains sequence b1, b2, ..., bm (1 ≤ bj ≤ 100), where bj is the j-th girl's dancing skill.
Output
         
Print a single number ― the required maximum possible number of pairs.
Sample test(s)input
         
4
1 4 6 2
5
5 1 5 7 9
output
         
3
input
         
4
1 2 3 4
4
10 11 12 13
output
         
0
input
         
5
1 1 1 1 1
3
1 2 3
output
         
2

         

         
#include 
          
           
#include 
           
             #include 
            
              #include 
             
               using namespace std; int a[120]; int b[120]; int vis[120]; int main() { #ifdef xxz freopen("in.txt","r",stdin); #endif // [xxz int n,m; cin>>n; for(int i = 0; i < n; i++) cin>>a[i]; sort(a,a+n); cin>>m; for(int i = 0; i < m; i++) cin>>b[i],vis[i] = 0; sort(b,b+m); int sum = 0; int j; for(int i =0; i < n; i++) { for( int j = 0; j < m; j++) { if(vis[j] == 0 && abs(a[i] - b[j]) <= 1 ) { sum++; vis[j] = 1; break; } } } cout<
              
               
C. Given Length and Sum of Digits...time limit per test1 secondmemory limit per