제출 #1142721

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1142721		aykhn	Inside information (BOI21_servers)	C++17	5 / 100	124 ms	42560 KiB

servers

#include <bits/stdc++.h>
 
using namespace std;
 
#define int long long
#define inf 0x3F3F3F3F3F3F3F3F
 
const int MXN = 12e4 + 5;
const int mod = 1e9 + 7;
const int LOG = 20;
 
struct BIT
{
  int n;
  vector<int> ft;
  void init(int N)
  {
    n = N + 5;
    ft.assign(n + 5, 0);
  }
  void add(int pos, int val)
  {
    for (pos = pos + 1; pos <= n; pos += pos & -pos) ft[pos] += val;
  }
  int get(int pos, int res = 0)
  {
    for (pos = pos + 1; pos > 0; pos -= pos & -pos) res += ft[pos];
    return res;
  }
};
 
int n, m;
vector<array<int, 2>> adj[MXN];
int used[MXN], sz[MXN];
BIT ft[MXN];
int cent[LOG][MXN], w[LOG][MXN];
int ic[LOG][MXN], dc[LOG][MXN];
int par[LOG][MXN];
vector<array<int, 3>> ed;
array<int, 2> rep[LOG][MXN];
int tim;
 
void getsize(int a, int p)
{
  sz[a] = 1;
  for (array<int, 2> &v : adj[a])
  {
    if (used[v[0]] || v[0] == p) continue;
    getsize(v[0], a);
    sz[a] += sz[v[0]];
  }
}
int findcent(int a, int p, int &curn)
{
  for (array<int, 2> &v : adj[a])
  {
    if (used[v[0]] || v[0] == p) continue;
    if (sz[v[0]] > curn / 2) return findcent(v[0], a, curn); 
  }
  return a;
}
void dfs(int a, int p, int &lvl, int &cc, array<int, 2> &as)
{
  par[lvl][a] = p;
  rep[lvl][a] = as;
  cent[lvl][a] = cc;
  for (array<int, 2> &v : adj[a])
  {
    if (used[v[0]] || v[0] == p) continue;
    w[lvl][v[0]] = v[1];
    dfs(v[0], a, lvl, cc, as);
  }
}
void maincent(int a, int lvl)
{
  getsize(a, a);
  int c = findcent(a, a, sz[a]);
  ic[lvl][c] = dc[lvl][c] = 1;
  used[c] = 1;
  cent[lvl][c] = c;
  for (array<int, 2> &v : adj[c])
  {
    if (used[v[0]]) continue;
    w[lvl][v[0]] = v[1];
    dfs(v[0], c, lvl, c, v);
  }
  for (array<int, 2> &v : adj[c])
  {
    if (used[v[0]]) continue;
    maincent(v[0], lvl + 1);
  }
}
 
int nw = 0;

void upd(int a, int p, int prv, int &lvl)
{
  if (!dc[lvl][a]) return;
  for (array<int, 2> &v : adj[a])
  {
    if (cent[lvl][v[0]] != cent[lvl][a] || par[lvl][v[0]] != a) continue;
    if (v[1] > tim) continue;
    dc[lvl][v[0]] = v[1] < prv;
    upd(v[0], a, v[1], lvl);
  }
}
 
int getind(int c, int ind)
{
  int l = 0, r = (int)adj[c].size() - 1;
  while (l < r)
  {
    int mid = (l + r) >> 1;
    if (adj[c][mid][1] >= ind) r = mid;
    else l = mid + 1;
  }
  return l;
}
 
void add(int c, int ind, int val)
{
  ind = getind(c, ind);
  ft[c].add(ind, val);
}

int ans;
void calcans(int a, int p, int w)
{
  ans++;
  for (array<int, 2> &v : adj[a])
  {
    if (v[0] == p || v[1] < w || v[1] > tim) continue;
    calcans(v[0], a, v[1]);
  }
}
int u1[MXN];
void trav(int a, int w)
{
  u1[a] = 1;
  for (array<int, 2> &v : adj[a])
  {
    if (u1[v[0]] || v[1] < w || v[1] > tim) continue;
    trav(v[0], v[1]);
  }
}
signed main()
{
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> m;
  ed.resize(n + m - 1, {0, 0, 0});
  for (array<int, 3> &e : ed)
  {
    char ch;
    cin >> ch >> e[1];
    if (ch == 'S') 
    {
      cin >> e[2];
      e[0] = 0;
    }
    else if (ch == 'Q') 
    {
      cin >> e[2];
      e[0] = 1;
    }
    else 
    {
      e[0] = 2;
    }
  }
  for (int i = 0; i < ed.size(); i++)
  {
    if (!ed[i][0]) adj[ed[i][1]].push_back({ed[i][2], i}), adj[ed[i][2]].push_back({ed[i][1], i});
  }
  for (int i = 1; i <= n; i++)
  {
    ft[i].init(adj[i].size());
  }
  maincent(1, 0);
  for (tim = 0; tim < ed.size(); tim++)
  {
    array<int, 3> &e = ed[tim];
    int x = e[1], y = e[2];
    if (!e[0])
    {
      for (int i = 0; i < LOG; i++)
      {
        if (!cent[i][x] || !cent[i][y] || cent[i][x] != cent[i][y]) break;
        if (par[i][x] == y) swap(x, y);
        int A = ic[i][x], B = ic[i][y];
        if (cent[i][x] == x) ic[i][y] = dc[i][y] = 1;
        ic[i][y] = ic[i][x];
        add(cent[i][y], rep[i][y][1], ic[i][x] + ic[i][y] - A - B);
        upd(y, x, tim, i);
      }
    }
    else if (e[0] == 1)
    {
      swap(x, y);
      int ok = 0;
      for (int i = 1; i < LOG; i++)
      {
        if (!cent[i][x] || !cent[i][y] || cent[i][x] != cent[i][y])
        {
          int c = cent[i - 1][x];
          assert(c == cent[i - 1][y]);
          if (dc[i - 1][x] && ic[i - 1][y] && (x == c || y == c || w[i - 1][x] < w[i - 1][y])) ok = 1;
          break;
        }
      }
      cout << (ok ? "yes\n" : "no\n");
    }
    else if (e[0] == 2)
    {
      int res = 0;
      for (int i = 0; i < LOG; i++)
      {
        if (!cent[i][x]) break;
        if (cent[i][x] == x) res += ft[x].get(adj[x].size()) + 1;
        else
        {
          if (dc[i][x])
          {
            int ind = getind(cent[i][x], rep[i][x][1]);
            res += ft[cent[i][x]].get(adj[cent[i][x]].size()) - ft[cent[i][x]].get(ind) + 1;
          }
        }
      }
      cout << res << '\n';
    }
  }
}

• Subtask 1-1: 0 / 2
• Subtask 1-2: 0 / 3
• Subtask 2-1: 2 / 2
• Subtask 2-2: 3 / 3
• Subtask 3-1: 0 / 5
• Subtask 3-2: 0 / 5
• Subtask 4-1: 0 / 10
• Subtask 4-2: 0 / 10
• Subtask 5-1: 0 / 12
• Subtask 5-2: 0 / 13
• Subtask 6-1: 0 / 17
• Subtask 6-2: 0 / 18