oj.uz

Submission #787069

# Submission time Handle Problem Language Result Execution time Memory
787069 2023-07-18T18:33:31 Z fuad27 Tourism (JOI23_tourism) C++17
0 / 100
 213 ms 28544 KB 
#include<bits/stdc++.h>
using namespace std;
const int N=2e5+10;
int n, m, q, sz[N];
vector<int> g[N];
int id[N], tp[N], par[N], depth[N];
struct node {
  int l, r;
  int val;
  bool operator<(const node& B) const {
    return l<B.l;
  }
};
int fen[N+10];
void upd(int at, int val) {
  at++;
  while(at<N) {
    fen[at]+=val;
    at+=at&(-at);
  }
}
int que(int at) {
  int res=0;
  at++;
  while(at) {
    res+=fen[at];
    at-=at&(-at);
  }
  return res;
}
set<node> s;
auto split(int x) {
  auto it=--s.upper_bound(node({x,0,0}));
  if(it->l==x)return it;
  if(it->r<x)return s.end();
  int l=it->l, r=it->r, val = it->val;
  s.erase(it);
  s.insert({l, x-1, val});
  return s.insert({x, r, val}).first;
}
void update(int l, int r, int val) {
  auto it2=split(r+1), it1=split(l);
  for(auto it=it1;it!=it2;it++) {
    upd(it->val, -(it->r-it->l+1));
  }
  s.erase(it1, it2);
  s.insert({l, r, val});
  upd(val, r-l+1);
}
int C=0;
void dfs_sz(int at, int p) {
  sz[at]=1;
  for(int to:g[at]) {
    if(to==p)continue;
    depth[to]=depth[at]+1;
    dfs_sz(to,at);
    sz[at]+=sz[to];
  }
}
void dfs(int at, int p, int top) {
  id[at]=C++;
  tp[at]=top;
  par[at]=p;
  s.insert({id[at], id[at], 0});
  int hv_child=-1, hv_sz=-1;
  for(int to:g[at]) {
    if(to==p)continue;
    if(sz[to]>hv_sz) {
      hv_child=to;
      hv_sz=sz[to];
    }
  }
  if(hv_child==-1)return;
  dfs(hv_child, at, top);
  for(int to:g[at]) {
    if(to==p or to==hv_child)continue;
    dfs(to, at, to);
  }
}
long long queryy(int x, int y, int val) {
  long long res=0;
  while(tp[x]!=tp[y]) {
    if(depth[tp[x]]<depth[tp[y]])swap(x,y);
    update(id[tp[x]], id[x], val);
    x=par[tp[x]];
  }
  if(depth[x]>depth[y])swap(x,y);
  update(id[x], id[y], val);
  return res;
}
int main () {
  cin.tie(0)->sync_with_stdio(0);
  cin >> n >> m >> q;
  for(int i = 1;i<n;i++) {
    int A, B;
    cin >> A >> B;
    g[A].push_back(B);
    g[B].push_back(A);
  }
  dfs_sz(1,1);
  dfs(1,1,1);
  int c[m+1];
  for(int i = 1;i<=m;i++)cin >> c[i];
  vector<pair<int,int>> quee[n+1];
  int ress[q];
  for(int i = 0;i<q;i++) {
    int l, r;
    cin >> l >> r;
    quee[r].push_back({l, i});
  }
  for(int i = 1;i<=m;i++) {
    if(i>1)queryy(c[i], c[i-1], i-1);
    for(auto j:quee[i]) {
      ress[j.second]=que(n)-que(j.first-1);
    }
  }
  for(int i = 0;i<q;i++)cout << ress[i] << "\n";
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5076 KB Output is correct
2 Incorrect 3 ms 5076 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5076 KB Output is correct
2 Incorrect 3 ms 5076 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 5024 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5076 KB Output is correct
2 Correct 213 ms 14028 KB Output is correct
3 Runtime error 44 ms 28544 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5076 KB Output is correct
2 Runtime error 6 ms 10020 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #6
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5076 KB Output is correct
2 Incorrect 3 ms 5076 KB Output isn't correct
3 Halted 0 ms 0 KB -