Submission #2501800

---

Source Code Expand

//
// Copyright 2018 Authors All Rights Reserved.
//
// FileName: E.cpp
// Author: Beiyu Li <sysulby@gmail.com>
// Date: 2018-05-12
//
#include <bits/stdc++.h>

using namespace std;

#define rep(i,n) for (int i = 0; i < (n); ++i)
#define For(i,s,t) for (int i = (s); i <= (t); ++i)

typedef long long LL;
typedef pair<int, int> Pii;

const int inf = 0x3f3f3f3f;
const LL infLL = 0x3f3f3f3f3f3f3f3fLL;

const int maxn = 2000 + 5;

int n;
int p[2][maxn];
int c[3][maxn*2];
int f[maxn][maxn];

void update(int o, int i, int v)
{
  for (; i <= 2 * n; i += (i & -i)) c[o][i] += v;
}

int query(int o, int i)
{
  int ret = 0;
  for (; i; i -= (i & -i)) ret += c[o][i];
  return ret;
}

int main(int argc, char *argv[])
{
  scanf("%d", &n);
  For(i,1,2*n) {
    char buf[2];
    int a;
    scanf("%s%d", buf, &a);
    p[buf[0]=='B'][a] = i;
    update(0, i, 1);
  }
  For(i,0,n) {
    memcpy(c[1], c[0], sizeof(c[0]));
    if (i) update(0, p[0][i], -1);
    memcpy(c[2], c[0], sizeof(c[0]));
    For(j,i==0,n) {
      f[i][j] = inf;
      if (i) {
        if (j) update(1, p[1][j], -1);
        f[i][j] = min(f[i][j], f[i-1][j] + query(1, p[0][i] - 1));
      }
      if (j) {
        f[i][j] = min(f[i][j], f[i][j-1] + query(2, p[1][j] - 1));
        update(2, p[1][j], -1);
      }
    }
  }
  printf("%d\n", f[n][n]);

  return 0;
}

Submission Info

Compile Error

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

Judge Result