結果

問題 No.1282 Display Elements
ユーザー Suu0313Suu0313
提出日時 2020-11-06 22:11:58
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 165 ms / 2,000 ms
コード長 6,792 bytes
コンパイル時間 2,804 ms
コンパイル使用メモリ 204,484 KB
最終ジャッジ日時 2025-01-15 20:50:37
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 24
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;

//typedef
//------------------------------------------
typedef long long LL;
typedef pair<int, int> PII;
typedef pair<LL,LL> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<bool> VB;
typedef vector<VB> VVB;
typedef vector<double> VD;
typedef vector<VD> VVD;
typedef vector<string> VS;
typedef vector<VS> VVS;
typedef vector<char> VC;
typedef vector<VC> VVC;
typedef vector<PII> VPII;
typedef vector<PLL> VPLL;
typedef priority_queue<int> PQGI; //大きい順
typedef priority_queue<int, VI, greater<int>> PQLI;
typedef priority_queue<PII> PQGP;
typedef priority_queue<PII, VPII, greater<PII>> PQLP;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EB emplace_back
#define EF emplace_front
#define PB push_back
#define PF push_front
#define POB pop_back
#define POF pop_front
#define MP make_pair
#define MT make_tuple
#define SZ(a) (int)((a).size())
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define SORTR(c) sort((c).rbegin(), (c).rend())
#define LB lower_bound
#define UB upper_bound
#define NEXP(a) next_permutation((a).begin(),(a).end())
#define FI first
#define SE second

//repetition
//------------------------------------------
#define FOR(i,a,b) for(decltype(b) i=(a); i<(b); i++)
#define REP(i,n)  FOR(i,0,n)
#define FORR(i,a,b) for(decltype(b) i = (b-1); i>=(a); i--)
#define REPR(i,n) FORR(i,0,n)
#define CFOR(i,a,b) for(decltype(b) i=(a); i<=(b); i++)
#define CREP(i,n)  CFOR(i,0,n)
#define CFORR(i,a,b) for(decltype(b) i = (b); i>=(a); i--)
#define CREPR(i,n) CFORR(i,0,n)
#define BFOR(bit,a,b) for(LL bit=(a); bit<(1ll<<(b)); bit++)
#define BREP(bit,n) BFOR(bit,0,n)
#define EACH(ptr,c) for(auto ptr=(c).begin(); ptr!=(c).end(); )

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);
const int INF = INT_MAX/2;
const LL LINF = LLONG_MAX/3;
const int RINF = INT_MIN/2;
const LL RLINF = LLONG_MIN/3;
const LL MOD = 1e9+7;
const LL MODD = 998244353;
const int MAX = 510000;

//math
//-------------------------------------------
template<class T> inline T sqr(T x) { return x*x; }
inline bool Eq(double a, double b) { return fabs(b - a) < EPS; }
template<class T> inline T CEIL(T x, T y) { return (x+y-1)/y; }
template<class T> inline int BC(T x) { return __builtin_popcountll(x); }

//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
inline LL toLL(string s) {LL v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toStr(T x) {ostringstream sout;sout<<x;return sout.str();}

//other
//-------------------------------------------
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

template<typename T>
T Vsum(vector<T> &v){T res(0);for(const auto&x:v) res += x; return res; }
template<typename T>
T Vgcd(vector<T> &v){T res(0);for(const auto&x:v) res=gcd(res,x); return res; }
template<typename T>
T Vlcm(vector<T> &v){T res(1);for(const auto&x:v) res=lcm(res,x); return res; }

template<typename T> T Vmax(vector<T> &v){return *max_element(v.begin(),v.end()); }
template<typename T> T Vmin(vector<T> &v){return *min_element(v.begin(),v.end()); }
template<typename T> void Vadd(vector<T> &v, T a){for(auto&& x : v) x += a; }

template<typename T>
vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>
auto make_v(size_t a,Ts... ts){
  return vector<decltype(make_v(ts...))>(a,make_v(ts...));
}

const vector<int> dx = {1,0,-1,0,1,1,-1,-1};
const vector<int> dy = {0,1,0,-1,1,-1,1,-1};
bool ISIN(int x,int l,int r) { return (l<=x) && (x<r); }

bool cYN(bool fl=true){cout << (fl?"Yes":"No") << endl; return fl; }
bool CYN(bool fl=true){cout << (fl?"YES":"NO") << endl; return fl; }
template<class T>
void COUT(T&& t){ cout << t << endl; }
template<class T,class... Ts>
void COUT(T&& t,Ts&&... ts){ cout << t << " "; COUT(forward<Ts>(ts)...); }

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second; return is;
}
template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 >& p) {
  os << p.first << " " << p.second; return os;
}
template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}
template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < SZ(v); i++) {
    os << v[i] << (i + 1 != SZ(v) ? " " : "");
  }
  return os;
}

template <typename T>
struct BIT{
  int n;
  vector<T> node; //1-indexed
  BIT() : n(0) {}
  BIT(int n_) : n(n_+1), node(n,0){}

  void add(int i, T x){
    if(i==0)return;
    for(int idx = i; idx < n; idx += (idx & -idx)){
      node.at(idx) += x;
    }
  }
  T sum(int i){ //[1,i]
    T s(0);
    for(int idx = i; idx > 0; idx -= (idx & -idx)){
      s += node.at(idx);
    }
    return s;
  }
  T query(int l, int r){ //[l,r)
    return sum(r-1)-sum(l-1); 
  }

  int lower_bound(T w){
    if(w <= 0) return 0;
    int x = 0, r = 1;
    while(r < n) r *= 2;
    for(int len = r; len>0; len>>=1){
      if(x+len<n && node.at(x+len) < w){
        w -= node.at(x+len);
        x += len;
      }
    }
    return x+1;
  }
  /*
  //invension number
  REP(i,N){
    ans += i - bit.sum(a.at(i));
    bit.add(a.at(i),1);
  }
  */
};

template <typename T>
vector<T> Vpress(vector<T> &X) {
    vector<T> vals = X;
    SORT(vals);
    vals.erase(unique(ALL(vals)), vals.end());
    REP(i,SZ(X)){
        X.at(i) = LB(ALL(vals), X.at(i)) - vals.begin();
    }
    return vals;
}
template <typename T>
vector<T> Vpress(vector<T> &C1, vector<T> &C2) {
    vector<T> vals;
    int N = SZ(C1);
    REP(i,N) {
        for (T d = 0; d < 1; d++) {  
            T tc1 = C1[i] + d;
            T tc2 = C2[i] + d;
            vals.push_back(tc1);
            vals.push_back(tc2);
        }
    }
    SORT(vals);
    vals.erase(unique(ALL(vals)), vals.end());
    REP(i,N) {
        C1[i] = LB(ALL(vals), C1[i]) - vals.begin();
        C2[i] = LB(ALL(vals), C2[i]) - vals.begin();
    }
    return vals;
}

int main() {

  // cin.tie(0);
  // ios::sync_with_stdio(false);
  cout << fixed << setprecision(12);

  int N;
  cin >> N;

  BIT<int> bit(MAX);

  VI c(N*2);
  cin >> c;
  Vpress(c);
  Vadd(c,1);

  VI a(c.begin(),c.begin()+N);
  VI b(c.begin()+N,c.end());
  SORT(a);
  

  LL ans = 0;

  REP(i,N) {
    bit.add(b.at(i),1);
    ans += bit.sum(a.at(i)-1);
  }

  COUT(ans);

  return 0;
}
0