#724588 (C++17) No.1788 Same Set

提出ソース

結果

問題	No.1788 Same Set
ユーザー	ei1333333
提出日時	2021-12-17 02:51:02
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	7,783 bytes
コンパイル時間	3,572 ms
コンパイル使用メモリ	231,444 KB
実行使用メモリ	10,496 KB
最終ジャッジ日時	2024-09-14 03:00:09
合計ジャッジ時間	38,526 ms
ジャッジサーバーID （参考情報）	judge4 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	6 ms 8,064 KB
testcase_01	AC	6 ms 8,064 KB
testcase_02	AC	6 ms 8,064 KB
testcase_03	AC	6 ms 7,936 KB
testcase_04	AC	6 ms 7,936 KB
testcase_05	AC	6 ms 8,064 KB
testcase_06	AC	6 ms 8,064 KB
testcase_07	AC	6 ms 8,064 KB
testcase_08	AC	6 ms 7,936 KB
testcase_09	AC	6 ms 7,936 KB
testcase_10	AC	6 ms 7,936 KB
testcase_11	AC	12 ms 10,368 KB
testcase_12	AC	15 ms 10,368 KB
testcase_13	AC	17 ms 10,240 KB
testcase_14	AC	22 ms 10,240 KB
testcase_15	AC	30 ms 10,368 KB
testcase_16	AC	57 ms 10,240 KB
testcase_17	WA	-
testcase_18	WA	-
testcase_19	WA	-
testcase_20	AC	24 ms 10,368 KB
testcase_21	AC	32 ms 10,368 KB
testcase_22	AC	60 ms 10,368 KB
testcase_23	AC	58 ms 10,368 KB
testcase_24	WA	-
testcase_25	WA	-
testcase_26	AC	709 ms 10,368 KB
testcase_27	AC	1,105 ms 10,368 KB
testcase_28	WA	-
testcase_29	WA	-
testcase_30	AC	1,107 ms 10,368 KB
testcase_31	WA	-
testcase_32	WA	-
testcase_33	WA	-
testcase_34	AC	2,270 ms 10,368 KB
testcase_35	WA	-
testcase_36	WA	-
testcase_37	WA	-
testcase_38	WA	-

権限があれば一括ダウンロードができます

ソースコード

raw source code

#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2")

#include<bits/stdc++.h>

using namespace std;

using int64 = long long;
const int mod = 1e9 + 7;
// const int mod = 998244353;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in: v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

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

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e: t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}

/**
 * @brief Xor-Shift
 * @docs docs/xor-shift.md
 */
struct XorShift {
private:
  constexpr static double R = 1.0 / 0xffffffff;
  uint64_t x;

public:
  explicit XorShift(uint64_t seed = 88172645463325252ull) : x(seed) {}

  template< typename T = uint64_t >
  inline T get() { // [0, 2^64)
    x ^= x << 7ull;
    x ^= x >> 9ull;
    return x;
  }

  inline uint32_t get(uint32_t r) { // [0, r)
    return ((uint64_t) get< uint32_t >() * r) >> 32ull;
  }

  inline uint32_t get(uint32_t l, uint32_t r) { // [l, r)
    return l + get(r - l);
  }

  inline double probability() { // [0.0, 1.0]
    return get< uint32_t >() * R;
  }
};

const int MAX_V = 4e5;

/**
 * @brief Scanner(高速入力)
 */
struct Scanner {
public:

  explicit Scanner(FILE *fp) : fp(fp) {}

  template< typename T, typename... E >
  void read(T &t, E &... e) {
    read_single(t);
    read(e...);
  }

private:
  static constexpr size_t line_size = 1 << 16;
  static constexpr size_t int_digits = 20;
  char line[line_size + 1] = {};
  FILE *fp = nullptr;
  char *st = line;
  char *ed = line;

  void read() {}

  static inline bool is_space(char c) {
    return c <= ' ';
  }

  void reread() {
    ptrdiff_t len = ed - st;
    memmove(line, st, len);
    char *tmp = line + len;
    ed = tmp + fread(tmp, 1, line_size - len, fp);
    *ed = 0;
    st = line;
  }

  void skip_space() {
    while(true) {
      if(st == ed) reread();
      while(*st && is_space(*st)) ++st;
      if(st != ed) return;
    }
  }

  template< typename T, enable_if_t< is_integral< T >::value, int > = 0 >
  void read_single(T &s) {
    skip_space();
    if(st + int_digits >= ed) reread();
    bool neg = false;
    if(is_signed< T >::value && *st == '-') {
      neg = true;
      ++st;
    }
    typename make_unsigned< T >::type y = *st++ - '0';
    while(*st >= '0') {
      y = 10 * y + *st++ - '0';
    }
    s = (neg ? -y : y);
  }

  template< typename T, enable_if_t< is_same< T, string >::value, int > = 0 >
  void read_single(T &s) {
    s = "";
    skip_space();
    while(true) {
      char *base = st;
      while(*st && !is_space(*st)) ++st;
      s += string(base, st);
      if(st != ed) return;
      reread();
    }
  }

  template< typename T >
  void read_single(vector< T > &s) {
    for(auto &d: s) read(d);
  }
};

/**
 * @brief Printer(高速出力)
 */
struct Printer {
public:
  explicit Printer(FILE *fp) : fp(fp) {}

  ~Printer() { flush(); }

  template< bool f = false, typename T, typename... E >
  void write(const T &t, const E &... e) {
    if(f) write_single(' ');
    write_single(t);
    write< true >(e...);
  }

  template< typename... T >
  void writeln(const T &...t) {
    write(t...);
    write_single('\n');
  }

  void flush() {
    fwrite(line, 1, st - line, fp);
    st = line;
  }

private:
  FILE *fp = nullptr;
  static constexpr size_t line_size = 1 << 16;
  static constexpr size_t int_digits = 20;
  char line[line_size + 1] = {};
  char small[32] = {};
  char *st = line;

  template< bool f = false >
  void write() {}

  void write_single(const char &t) {
    if(st + 1 >= line + line_size) flush();
    *st++ = t;
  }

  template< typename T, enable_if_t< is_integral< T >::value, int > = 0 >
  void write_single(T s) {
    if(st + int_digits >= line + line_size) flush();
    if(s == 0) {
      write_single('0');
      return;
    }
    if(s < 0) {
      write_single('-');
      s = -s;
    }
    char *mp = small + sizeof(small);
    typename make_unsigned< T >::type y = s;
    size_t len = 0;
    while(y > 0) {
      *--mp = y % 10 + '0';
      y /= 10;
      ++len;
    }
    memmove(st, mp, len);
    st += len;
  }

  void write_single(const string &s) {
    for(auto &c: s) write_single(c);
  }

  void write_single(const char *s) {
    while(*s != 0) write_single(*s++);
  }

  template< typename T >
  void write_single(const vector< T > &s) {
    for(size_t i = 0; i < s.size(); i++) {
      if(i) write_single(' ');
      write_single(s[i]);
    }
  }
};

int main() {
  Scanner in(stdin);
  Printer out(stdout);
  int N;
  in.read(N);
  vector< int > A(N), B(N);
  in.read(A, B);
  for(auto &a: A) --a;
  for(auto &a: B) --a;

  XorShift rng;
  vector< uint32_t > P(MAX_V);
  for(auto &p: P) p = rng.get< int >();
  vector< int > last_a(MAX_V, -1), last_b(MAX_V, -1);
  vector< uint32_t > sum(N);
  int64 ret = 0;
  int zero = 0;
  for(int i = 0; i < N; i++) {
    zero++;
    if(last_a[A[i]] < last_b[B[i]]) {
      {
        const int a = last_a[A[i]] + 1;
        const int b = last_b[B[i]] + 1;
        const uint32_t c = P[A[i]];
        for(int j = a; j < b; j++) {
          zero -= sum[j] == 0;
          sum[j] ^= c;
          zero += sum[j] == 0;
        }
      }
      {
        const int a = last_b[B[i]] + 1;
        const int b = i + 1;
        const uint32_t c = P[B[i]] ^ P[A[i]];
        for(int j = a; j < b; j++) {
          zero -= sum[j] == 0;
          sum[j] ^= c;
          zero += sum[j] == 0;
        }
      }
    } else {
      {
        const int a = last_b[B[i]] + 1;
        const int b = last_a[A[i]] + 1;
        const uint32_t c = P[B[i]];
        for(int j = a; j < b; j++) {
          zero -= sum[j] == 0;
          sum[j] ^= c;
          zero += sum[j] == 0;
        }
      }
      {
        const int a = last_a[A[i]] + 1;
        const int b = i + 1;
        const uint32_t c = P[B[i]] ^ P[A[i]];
        for(int j = a; j < b; j++) {
          zero -= sum[j] == 0;
          sum[j] ^= c;
          zero += sum[j] == 0;
        }
      }
    }
    ret += zero;
    last_a[A[i]] = i;
    last_b[B[i]] = i;
  }
  out.writeln(ret);
}

yukicoder

結果

テストケース

ソースコード