Submission #3426506


Source Code Expand

#include <cstdio>
#include <iostream>
#include <string>
#include <algorithm>
#include <cstring>
#include <utility>
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <queue>
#include <bitset>
#include <stack>
#include <deque>
using namespace std;
typedef pair<int, int> pii;
typedef long long LL;
const int MAXN = 2345;
int pb[MAXN], pw[MAXN], costw[MAXN][MAXN], costb[MAXN][MAXN];
int dp[MAXN][MAXN];

int main() {
    int N;
    scanf("%d", &N);
    for (int i = 1; i <= 2 * N; i++) {
        int tmp;
        char c;
        scanf(" %c %d", &c, &tmp);
        if (c == 'W') pw[tmp] = i;
        else pb[tmp] = i;
    }
    for (int i = 0; i < N; i++) {
        for (int j = i + 2; j <= N; j++)
            if (pw[j] < pw[i + 1]) costw[i][0]++;
        int sum = 0;
        costw[i][N] = costw[i][0];
        for (int j = N; j >= 1; j--) {
            if (pb[j] < pw[i + 1]) sum++;
            costw[i][j - 1] = costw[i][0] + sum;
        }
    }
    for (int i = 0; i < N; i++) {
        for (int j = i + 2; j <= N; j++)
            if (pb[j] < pb[i + 1]) costb[0][i]++;
        int sum = 0;
        costb[N][i] = costb[0][i];
        for (int j = N; j >= 1; j--) {
            if (pw[j] < pb[i + 1]) sum++;
            costb[j - 1][i] = costb[0][i] + sum;
        }
    }
    for (int i = 0; i <= N; i++) {
        for (int j = 0; j <= N; j++) {
            if (!i && !j) continue;
            if (!i) dp[i][j] = dp[i][j - 1] + costb[0][j - 1];
            else if (!j) dp[i][j] = dp[i - 1][j] + costw[i - 1][0];
            else dp[i][j] = min(dp[i - 1][j] + costw[i - 1][j], dp[i][j - 1] + costb[i][j - 1]);
        }
    }
    printf("%d\n", dp[N][N]);
    return 0;
}

Submission Info

Submission Time
Task E - Sorted and Sorted
User BOT
Language C++14 (GCC 5.4.1)
Score 600
Code Size 1761 Byte
Status AC
Exec Time 52 ms
Memory 59648 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:24:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &N);
                    ^
./Main.cpp:28:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf(" %c %d", &c, &tmp);
                                  ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 600 / 600
Status
AC × 3
AC × 36
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 6400 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 6400 KB
1_007.txt AC 2 ms 6400 KB
1_008.txt AC 2 ms 6400 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 41 ms 53504 KB
1_015.txt AC 10 ms 24320 KB
1_016.txt AC 32 ms 47360 KB
1_017.txt AC 16 ms 32768 KB
1_018.txt AC 2 ms 6784 KB
1_019.txt AC 7 ms 20096 KB
1_020.txt AC 37 ms 51456 KB
1_021.txt AC 16 ms 34816 KB
1_022.txt AC 10 ms 26368 KB
1_023.txt AC 28 ms 47360 KB
1_024.txt AC 42 ms 59648 KB
1_025.txt AC 51 ms 59648 KB
1_026.txt AC 52 ms 59648 KB
1_027.txt AC 51 ms 59648 KB
1_028.txt AC 51 ms 59648 KB
1_029.txt AC 52 ms 59648 KB
1_030.txt AC 51 ms 59648 KB
1_031.txt AC 51 ms 59648 KB
1_032.txt AC 43 ms 59648 KB
1_033.txt AC 43 ms 59648 KB
1_034.txt AC 43 ms 59648 KB
1_035.txt AC 43 ms 59648 KB