Submission #2501767
Source Code Expand
#include <bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<map>
#include<cstring>
#include<string>
#include <math.h>
#include<algorithm>
// #include <boost/multiprecision/cpp_int.hpp>
#include<functional>
// #define int long long
#define inf 1000000007
#define pa pair<int,int>
#define ll long long
#define pal pair<double,double>
#define ppap pair<pa,int>
// #define PI 3.14159265358979323846
#define paa pair<int,char>
#define mp make_pair
#define pb push_back
#define EPS (1e-10)
#define equals(a,b) (fabs((a)-(b))<EPS)
int dx[4]={0,-1,0,1};
int dy[4]={1,0,-1,0};
using namespace std;
class pa3{
public:
int x,y,z;
pa3(int x=0,int y=0,int z=0):x(x),y(y),z(z) {}
bool operator < (const pa3 &p) const{
if(x!=p.x) return x<p.x;
if(y!=p.y) return y<p.y;
return z<p.z;
//return x != p.x ? x<p.x: y<p.y;
}
bool operator > (const pa3 &p) const{
if(x!=p.x) return x>p.x;
if(y!=p.y) return y>p.y;
return z>p.z;
//return x != p.x ? x<p.x: y<p.y;
}
bool operator == (const pa3 &p) const{
return x==p.x && y==p.y && z==p.z;
}
bool operator != (const pa3 &p) const{
return !( x==p.x && y==p.y && z==p.z);
}
};
class pa4{
public:
double x;
int y,z,w;
pa4(double x=0,int y=0,int z=0,int w=0):x(x),y(y),z(z),w(w) {}
bool operator < (const pa4 &p) const{
if(x!=p.x) return x<p.x;
if(y!=p.y) return y<p.y;
if(z!=p.z)return z<p.z;
return w<p.w;
//return x != p.x ? x<p.x: y<p.y;
}
bool operator > (const pa4 &p) const{
if(x!=p.x) return x>p.x;
if(y!=p.y) return y>p.y;
if(z!=p.z)return z>p.z;
return w>p.w;
//return x != p.x ? x<p.x: y<p.y;
}
bool operator == (const pa4 &p) const{
return x==p.x && y==p.y && z==p.z &&w==p.w;
}
};
class pa2{
public:
int x,y;
pa2(int x=0,int y=0):x(x),y(y) {}
pa2 operator + (pa2 p) {return pa2(x+p.x,y+p.y);}
pa2 operator - (pa2 p) {return pa2(x-p.x,y-p.y);}
bool operator < (const pa2 &p) const{
return y != p.y ? y<p.y: x<p.x;
}
bool operator > (const pa2 &p) const{
return x != p.x ? x<p.x: y<p.y;
}
bool operator == (const pa2 &p) const{
return abs(x-p.x)==0 && abs(y-p.y)==0;
}
bool operator != (const pa2 &p) const{
return !(abs(x-p.x)==0 && abs(y-p.y)==0);
}
};
#define ppa pair<int,pas>
class Point{
public:
double x,y;
Point(double x=0,double y=0):x(x),y(y) {}
Point operator + (Point p) {return Point(x+p.x,y+p.y);}
Point operator - (Point p) {return Point(x-p.x,y-p.y);}
Point operator * (double a) {return Point(x*a,y*a);}
Point operator / (double a) {return Point(x/a,y/a);}
double absv() {return sqrt(norm());}
double norm() {return x*x+y*y;}
bool operator < (const Point &p) const{
return x != p.x ? x<p.x: y<p.y;
}
bool operator == (const Point &p) const{
return fabs(x-p.x)<EPS && fabs(y-p.y)<EPS;
}
};
typedef Point Vector;
#define pl pair<int,pas>
struct Segment{
Point p1,p2;
};
double dot(Vector a,Vector b){
return a.x*b.x+a.y*b.y;
}
double cross(Vector a,Vector b){
return a.x*b.y-a.y*b.x;
}
bool parareru(Point a,Point b,Point c,Point d){
// if(abs(cross(a-b,d-c))<EPS)cout<<"dd "<<cross(a-b,d-c)<<endl;
return abs(cross(a-b,d-c))<EPS;
}
double distance_ls_p(Point a, Point b, Point c) {
if ( dot(b-a, c-a) < EPS ) return (c-a).absv();
if ( dot(a-b, c-b) < EPS ) return (c-b).absv();
return abs(cross(b-a, c-a)) / (b-a).absv();
}
bool is_intersected_ls(Segment a,Segment b) {
if(a.p1==b.p1||a.p2==b.p1||a.p1==b.p2||a.p2==b.p2) return false;
if(parareru((a.p2),(a.p1),(a.p1),(b.p2))&¶reru((a.p2),(a.p1),(a.p1),(b.p1))){
// cout<<"sss"<<endl;
if(dot(a.p1-b.p1,a.p1-b.p2)<EPS) return true;
if(dot(a.p2-b.p1,a.p2-b.p2)<EPS) return true;
if(dot(a.p1-b.p1,a.p2-b.p1)<EPS) return true;
if(dot(a.p1-b.p2,a.p2-b.p2)<EPS) return true;
return false;
}
else return ( cross(a.p2-a.p1, b.p1-a.p1) * cross(a.p2-a.p1, b.p2-a.p1) < EPS ) && ( cross(b.p2-b.p1, a.p1-b.p1) * cross(b.p2-b.p1, a.p2-b.p1) < EPS );
}
double segment_dis(Segment a,Segment b){
if(is_intersected_ls(a,b))return 0;
double r=distance_ls_p(a.p1, a.p2, b.p1);
r=min(r,distance_ls_p(a.p1, a.p2, b.p2));
r=min(r,distance_ls_p(b.p1, b.p2, a.p2));
r=min(r,distance_ls_p(b.p1, b.p2, a.p1));
return r;
}
Point intersection_ls(Segment a, Segment b) {
Point ba = b.p2-b.p1;
double d1 = abs(cross(ba, a.p1-b.p1));
double d2 = abs(cross(ba, a.p2-b.p1));
double t = d1 / (d1 + d2);
return a.p1 + (a.p2-a.p1) * t;
}
string itos( int i ) {
ostringstream s ;
s << i ;
return s.str() ;
}
int gcd(int v,int b){
if(v>b) return gcd(b,v);
if(v==b) return b;
if(b%v==0) return v;
return gcd(v,b%v);
}
double distans(double x1,double y1,double x2,double y2){
double rr=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
return sqrt(rr);
}
int mod;
int beki(int wa,int rr,int warukazu){
if(rr==0) return 1%warukazu;
if(rr==1) return wa%warukazu;
if(rr%2==1) return (beki(wa,rr-1,warukazu)*wa)%warukazu;
int zx=beki(wa,rr/2,warukazu);
return (zx*zx)%warukazu;
}
double bekid(double w,int r){
if(r==0) return 1.0;
if(r==1) return w;
if(r%2) return bekid(w,r-1)*w;
double f=bekid(w,r/2);
return f*f;
}
/*
int pr[2000010];
int inv[2000010];
int comb(int nn,int rr){
int r=pr[nn]*inv[rr];
r%=mod;
r*=inv[nn-rr];
r%=mod;
return r;
}
void gya(int ert){
pr[0]=1;
for(int i=1;i<ert;i++){
pr[i]=(pr[i-1]*i)%mod;
}
for(int i=0;i<ert;i++) inv[i]=beki(pr[i],mod-2,mod);
}
*/
//priority_queue<pa3,vector<pa3>,greater<pa3>> pq;
//sort(ve.begin(),ve.end(),greater<int>());
//----------------kokomade tenpure------------
//vector<double> ans(100000000),ans2(100000000)
int n;
int num[5000],iro[5000];
int iti[2][5000];
int me[4010][4010]={0};
int dp[4010][2010]={0};
int cn0[4010][2010]={0};
int cn1[4010][2010]={0};
signed main(){
cin>>n;
for(int i=1;i<=2*n;i++){
string s;
int y;
cin>>s>>y;
if(s=="W")iro[i]=0;
else iro[i]=1;
num[i]=y;
iti[iro[i]][num[i]]=i;
}
for(int i=0;i<4010;i++)for(int j=0;j<2010;j++)dp[i][j]=inf;
dp[0][0]=0;
for(int i=1;i<=2*n;i++){
if(iro[i]==0){
cn0[i+1][num[i]]++;
}
else{
cn1[i+1][num[i]]++;
}
}
for(int i=1;i<4010;i++)for(int j=0;j<2010;j++){
cn0[i][j]+=cn0[i-1][j];
cn1[i][j]+=cn1[i-1][j];
}
for(int i=0;i<4010;i++)for(int j=2008;j>=0;j--){
cn0[i][j]+=cn0[i][j+1];
cn1[i][j]+=cn1[i][j+1];
//if(i<7 && j<=3) cout<<i<<" "<<j<<" "<<cn0[i][j]<<" "<<cn1[i][j]<<endl;
}
for(int i=1;i<=2*n;i++)for(int j=0;j<=min(i,n);j++){
int j0=j;
int j1=i-j;
if(j0>0){
int iti0=iti[0][j0];
dp[i][j]=min(dp[i][j],dp[i-1][j-1]+cn0[iti0][j0]+cn1[iti0][j1+1]);
}
if(j1>0){
int iti1=iti[1][j1];
dp[i][j]=min(dp[i][j],dp[i-1][j]+cn0[iti1][j0+1]+cn1[iti1][j1]);
}
// cout<<i<<" "<<j0<<" "<<j1<<" "<<dp[i][j]<<endl;
}
cout<<dp[2*n][n]<<endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
E - Sorted and Sorted |
User |
smiken |
Language |
C++14 (GCC 5.4.1) |
Score |
600 |
Code Size |
13414 Byte |
Status |
AC |
Exec Time |
135 ms |
Memory |
96512 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
600 / 600 |
Status |
|
|
Set Name |
Test Cases |
Sample |
0_000.txt, 0_001.txt, 0_002.txt |
All |
0_000.txt, 0_001.txt, 0_002.txt, 1_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt, 1_015.txt, 1_016.txt, 1_017.txt, 1_018.txt, 1_019.txt, 1_020.txt, 1_021.txt, 1_022.txt, 1_023.txt, 1_024.txt, 1_025.txt, 1_026.txt, 1_027.txt, 1_028.txt, 1_029.txt, 1_030.txt, 1_031.txt, 1_032.txt, 1_033.txt, 1_034.txt, 1_035.txt |
Case Name |
Status |
Exec Time |
Memory |
0_000.txt |
AC |
54 ms |
96512 KB |
0_001.txt |
AC |
54 ms |
96512 KB |
0_002.txt |
AC |
54 ms |
96512 KB |
1_003.txt |
AC |
54 ms |
96512 KB |
1_004.txt |
AC |
54 ms |
96512 KB |
1_005.txt |
AC |
54 ms |
96512 KB |
1_006.txt |
AC |
54 ms |
96512 KB |
1_007.txt |
AC |
53 ms |
96512 KB |
1_008.txt |
AC |
54 ms |
96512 KB |
1_009.txt |
AC |
53 ms |
96512 KB |
1_010.txt |
AC |
53 ms |
96512 KB |
1_011.txt |
AC |
53 ms |
96512 KB |
1_012.txt |
AC |
54 ms |
96512 KB |
1_013.txt |
AC |
53 ms |
96512 KB |
1_014.txt |
AC |
116 ms |
96512 KB |
1_015.txt |
AC |
63 ms |
96512 KB |
1_016.txt |
AC |
100 ms |
96512 KB |
1_017.txt |
AC |
72 ms |
96512 KB |
1_018.txt |
AC |
53 ms |
96512 KB |
1_019.txt |
AC |
60 ms |
96512 KB |
1_020.txt |
AC |
107 ms |
96512 KB |
1_021.txt |
AC |
74 ms |
96512 KB |
1_022.txt |
AC |
64 ms |
96512 KB |
1_023.txt |
AC |
101 ms |
96512 KB |
1_024.txt |
AC |
127 ms |
96512 KB |
1_025.txt |
AC |
131 ms |
96512 KB |
1_026.txt |
AC |
131 ms |
96512 KB |
1_027.txt |
AC |
131 ms |
96512 KB |
1_028.txt |
AC |
133 ms |
96512 KB |
1_029.txt |
AC |
132 ms |
96512 KB |
1_030.txt |
AC |
132 ms |
96512 KB |
1_031.txt |
AC |
131 ms |
96512 KB |
1_032.txt |
AC |
135 ms |
96512 KB |
1_033.txt |
AC |
132 ms |
96512 KB |
1_034.txt |
AC |
135 ms |
96512 KB |
1_035.txt |
AC |
130 ms |
96512 KB |