Submission #2502454

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define max(a,b) ((a>b)?(a):(b))
#define min(a,b) ((a<b)?(a):(b))

typedef long long LL;


int main(){
  int n;
  cin >> n;
  char c;
  int a;
  vector<int> whitePos(n),whiteNum(n),blackPos(n),blackNum(n);
  int whiteCount=0,blackCount=0;
  for(int i=0;i<2*n;i++){
    cin >> c >> a;
    a--;
    if(c=='W'){
      whitePos[whiteCount]=i;
      whiteNum[a]=whiteCount;
      whiteCount++;
    }else{
      blackPos[blackCount]=i;
      blackNum[a]=blackCount;
      blackCount++;
    }
  }
  int whiteCost=0,blackCost=0;
  for(int i=0;i<n;i++){
    whiteCost+=whitePos[i]-i;
    blackCost+=blackPos[i]-i;
  }
  int ans=0;
  if(whiteCost<blackCost){
    ans=whiteCost;
    for(int i=0;i<n;i++){
      for(int j=i+1;j<n;j++){
        if(whiteNum[i]>whiteNum[j]){
          ans++;
        }
        if(blackNum[i]>blackNum[j]){
          ans++;
        }
      }
    }
  }else{
    ans=blackCost;
    for(int i=0;i<n;i++){
      for(int j=i+1;j<n;j++){
        if(whiteNum[i]>whiteNum[j]){
          ans++;
        }
        if(blackNum[i]>blackNum[j]){
          ans++;
        }
      }
    }
  }
  cout << ans << endl;
  return 0;
}

Submission Info

Judge Result