Submission #8458901
Source Code Expand
#include<iostream> #include<algorithm> #include<vector> #include<functional> using namespace std; typedef pair<char, int> P; typedef long long ll; int N; vector<int> A, B; vector<P> in; int dp[2001][2001];//Aがi番目まで整序されて、Bがj番目まで整序されてる時の最小手数 int costA[2001][2001], costB[2001][2001]; int cntA[2000], cntB[2000]; int main() { cin >> N; A.resize(N), B.resize(N), in.resize(2 * N); for (int i = 0; i < 2 * N; i++) { cin >> in[i].first >> in[i].second; in[i].second--; } for (int i = 0; i < 2 * N; i++) { int sumA[2001] = {}, sumB[2001] = {}; for (int j = N - 1; j >= 0; j--) { sumA[j] = sumA[j + 1] + cntA[j]; sumB[j] = sumB[j + 1] + cntB[j]; } int num = in[i].second; for (int j = 0; j <= N; j++) { if (in[i].first == 'B') { costA[num][j] = sumA[num + 1] + sumB[j]; } else { costB[j][num] = sumA[j] + sumB[num + 1]; } } if (in[i].first == 'B')cntA[num]++; else cntB[num]++; } for (int i = 0; i <= N; i++)for (int j = 0; j <= N; j++) if (!(i == 0 && j == 0))dp[i][j] = 1145141919; dp[0][0] = 0; for (int i = 0; i <= N; i++) { for (int j = 0; j <= N; j++) { if (i + 1 <= N) { dp[i + 1][j] = min(dp[i][j] + costA[i][j], dp[i + 1][j]); } if (j + 1 <= N) { dp[i][j + 1] = min(dp[i][j] + costB[i][j], dp[i][j + 1]); } } } cout << dp[N][N] << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Sorted and Sorted |
User | Sen |
Language | C++14 (GCC 5.4.1) |
Score | 600 |
Code Size | 1464 Byte |
Status | AC |
Exec Time | 76 ms |
Memory | 47232 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 | 2 ms | 4352 KB |
0_001.txt | AC | 2 ms | 4352 KB |
0_002.txt | AC | 2 ms | 4352 KB |
1_003.txt | AC | 2 ms | 4352 KB |
1_004.txt | AC | 2 ms | 4352 KB |
1_005.txt | AC | 2 ms | 4352 KB |
1_006.txt | AC | 2 ms | 4352 KB |
1_007.txt | AC | 2 ms | 4352 KB |
1_008.txt | AC | 2 ms | 4352 KB |
1_009.txt | AC | 2 ms | 4352 KB |
1_010.txt | AC | 2 ms | 4352 KB |
1_011.txt | AC | 2 ms | 4352 KB |
1_012.txt | AC | 2 ms | 4352 KB |
1_013.txt | AC | 2 ms | 4352 KB |
1_014.txt | AC | 63 ms | 45440 KB |
1_015.txt | AC | 13 ms | 20480 KB |
1_016.txt | AC | 44 ms | 41216 KB |
1_017.txt | AC | 21 ms | 28928 KB |
1_018.txt | AC | 3 ms | 6912 KB |
1_019.txt | AC | 10 ms | 18304 KB |
1_020.txt | AC | 50 ms | 43264 KB |
1_021.txt | AC | 22 ms | 28928 KB |
1_022.txt | AC | 14 ms | 22528 KB |
1_023.txt | AC | 43 ms | 41216 KB |
1_024.txt | AC | 71 ms | 46976 KB |
1_025.txt | AC | 71 ms | 47232 KB |
1_026.txt | AC | 70 ms | 47232 KB |
1_027.txt | AC | 72 ms | 47232 KB |
1_028.txt | AC | 72 ms | 47232 KB |
1_029.txt | AC | 72 ms | 47232 KB |
1_030.txt | AC | 73 ms | 47232 KB |
1_031.txt | AC | 73 ms | 47232 KB |
1_032.txt | AC | 67 ms | 47232 KB |
1_033.txt | AC | 69 ms | 47232 KB |
1_034.txt | AC | 76 ms | 47232 KB |
1_035.txt | AC | 75 ms | 47232 KB |