Submission #2501763

---

Source Code Expand

#include <bits/stdc++.h>
// iostream is too mainstream
#include <cstdio>
// bitch please
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <cmath>
#include <iomanip>
#include <time.h>
#define dibs reserve
#define OVER9000 1234567890
#define ALL_THE(CAKE,LIE) for(auto LIE =CAKE.begin(); LIE != CAKE.end(); LIE++)
#define tisic 47
#define soclose 1e-8
#define chocolate win
// so much chocolate
#define patkan 9
#define ff first
#define ss second
#define abs(x) ((x < 0)?-(x):x)
#define uint unsigned int
#define dbl long double
#define pi 3.14159265358979323846
using namespace std;
// mylittledoge

typedef long long cat;

#ifdef DONLINE_JUDGE
	// palindromic tree is better than splay tree!
	#define lld I64d
#endif

int main() {
	cin.sync_with_stdio(0);
	cin.tie(0);
	cout << fixed << setprecision(10);
	int N;
	cin >> N;
	vector<int> A(2*N);
	vector<char> C(2*N);
	for(int i = 0; i < 2*N; i++) cin >> C[i] >> A[i];
	vector< vector<int> > pos(2, vector<int>(N));
	for(int i = 0; i < 2*N; i++) pos[C[i] == 'B'][A[i]-1] = i;

	vector< vector<int> > cnt[2];
	for(int k = 0; k < 2; k++) {
		cnt[k].resize(N+1, vector<int>(2*N+1, 0));
		for(int i = 0; i < 2*N; i++) if((C[i] == 'B') == k)
			for(int j = 0; j <= A[i]-1; j++) cnt[k][j][i+1] = 1;
		for(int j = 0; j < N; j++)
			for(int i = 0; i < 2*N; i++) cnt[k][j][i+1] += cnt[k][j][i];
	}

	vector< vector<int> > mincost(N+1, vector<int>(N+1, OVER9000));
	mincost[0][0] = 0;
	for(int i = 0; i <= N; i++) for(int j = 0; j <= N; j++) {
		if(i < N) {
			int p = pos[0][i];
			mincost[i+1][j] = min(mincost[i+1][j], mincost[i][j] + cnt[0][i][p] + cnt[1][j][p]);
		}
		if(j < N) {
			int p = pos[1][j];
			mincost[i][j+1] = min(mincost[i][j+1], mincost[i][j] + cnt[0][i][p] + cnt[1][j][p]);
		}
	}
	cout << mincost[N][N] << "\n";
	return 0;}

// look at my code
// my code is amazing

Submission Info

Judge Result