Submission #1187067

#	Time	Username	Problem	Language	Result	Execution time	Memory
1187067		mychecksedad	Rigged Roads (NOI19_riggedroads)	C++20	27 / 100	2102 ms	327680 KiB

riggedroads

/* Author : Mychecksdead  */
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define pb push_back
#define all(x) x.begin(), x.end()
#define en cout << '\n'
#define ff first
#define ss second
#define pii pair<int,int>
#define vi vector<int>
const int N = 1e6+100, M = 1e5+10, K = 22, MX = 30;


int n, m, tin[N], tout[N], timer = 1, sz[N], heavy[N], up[N][K];
vector<pii> g[N];
vector<pii> E;
bitset<N> in;
set<int> T[1200005];

void add(int l, int r, int p, int k, int val){
  T[k].insert(val);
  if(l == r){
    return;
  }
  int mid=l+r>>1;
  if(p <= mid) add(l, mid, p, k<<1, val);
  else add(mid+1, r, p, k<<1|1, val);
}
void rem(int l, int r, int p, int k, int val){
  T[k].erase(val);
  if(l == r){
    return;
  }
  int mid=l+r>>1;
  if(p <= mid) rem(l, mid, p, k<<1, val);
  else rem(mid+1, r, p, k<<1|1, val);
}

vi get_range(int l, int r, int ql, int qr, int k){
  if(ql > r || l > qr) return vector<int>();
  if(ql <= l && r <= qr){
    return vector<int>{k};
  }
  int mid = l+r>>1;
  auto L = get_range(l, mid, ql, qr, k<<1);
  auto R = get_range(mid+1, r, ql, qr, k<<1|1);
  while(R.size()) {L.pb(R.back()); R.pop_back();}
  return L;
}


void pre(int v, int p){
  sz[v] = 1;
  for(auto &E: g[v]){
    int u = E.ff;
    if(u != p){
      pre(u, v);
      sz[v] += sz[u];
      if(g[v][0].ff == p || sz[g[v][0].ff] < sz[u]){
        swap(g[v][0], E);
      }
    }
  }
}
void dfs(int v, int p){
  tin[v] = timer++;
  for(auto [u, idx]: g[v]){
    if(u==p)continue;
    up[u][0] = v;
    if(u == g[v][0].ff) heavy[u] = heavy[v];
    else heavy[u] = u;
    dfs(u, v);
    add(1, n, tin[u], 1, idx);
    cerr << tin[u] << ' ' << idx << endl;
  }
  tout[v] = timer - 1;
}

bool is_anc(int u, int v){
  return tin[u] <= tin[v] && tout[v] <= tout[u];
}

int _lca(int u, int v){
  if(is_anc(u, v)) return u;
  if(is_anc(v, u)) return v;
  for(int j = K-1; j >= 0; --j){
    if(!is_anc(up[u][j], v)) u = up[u][j];
  }
  return up[u][0];
}

void solve(){
  cin >> n >> m;
  for(int i = 1; i <= m; ++i){
    int u, v; cin >> u >> v;
    E.pb({u, v});
  }
  for(int i = 1; i < n; ++i){
    int x; cin >> x;
    int u = E[x-1].ff, v = E[x-1].ss;
    g[u].pb({v, x-1});
    g[v].pb({u, x-1});
    in[x - 1] = 1;
  }

  heavy[1] = 1;
  pre(1, 1);
  dfs(1, 1);
  up[1][0] = 1;

  for(int j = 1; j < K; ++j){
    for(int i = 1; i <= n; ++i){
      up[i][j] = up[up[i][j - 1]][j - 1];
    }
  }

  vector<int> ans(m + 1, -1);
  deque<int> W;
  for(int i = 1; i <= m; ++i){
    W.pb(i);
  }

  for(int i = 0; i < m; ++i){
    if(ans[i] != -1) continue;
    if(in[i]){
      ans[i] = W.front();
      W.pop_front();
      if(tin[E[i].ff] > tin[E[i].ss]){
        rem(1, n, tin[E[i].ff], 1, i);
      }else{
        rem(1, n, tin[E[i].ss], 1, i);
      }
    }else{
      vi IDX;
      int u = E[i].ff, v = E[i].ss;
      int lca = _lca(u, v);

      for(int rep = 0; rep < 2; ++rep){
        while(u != lca){
          if(tin[heavy[u]] > tin[lca]){
            auto V = get_range(1, n, tin[heavy[u]], tin[u], 1);
            while(V.size()){IDX.pb(V.back()); V.pop_back();}
            u = up[heavy[u]][0];
          }else{
            auto V = get_range(1, n, tin[lca] + 1, tin[u], 1);
            while(V.size()){IDX.pb(V.back()); V.pop_back();}
            break;
          }
        }
        swap(u, v);
      }


      priority_queue<pair<int, int>> Q; // position, id
      for(int x: IDX){
        cerr << "idx : " << x << '\n';
        if(T[x].size())
          Q.push({-(*T[x].begin()), x});
      }
      while(!Q.empty()){
        int v = Q.top().ff, x = Q.top().ss; Q.pop();
        // cerr << v << "erase\n";
        // T[x].erase(v);
        v = -v;
        if(tin[E[v].ff] > tin[E[v].ss]){
          rem(1, n, tin[E[v].ff], 1, v);
        }else{
          rem(1, n, tin[E[v].ss], 1, v);
        }

        cerr << "wsize: " << W.size() << '\n';

        ans[v] = W.front();
        W.pop_front();
        cerr << "decided: " << v << ' ' << ans[v] << '\n';

        if(T[x].size()){
          Q.push({-(*T[x].begin()), x});
        }
      }
      cerr << "wisize: " << W.size() << '\n';
      ans[i] = W.front();
      W.pop_front();
      cerr << "as: " << i << ' ' << ans[i] << '\n';
    }
  }
  for(int i = 0; i < m; ++i){
    cout << ans[i] << ' ';
  }
}


int main(){
  cin.tie(0); ios::sync_with_stdio(0);
  int tt = 1, aa;
  // freopen("in.txt", "r", stdin);
  // freopen("out.txt", "w", stdout);
  while(tt--){
    solve();
    en;
  }
  cerr<<"time taken : "<<(float)clock()/CLOCKS_PER_SEC<<" seconds\n";
  return 0;
} 

• Subtask 1: 8 / 8
• Subtask 2: 19 / 19
• Subtask 3: 0 / 9
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 12
• Subtask 7: 0 / 32