P4246 [SHOI2008]堵塞的交通 [动态图连通性]

如题，线段树分治就做完了。

// powered by c++11
// by Isaunoya
#include <bits/stdc++.h>

#define rep(i, x, y) for (register int i = (x); i <= (y); ++i)
#define Rep(i, x, y) for (register int i = (x); i >= (y); --i)

using namespace std;
using db = double;
using ll = long long;
using uint = unsigned int;
using ull = unsigned long long;

#define pii pair<int, int>
#define fir first
#define sec second

template <class T>

void cmax(T& x, const T& y) {
  if (x < y) x = y;
}

template <class T>

void cmin(T& x, const T& y) {
  if (x > y) x = y;
}

#define all(v) v.begin(), v.end()
#define sz(v) ((int)v.size())
#define pb emplace_back

template <class T>

void sort(vector<T>& v) {
  sort(all(v));
}

template <class T>

void reverse(vector<T>& v) {
  reverse(all(v));
}

template <class T>

void unique(vector<T>& v) {
  sort(all(v)), v.erase(unique(all(v)), v.end());
}

void reverse(string& s) { reverse(s.begin(), s.end()); }

const int io_size = 1 << 23 | 233;
const int io_limit = 1 << 22;
struct io_in {
  char ch;
#ifndef __WIN64
  char getchar() {
    static char buf[io_size], *p1 = buf, *p2 = buf;

    return (p1 == p2) && (p2 = (p1 = buf) + fread(buf, 1, io_size, stdin), p1 == p2) ? EOF : *p1++;
  }
#endif
  io_in& operator>>(char& c) {
    for (c = getchar(); isspace(c); c = getchar())
      ;

    return *this;
  }
  io_in& operator>>(string& s) {
    for (s.clear(); isspace(ch = getchar());)
      ;

    if (!~ch) return *this;

    for (s = ch; !isspace(ch = getchar()) && ~ch; s += ch)
      ;

    return *this;
  }

  io_in& operator>>(char* str) {
    char* cur = str;
    while (*cur) *cur++ = 0;

    for (cur = str; isspace(ch = getchar());)
      ;
    if (!~ch) return *this;

    for (*cur = ch; !isspace(ch = getchar()) && ~ch; *++cur = ch)
      ;

    return *++cur = 0, *this;
  }

  template <class T>

  void read(T& x) {
    bool f = 0;
    while ((ch = getchar()) < 48 && ~ch) f ^= (ch == 45);

    x = ~ch ? (ch ^ 48) : 0;
    while ((ch = getchar()) > 47) x = x * 10 + (ch ^ 48);
    x = f ? -x : x;
  }

  io_in& operator>>(int& x) { return read(x), *this; }

  io_in& operator>>(ll& x) { return read(x), *this; }

  io_in& operator>>(uint& x) { return read(x), *this; }

  io_in& operator>>(ull& x) { return read(x), *this; }

  io_in& operator>>(db& x) {
    read(x);
    bool f = x < 0;
    x = f ? -x : x;
    if (ch ^ '.') return *this;

    double d = 0.1;
    while ((ch = getchar()) > 47) x += d * (ch ^ 48), d *= .1;
    return x = f ? -x : x, *this;
  }
} in;

struct io_out {
  char buf[io_size], *s = buf;
  int pw[233], st[233];

  io_out() {
    set(7);
    rep(i, pw[0] = 1, 9) pw[i] = pw[i - 1] * 10;
  }

  ~io_out() { flush(); }

  void io_chk() {
    if (s - buf > io_limit) flush();
  }

  void flush() { fwrite(buf, 1, s - buf, stdout), fflush(stdout), s = buf; }

  io_out& operator<<(char c) { return *s++ = c, *this; }

  io_out& operator<<(string str) {
    for (char c : str) *s++ = c;
    return io_chk(), *this;
  }

  io_out& operator<<(char* str) {
    char* cur = str;
    while (*cur) *s++ = *cur++;
    return io_chk(), *this;
  }

  template <class T>

  void write(T x) {
    if (x < 0) *s++ = '-', x = -x;

    do {
      st[++st[0]] = x % 10, x /= 10;
    } while (x);

    while (st[0]) *s++ = st[st[0]--] ^ 48;
  }

  io_out& operator<<(int x) { return write(x), io_chk(), *this; }

  io_out& operator<<(ll x) { return write(x), io_chk(), *this; }

  io_out& operator<<(uint x) { return write(x), io_chk(), *this; }

  io_out& operator<<(ull x) { return write(x), io_chk(), *this; }

  int len, lft, rig;

  void set(int _length) { len = _length; }

  io_out& operator<<(db x) {
    bool f = x < 0;
    x = f ? -x : x, lft = x, rig = 1. * (x - lft) * pw[len];
    return write(f ? -lft : lft), *s++ = '.', write(rig), io_chk(), *this;
  }
} out;
#define int long long

template <int sz, int mod>

struct math_t {
  math_t() {
    fac.resize(sz + 1), ifac.resize(sz + 1);
    rep(i, fac[0] = 1, sz) fac[i] = fac[i - 1] * i % mod;

    ifac[sz] = inv(fac[sz]);
    Rep(i, sz - 1, 0) ifac[i] = ifac[i + 1] * (i + 1) % mod;
  }

  vector<int> fac, ifac;

  int qpow(int x, int y) {
    int ans = 1;
    for (; y; y >>= 1, x = x * x % mod)
      if (y & 1) ans = ans * x % mod;
    return ans;
  }

  int inv(int x) { return qpow(x, mod - 2); }

  int C(int n, int m) {
    if (n < 0 || m < 0 || n < m) return 0;
    return fac[n] * ifac[m] % mod * ifac[n - m] % mod;
  }
};

int gcd(int x, int y) { return !y ? x : gcd(y, x % y); }
int lcm(int x, int y) { return x * y / gcd(x, y); }

const int maxn = 2e5 + 52;

struct edge {
  int u, v, bg, ed;
};
pii q[maxn];
vector<edge> e;
map<int, int> g[maxn];
int qnum = 0;

struct DSU {
  int n;
  int fa[maxn], sz[maxn];

  void init(int _n) {
    n = _n;
    for (int i = 1; i <= n; i++) sz[fa[i] = i] = 1;
  }

  int find(int x) { return x == fa[x] ? x : find(fa[x]); }

  int top = 0;
  pii sta[maxn];

  void merge(int x, int y) {
    x = find(x), y = find(y);
    if (x == y) return;
    if (sz[x] > sz[y]) swap(x, y);
    fa[x] = y;
    sz[y] += sz[x];
    sta[++top] = pii(x, y);
  }
} dsu;

int n;
int id[2][maxn];
char s[2333];

vector<int> ans;
void solve(int l, int r, vector<edge> E) {
  vector<edge> L, R;
  const int mid = l + r >> 1;
	const int Top = dsu.top;
  for (auto it : E) {
    if (it.bg <= l && r <= it.ed) {
      dsu.merge(it.u, it.v);
    } else {
      if (it.bg <= mid) L.pb(it);
      if (it.ed > mid) R.pb(it);
    }
  }
  if (l == r)
    ans.pb(dsu.find(q[l].first) == dsu.find(q[l].second));
  else
    solve(l, mid, L), solve(mid + 1, r, R);
  while(dsu.top > Top) {
  	int u = dsu.sta[dsu.top].fir;
  	int v = dsu.sta[dsu.top --].sec;
  	dsu.fa[u] = u;
  	dsu.sz[v] -= dsu.sz[u];
	}
}

signed main() {
  // code begin.
  in >> n, dsu.init(n << 1);
  int cnt = 0;
  rep(i, 1, n) id[0][i] = ++cnt, id[1][i] = ++cnt;
  while (1) {
    in >> s;
    if (*s == 'E') break;
    int r1, c1, r2, c2;
    in >> r1 >> c1 >> r2 >> c2;
    --r1, --r2;
    if (*s == 'O') {
      e.push_back((edge){ id[r1][c1], id[r2][c2], qnum + 1, -1 });
      g[id[r1][c1]][id[r2][c2]] = g[id[r2][c2]][id[r1][c1]] = e.size() - 1;
    }
    if (*s == 'C') {
      e[g[id[r1][c1]][id[r2][c2]]].ed = qnum;
    }
    if (*s == 'A') {
      q[++qnum] = pii(id[r1][c1], id[r2][c2]);
    }
  }
  for (auto& x : e)
    if (x.ed == -1) x.ed = qnum;
  solve(1, qnum, e);
  for (int x : ans)
    if (x == 1)
      out << 'Y' << '\n';
    else
      out << 'N' << '\n';
  return 0;
  // code end.
}