結果

問題 No.833 かっこいい電車
ユーザー hamrayhamray
提出日時 2021-04-03 22:17:51
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 405 ms / 2,000 ms
コード長 6,518 bytes
コンパイル時間 2,517 ms
コンパイル使用メモリ 182,196 KB
実行使用メモリ 9,716 KB
最終ジャッジ日時 2024-06-07 13:15:53
合計ジャッジ時間 7,630 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 405 ms
6,384 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 2 ms
5,376 KB
testcase_07 AC 2 ms
5,376 KB
testcase_08 AC 2 ms
5,376 KB
testcase_09 AC 2 ms
5,376 KB
testcase_10 AC 201 ms
6,536 KB
testcase_11 AC 256 ms
9,308 KB
testcase_12 AC 67 ms
6,120 KB
testcase_13 AC 52 ms
5,376 KB
testcase_14 AC 187 ms
9,320 KB
testcase_15 AC 81 ms
6,356 KB
testcase_16 AC 35 ms
6,744 KB
testcase_17 AC 72 ms
5,376 KB
testcase_18 AC 239 ms
6,692 KB
testcase_19 AC 42 ms
6,560 KB
testcase_20 AC 8 ms
5,376 KB
testcase_21 AC 214 ms
5,376 KB
testcase_22 AC 80 ms
9,516 KB
testcase_23 AC 53 ms
6,716 KB
testcase_24 AC 86 ms
9,344 KB
testcase_25 AC 244 ms
6,500 KB
testcase_26 AC 53 ms
8,936 KB
testcase_27 AC 150 ms
6,736 KB
testcase_28 AC 117 ms
5,376 KB
testcase_29 AC 129 ms
6,256 KB
testcase_30 AC 48 ms
9,716 KB
testcase_31 AC 145 ms
6,632 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>

using namespace std;

typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<int, int> pii;
typedef pair<long long, long long> PLL;
typedef pair<int, PII> TIII;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;


#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(x) x.begin(), x.end()

#define MOD 1000000007

template<class T1, class T2> inline bool chmax(T1 &a, T2 b) {if (a < b) {a = b; return true;} return false;}
template<class T1, class T2> inline bool chmin(T1 &a, T2 b) {if (a > b) {a = b; return true;} return false;}
const double EPS = 1e-12, PI = acos(-1);
const double pi = 3.141592653589793238462643383279;
  
typedef string::const_iterator State;
ll GCD(ll a, ll b){
  return (b==0)?a:GCD(b, a%b);
}
ll LCM(ll a, ll b){
  return a/GCD(a, b) * b;
}
template< int mod >
struct ModInt {
  int x;

  ModInt() : x(0) {}

  ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

  ModInt &operator+=(const ModInt &p) {
    if((x += p.x) >= mod) x -= mod;
    return *this;
  }

  ModInt &operator-=(const ModInt &p) {
    if((x += mod - p.x) >= mod) x -= mod;
    return *this;
  }

  ModInt &operator*=(const ModInt &p) {
    x = (int) (1LL * x * p.x % mod);
    return *this;
  }

  ModInt &operator/=(const ModInt &p) {
    *this *= p.inverse();
    return *this;
  }

  ModInt operator-() const { return ModInt(-x); }

  ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }

  ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }

  ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }

  ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }

  bool operator==(const ModInt &p) const { return x == p.x; }

  bool operator!=(const ModInt &p) const { return x != p.x; }

  ModInt inverse() const {
    int a = x, b = mod, u = 1, v = 0, t;
    while(b > 0) {
      t = a / b;
      swap(a -= t * b, b);
      swap(u -= t * v, v);
    }
    return ModInt(u);
  }

  ModInt pow(int64_t n) const {
    ModInt ret(1), mul(x);
    while(n > 0) {
      if(n & 1) ret *= mul;
      mul *= mul;
      n >>= 1;
    }
    return ret;
  }

  friend ostream &operator<<(ostream &os, const ModInt &p) {
    return os << p.x;
  }

  friend istream &operator>>(istream &is, ModInt &a) {
    int64_t t;
    is >> t;
    a = ModInt< mod >(t);
    return (is);
  }

  static int get_mod() { return mod; }
};

using modint = ModInt< 1000000007 >;
template< typename T >
struct Combination {
  vector< T > _fact, _rfact, _inv;

  Combination(int sz) : _fact(sz + 1), _rfact(sz + 1), _inv(sz + 1) {
    _fact[0] = _rfact[sz] = _inv[0] = 1;
    for(int i = 1; i <= sz; i++) _fact[i] = _fact[i - 1] * i;
    _rfact[sz] /= _fact[sz];
    for(int i = sz - 1; i >= 0; i--) _rfact[i] = _rfact[i + 1] * (i + 1);
    for(int i = 1; i <= sz; i++) _inv[i] = _rfact[i] * _fact[i - 1];
  }

  inline T fact(int k) const { return _fact[k]; }

  inline T rfact(int k) const { return _rfact[k]; }

  inline T inv(int k) const { return _inv[k]; }

  T P(int n, int r) const {
    if(r < 0 || n < r) return 0;
    return fact(n) * rfact(n - r);
  }

  T C(int p, int q) const {
    if(q < 0 || p < q) return 0;
    return fact(p) * rfact(q) * rfact(p - q);
  }

  T H(int n, int r) const {
    if(n < 0 || r < 0) return (0);
    return r == 0 ? 1 : C(n + r - 1, r);
  }
};

ll modpow(ll x, ll n, ll mod) {
  ll res = 1;
  while(n) {
    if(n&1) res = (res * x) % mod;
    x = (x * x) % mod;
    n >>= 1;
  }
  return res;
}

inline long long mod(long long a, long long m) {
    return (a % m + m) % m;
}
template <typename Monoid>
struct SegmentTree{

  int N;
  vector<Monoid> node;
  Monoid Unit;
  function<Monoid(Monoid, Monoid)> f;

  SegmentTree(vector<Monoid> v, const function<Monoid(Monoid, Monoid)> f, const Monoid &Unit): f(f), Unit(Unit){
    int sz_ = v.size();
    N = 1;
    while(N < sz_) N *= 2;

    node.assign(2*N, Unit);
    for(int i=0; i<sz_; i++) node[i+N-1] = v[i];
    for(int i=N-2; i>=0; i--) node[i] = f(node[2*i+1], node[2*i+2]);
  }

  void update(int k, const Monoid &x) {
    k += N-1;
    node[k] += x;
    while(k > 0){
      k = (k-1)/2;
      node[k] = f(node[2*k+1], node[2*k+2]);
    }
  }

  Monoid query(int a, int b, int k=0, int l = 0, int r=-1){
    if(r < 0) r = N;
    if(r <= a || b <= l) return Unit;
    if(a <= l && r <= b) return node[k];
    else{
      Monoid vl = query(a, b, 2*k+1, l, (l+r)/2);
      Monoid vr = query(a, b, 2*k+2, (l+r)/2, r);
      return f(vl, vr);
    }
  }

  int find_first(int a, int b, Monoid x, int k=0, int l=0, int r=-1){
    if(r < 0) r = N;
    if(node[k] < x || r <= a || b <= l) return b;
    if(k >= N-1) return (k-(N-1));
    int res = find_first(a, b, x, 2*k+1, l, (l+r)/2);
    if(res != b) return res;
    return find_first(a, b, x, 2*k+2, (l+r)/2, r);
  }
    
  int find_last(int a, int b, Monoid x, int k=0, int l=0, int r=-1){
    if(r < 0) r = N;
    if(node[k] < x || r <= a || b <= l) return a-1;
    if(k >= N-1) return (k-(N-1));
    int res = find_last(a, b, x, 2*k+2, (l+r)/2, r);
    if(res != a-1) return res;
    return find_last(a, b, x, 2*k+1, l, (l+r)/2);
  }
  inline Monoid operator[](int a) { return query(a, a + 1); }
};
int main()
{
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(2);
  
  int N, Q; cin >> N >> Q;
  vector<ll> A(N);
  REP(i,N) cin >> A[i];
  SegmentTree<ll> seg(A, [](ll a, ll b){return a+b;}, 0LL);
  vector<ll> B(N-1,0);
  SegmentTree<ll> seg2(B, [](ll a, ll b){return a+b;}, 0LL);
  vector<int> arr(N+1); // iとi+1がつながっているときarr[i] = 1;
  while(Q--) {
    int t, x; cin >> t >> x;
    x--;
    if(t == 1) {
      if(seg2[x] == 0){
        seg2.update(x, 1);
      }
    }else if(t == 2) {
      if(seg2[x] == 1) {
        seg2.update(x, -1);
      }
    }else if(t == 3) {
      seg.update(x, 1);
    }else{
      ll ans = 0;
      ll lb = x, ub = N;
      while(ub-lb>1) {
        ll mid = (ub+lb)/2;
        if(seg2.query(x, mid) == mid-x) lb = mid;
        else ub = mid;
      }
      ll lb2 = -1, ub2 = x;
      while(ub2-lb2>1) {
        ll mid = (ub2+lb2)/2;
        if(seg2.query(mid, x) == x-mid) ub2 = mid;
        else lb2 = mid;
        
      }
      cout << seg.query(ub2,ub) << '\n';
    }

  }
  return 0;
}
0