Submission #3730252

---

Source Code Expand

#include<bits/stdc++.h>
#define fi first
#define se second
#define LL long long

using namespace std;
const int maxn = 2e3 + 5;
typedef pair<int, int> P;
int dp[maxn][maxn];
int pre[maxn << 1][maxn][2];
int a[maxn], b[maxn];
int n;
char s[maxn];
int main() {
#ifdef TT
    freopen("xxx.in", "r", stdin);
#endif // TT
    scanf("%d", &n);
    for(int i = 1, u; i <= n + n; ++i) {
        scanf("%s%d", s, &u);
        if(s[0] == 'W') {
            a[u] = i;
            pre[i][u][0] ++;
        } else {
            b[u] = i;
            pre[i][u][1] ++;
        }
    }
    for(int T = 0; T < 2; ++T) {
        for(int i = 1; i <= n + n; ++i) {
            for(int j = 1; j <= n; ++j) {
                pre[i][j][T] += pre[i - 1][j][T];
            }
        }
        for(int i = 1; i <= n + n; ++i) {
            for(int j = n; j; --j) {
                pre[i][j][T] += pre[i][j + 1][T];
            }
        }
    }
    memset(dp, 0x3f, sizeof(dp));
    dp[0][0] = 0;
    for(int i = 0; i <= n; ++i) {
        for(int j = 0; j <= n; ++j) {
            if(i < n) {
                dp[i + 1][j] = min(dp[i + 1][j], dp[i][j] + pre[a[i + 1]][i + 2][0] + pre[a[i + 1]][j + 1][1]);
            }
            if(j < n) {
                dp[i][j + 1] = min(dp[i][j + 1], dp[i][j] + pre[b[j + 1]][j + 2][1] + pre[b[j + 1]][i + 1][0]);
            }
        }
    }
    cout <<dp[n][n] <<endl;
    return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:18:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
                    ^
./Main.cpp:20:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%s%d", s, &u);
                             ^

Judge Result