C. Swaps CodeForces 134C

C. Swaps CodeForces 134C

There are n players sitting at a round table. All of them have s cards of n colors in total. Besides, initially the first person had cards of only the first color, the second one had cards of only the second color and so on. They can swap the cards by the following rules:

• as the players swap, a player can give a card of his color only;
• a player can't accept a card of a color he already has (particularly, he can't take cards of his color, no matter whether he has given out all of them or not);
• during one swap a pair of people swaps cards (each person gives one card and takes one card).

  The aim of all n people is as follows: each of them should give out all the cards he had initially (that is, all cards of his color). Your task is to denote whether such sequence of swaps is possible. If the answer is positive, you should list all the swaps.

  Input

  The first line contains integers n (1?≤?n?≤?200000) and s (1?≤?s?≤?200000). The second line contains n numbers, the i-th number stands for how many cards the i-th player has by the moment the game starts. It is possible that a player has no cards initially.

  Output

  On the first line print "No" if such sequence of swaps is impossible. Otherwise, print "Yes". If the answer is positive, next print number k — the number of the swaps. Then on k lines describe the swaps by pairs of indices of the swapping players. Print the swaps and the numbers of the swaps in any order.

  Sample test(s) input

  4 8
  2 2 2 2
  

  output

  Yes
  4
  4 3
  4 2
  1 3
  1 2
  

  input

  6 12
  1 1 2 2 3 3
  

  output

  Yes
  6
  6 5
  6 4
  6 3
  5 4
  5 3
  2 1
  

  input

  5 5
  0 0 0 0 5
  

  output

  No
  

  
  
  

   

  題意有三個條件

  1.每個人交換的時候只能交換自己獨有的顏色

  2.每個人不能接受自己已經有的顏色或者自己的顏色即使當前手中已經沒有自己的顏色了

  3.每個人每次交換的時候就互換一下各自的卡片

   

  優先隊列+bfs 類似於一個模擬的過程，這裡比較巧妙的用到了make_pair()函數，相當於一個first second的結構體

   

   

  #include 
  #include 
  #include 
  #include 
  #include 
  #include 
  #include 
  #define N 222222
  #define ll __int64
  #define INF 0x3f3f3f
  using namespace std;
  
  typedef pairpp;
  pp ans[N];
  
  int a,b;
  int x;
  int n,s;
  
  int main()
  {
      cin>>n>>s;
  
      priority_queueq;
  
      for(int i=1;i<=n;i++)
      {
          scanf("%d",&x);
          q.push(make_pair(x,i));
      }
  
      //	for(int i=1;i<=n;i++)//先按first從大到小排序，再按second從大到小排序
  //	{
  //	    pp a;
  //	    a=q.top();
  //	    q.pop();
  //	    cout<