提出 #66936150

---

ソースコード 拡げる

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
#define int ll
using pii = pair<int, int>;
#define overload3(_1, _2, _3, f, ...) f
#define v1_rep(n) for (int _n = (n); _n--; )
#define v2_rep(i, n) if (const int _n = (n); true) for (int i = 0; i < _n; i++)
#define v3_rep(i, a, b) if (const int _b = (b); true) for (int i = (a); i < _b; i++)
#define rep(...) overload3(__VA_ARGS__, v3_rep, v2_rep, v1_rep)(__VA_ARGS__)
#define v2_repR(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define v3_repR(i, a, b) if (const int _a = (a); true) for (int i = int(b)-1; i >= _a; i--)
#define repR(...) overload3(__VA_ARGS__, v3_repR, v2_repR, v1_rep)(__VA_ARGS__)
#define rep1(i, n) if (const int _rep_n = n; true) for (int i = 1; i <= _rep_n; i++)
#define rep1R(i, n) for (int i = (int)(n); i >= 1; i--)
#define loop(i, a, B) for (int i = a; i B; i++)
#define loopR(i, a, B) for (int i = a; i B; i--)
#define all(x) begin(x), end(x)
#define allR(x) rbegin(x), rend(x)
#define pb push_back
#define eb emplace_back
#define fst first
#define snd second
template <class Int> auto constexpr inf_ = numeric_limits<Int>::max()/2-1;
[[maybe_unused]] auto constexpr INF32 = inf_<int32_t>;
[[maybe_unused]] auto constexpr INF64 = inf_<int64_t>;
[[maybe_unused]] auto constexpr INF   = inf_<int>;
#ifdef LOCAL
#include "debug.hpp"
#define oj_local(x, y) (y)
#else
#define dump(...) ([]() { return false; }())
#define if_debug if (0)
#define oj_local(x, y) (x)
#endif

template <class T, class Comp> struct pque : priority_queue<T, vector<T>, Comp> {
  vector<T> &data() { return this->c; }
  void clear() { this->c.clear(); }
};
template <class T> using pque_max = pque<T, less<T>>;
template <class T> using pque_min = pque<T, greater<T>>;

template <class T, class S> ostream& operator<<(ostream& os, pair<T, S> const& p) {
  return os << p.first << " " << p.second;
}
template <class T, class S> istream& operator>>(istream& is, pair<T, S>& p) {
  return is >> p.first >> p.second;
}
template <class... T> ostream& operator<<(ostream& os, tuple<T...> const& t) {
  bool f = true;
  apply([&](auto&&... x) { ((os << (f ? f = false, "" : " ") << x), ...); }, t);
  return os;
}
template <class... T> istream& operator>>(istream& is, tuple<T...>& t) {
  apply([&](auto&&... x) { ((is >> x), ...); }, t);
  return is;
}
template <class T, class = typename T::iterator, enable_if_t<!is_same<T, string>::value, int> = 0>
ostream& operator<<(ostream& os, T const& a) {
  bool f = true;
  for (auto const& x : a) os << (f ? "" : " ") << x, f = false;
  return os;
}
template <class T, size_t N, enable_if_t<!is_same<T, char>::value, int> = 0>
ostream& operator<<(ostream& os, const T (&a)[N]) {
  bool f = true;
  for (auto const& x : a) os << (f ? "" : " ") << x, f = false;
  return os;
}
template <class T, class = decltype(begin(declval<T&>())), class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &a) { for (auto& x : a) is >> x; return is; }
struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(15);
  }
} iosetup;

template <class F> struct FixPoint : private F {
  constexpr FixPoint(F&& f) : F(std::forward<F>(f)) {}
  template <class... T> constexpr auto operator()(T&&... x) const {
    return F::operator()(*this, std::forward<T>(x)...);
  }
};
struct MakeFixPoint {
  template <class F> constexpr auto operator|(F&& f) const {
    return FixPoint<F>(std::forward<F>(f));
  }
};
#define def(name, ...) auto name = MakeFixPoint() | [&](auto &&name, __VA_ARGS__)

template <class F> struct FixPoint_d : private F {
  const char* const name;
  static inline int level = 0;
  constexpr FixPoint_d(F&& f, const char* name) : F(std::forward<F>(f)), name(name) {}
  template <class... T> constexpr auto operator()(T&&... x) const {
    if constexpr (is_same_v<void, decltype(F::operator()(*this, std::forward<T>(x)...))>) {
#ifdef LOCAL
      cerr << string(level, '|') << name << to_s(tuple(x...)) << '\n';
#endif
      ++level;
      F::operator()(*this, std::forward<T>(x)...);
      --level;
#ifdef LOCAL
      cerr << string(level, '|') << name << to_s(tuple(x...)) << " -> void" << '\n';
#endif
    } else {
#ifdef LOCAL
      cerr << string(level, '|') << name << to_s(tuple(x...)) << '\n';
#endif
      ++level;
      auto ret = F::operator()(*this, std::forward<T>(x)...);
      --level;
#ifdef LOCAL
      cerr << string(level, '|') << name << to_s(tuple(x...)) << " -> " << to_s(ret) << '\n';
#endif
      return ret;
    }
  }
};
struct MakeFixPoint_d {
  const char* const name;
  MakeFixPoint_d(const char* name) : name(name) {}
  template <class F> constexpr auto operator|(F&& f) const {
    return FixPoint_d<F>(std::forward<F>(f), name);
  }
};
#ifdef LOCAL
#define def_d(name, ...) auto name = MakeFixPoint_d(#name) | [&](auto &&name, __VA_ARGS__)
#else
#define def_d def
#endif

struct Reader {
  template <class T> T get() const{ T x; cin >> x; return x; }
  template <class T> operator T() const { return get<T>(); }
  template <class... T> void operator()(T&... args) const { ((cin >> args), ...); }
} input;

namespace impl {

template <class T, size_t d> struct mvec { using type = vector<typename mvec<T, d-1>::type>; };
template <class T> struct mvec<T, 0> { using type = T; };

template <size_t i, size_t... j>
constexpr size_t head(index_sequence<i, j...>) { return i; }

template <size_t i, size_t... j>
constexpr auto tail(index_sequence<i, j...>) { return index_sequence<j...>{}; }

template <class T, size_t... i, size_t d, class Value>
auto make_v(index_sequence<i...>, const int (&s)[d], Value const& x) {
  if constexpr (sizeof...(i) == 0) {
    return (T)x;
  } else {
    typename mvec<T, sizeof...(i)>::type ret;
    auto idx = index_sequence<i...>{};
    int n = s[head(idx)];
    if (n < 0) cerr << "[error] negative size: {" << s << "}\n", abort();
    ret.reserve(n);
    while (n-- > 0) ret.emplace_back(make_v<T>(tail(idx), s, x));
    return ret;
  }
}
} // namespace impl

template <class T, size_t d = 1> using mvec = typename impl::mvec<T, d>::type;

template <class T, size_t d, class Value> auto make_v(const int (&s)[d], Value const& x) {
  return impl::make_v<T>(make_index_sequence<d>{}, s, x);
}

template <class T, size_t d> auto make_v(const int (&s)[d]) {
  return impl::make_v<T>(make_index_sequence<d>{}, s, T{});
}

template <class T, class... Size> auto make_v(Size... s) {
  return impl::make_v<T>(make_index_sequence<sizeof...(s)>{}, (int[sizeof...(s)]){s...}, T{});
}

template <class T> void quit(T const& x) { cout << x << '\n'; exit(0); }
template <class T, class U> constexpr bool chmin(T& x, U const& y) {
  return x > y ? x = y, true : false;
}
template <class T, class U> constexpr bool chmax(T& x, U const& y) {
  return x < y ? x = y, true : false;
}
template <class It> constexpr auto sumof(It b, It e) {
  return accumulate(b, e, typename iterator_traits<It>::value_type{});
}
template <class T, class = decltype(begin(declval<T&>()))>
constexpr auto min(T const& a) { return *min_element(begin(a), end(a)); }
template <class T, class = decltype(begin(declval<T&>()))>
constexpr auto max(T const& a) { return *max_element(begin(a), end(a)); }
template <class T> constexpr T min(set<T> const& st) { assert(st.size()); return *st.begin(); }
template <class T> constexpr T max(set<T> const& st) { assert(st.size()); return *prev(st.end()); }
template <class T> constexpr T min(multiset<T> const& st) { assert(st.size()); return *st.begin(); }
template <class T> constexpr T max(multiset<T> const& st) { assert(st.size()); return *prev(st.end()); }
constexpr ll max(signed x, ll y) { return max<ll>(x, y); }
constexpr ll max(ll x, signed y) { return max<ll>(x, y); }
constexpr ll min(signed x, ll y) { return min<ll>(x, y); }
constexpr ll min(ll x, signed y) { return min<ll>(x, y); }
constexpr pair<ll, ll> div(signed x, ll y) { return {x / y, x % y}; }
constexpr pair<ll, ll> div(ll x, signed y) { return {x / y, x % y}; }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T>
int lbd(C const& v, T const& x) { return lower_bound(begin(v), end(v), x) - begin(v); }
template <class C, class T>
int ubd(C const& v, T const& x) { return upper_bound(begin(v), end(v), x) - begin(v); }
constexpr ll mod(ll x, ll m) { assert(m > 0); return (x %= m) < 0 ? x+m : x; }
constexpr ll div_floor(ll x, ll y) { assert(y != 0); return x/y - ((x^y) < 0 and x%y); }
constexpr ll div_ceil(ll x, ll y) { assert(y != 0); return x/y + ((x^y) > 0 and x%y); }
[[maybe_unused]] constexpr int dx[] = { 1, 0, -1, 0, 1, -1, -1, 1 };
[[maybe_unused]] constexpr int dy[] = { 0, 1, 0, -1, 1, 1, -1, -1 };
vector<int> iota(int n) {
  vector<int> idx(n);
  iota(begin(idx), end(idx), 0);
  return idx;
}
template <class Comp> vector<int> iota(int n, Comp comp) {
  vector<int> idx(n);
  iota(begin(idx), end(idx), 0);
  stable_sort(begin(idx), end(idx), comp);
  return idx;
}
constexpr int popcnt(ll x) { return __builtin_popcountll(x); }
mt19937_64 seed_{random_device{}()};
template <class Int> Int rand(Int a, Int b) { return uniform_int_distribution<Int>(a, b)(seed_); }
i64 irand(i64 a, i64 b) { return rand<i64>(a, b); } // [a, b]
u64 urand(u64 a, u64 b) { return rand<u64>(a, b); } //
template <class It> void shuffle(It l, It r) { shuffle(l, r, seed_); }
template <class V> V &operator--(V &v) { for (auto &x : v) --x; return v; }
template <class V> V &operator++(V &v) { for (auto &x : v) ++x; return v; }
bool next_product(vector<int> &v, int m) {
  repR (i, v.size()) if (++v[i] < m) return true; else v[i] = 0;
  return false;
}
bool next_product(vector<int> &v, vector<int> const& s) {
  repR (i, v.size()) if (++v[i] < s[i]) return true; else v[i] = 0;
  return false;
}
template <class Vec> int sort_unique(Vec &v) {
  sort(begin(v), end(v));
  v.erase(unique(begin(v), end(v)), end(v));
  return v.size();
}
template <class Vec, class Comp> int sort_unique(Vec &v, Comp comp) {
  sort(begin(v), end(v), comp);
  v.erase(unique(begin(v), end(v)), end(v));
  return v.size();
}
template <class It> auto prefix_sum(It l, It r) {
  vector<typename It::value_type> s = { 0 };
  while (l != r) s.emplace_back(s.back() + *l++);
  return s;
}
template <class It> auto suffix_sum(It l, It r) {
  vector<typename It::value_type> s = { 0 };
  while (l != r) s.emplace_back(*--r + s.back());
  reverse(s.begin(), s.end());
  return s;
}
template <class T> T pop(vector<T> &a) { auto x = a.back(); a.pop_back(); return x; }
template <class T> T pop_back(vector<T> &a) { auto x = a.back(); a.pop_back(); return x; }
template <class T, class V, class C> T pop(priority_queue<T, V, C> &a) { auto x = a.top(); a.pop(); return x; }
template <class T> T pop(queue<T> &a) { auto x = a.front(); a.pop(); return x; }
template <class T> T pop_front(deque<T> &a) { auto x = a.front(); a.pop_front(); return x; }
template <class T> T pop_back(deque<T> &a) { auto x = a.back(); a.pop_back(); return x; }
template <class T> T pop_front(set<T> &a) { auto x = *a.begin(); a.erase(a.begin()); return x; }
template <class T> T pop_back(set<T> &a) { auto it = prev(a.end()); auto x = *it; a.erase(it); return x; }
template <class T> T pop_front(multiset<T> &a) { auto it = a.begin(); auto x = *it; a.erase(it); return x; }
template <class T> T pop_back(multiset<T> &a) { auto it = prev(a.end()); auto x = *it; a.erase(it); return x; }
template <class A, class B>
pair<vector<A>, vector<B>> unzip(vector<pair<A, B>> const& c) {
  vector<A> a;
  vector<B> b;
  for (auto const& [x, y] : c) {
    a.push_back(x);
    b.push_back(y);
  }
  return { a, b };
}
template <class A, class B>
pair<vector<A>, vector<B>> unzip(map<A, B> const& c) {
  vector<A> a;
  vector<B> b;
  for (auto const& [x, y] : c) {
    a.push_back(x);
    b.push_back(y);
  }
  return { a, b };
}
template <class T, class... Int> auto read_v(Int... s) {
  auto x = make_v<T>(s...);
  cin >> x;
  return x;
}

template <class T> auto read_v() {
  T x;
  cin >> x;
  return x;
}

template <class... T, class... Int>
auto read(Int... s) {
  if constexpr (sizeof...(T) >= 2) {
    return read_v<tuple<T...>>(s...);
  } else {
    return read_v<T...>(s...);
  }
}

template <class T, size_t d, class... Int>
auto read(Int... s) {
  return read_v<array<T, d>>(s...);
}
// <<<

int32_t main() {
  int n = input, q = input;

  vector<int> c(n+1);
  int ans = 0;
  rep (q) {
    int a = input;
    --a;

    rep (i, 2) {
      int j = a-1+i;
      if (0 <= j and j < n) {
        ans -= (c[j] == 1 and c[j+1] == 0);
      }
    }
    c[a] ^= 1;
    rep (i, 2) {
      int j = a-1+i;
      if (0 <= j and j < n) {
        ans += (c[j] == 1 and c[j+1] == 0);
      }
    }

    cout << ans << '\n';
  }
}

提出情報

ジャッジ結果