oj.uz

Submission #917246

# Submission time Handle Problem Language Result Execution time Memory
917246 2024-01-27T14:04:00 Z huutuan Tourism (JOI23_tourism) C++14
28 / 100
 5000 ms 47952 KB 
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2")
#include<bits/stdc++.h>

using namespace std;

// #define int long long
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define isz(x) ((int)x.size())
#define sumof(x) accumulate(all(x), 0ll)

const int N=1e5+1, S=400, LG=18;

struct Query{
   int l, r, i;

   Query(int a=0, int b=0, int c=0): l(a), r(b), i(c){}

   bool operator<(const Query& x){
      return l/S!=x.l/S?l<x.l:r<x.r;
   }
} qq[N];

struct FenwickTree{
   int n;
   vector<int> t;
   void init(int _n){
      n=_n;
      t.assign(n+1, 0);
   }
   void update(int pos, int val){
      for (int i=pos; i<=n; i+=i&(-i)) t[i]+=val;
   }
   int get(int pos){
      int ans=0;
      for (int i=pos; i; i-=i&(-i)) ans+=t[i];
      return ans;
   }
   int lower_bound(int val){
      int ans=0;
      for (int i=16; i>=0; --i) if (ans+(1<<i)<=n && t[ans+(1<<i)]<val){
         ans+=1<<i;
         val-=t[ans];
      }
      return ans+1;
   }
};

int n, m, q, a[N], tdfs, tin[N], tout[N], dep[N], ans[N], cnt[N], tour[N];
int tin2[N], tout2[N], tdfs2;
pair<int, int> st[N*2][LG];
vector<int> g[N];

void dfs(int u, int p){
   tin[u]=++tdfs;
   tin2[u]=++tdfs2;
   tour[tdfs2]=u;
   dep[u]=dep[p]+1;
   st[tdfs][0]={dep[u], u};
   for (int v:g[u]) if (v!=p){
      dfs(v, u);
      ++tdfs;
      st[tdfs][0]={dep[u], u};
   }
   tout[u]=tdfs;
   tout2[u]=tdfs2;
}

void build(){
   for (int k=1; k<LG; ++k) for (int i=1; i+(1<<k)-1<=tdfs; ++i) st[i][k]=min(st[i][k-1], st[i+(1<<(k-1))][k-1]);
}

int lca(int u, int v){
   u=tin[u]; v=tin[v];
   if (u>v) swap(u, v);
   int lg=__lg(v-u+1);
   return min(st[u][lg], st[v-(1<<lg)+1][lg]).second;
}

int distance(int u, int v){
   return dep[u]+dep[v]-dep[lca(u, v)]*2;
}

namespace among{
   struct SUS{
      int cnt[N], prev_arr[N], next_arr[N];
      int size;
      FenwickTree bit;
      int ans;
      int get_order(int x){
         return bit.get(x);
      }
      int find_by_order(int i){
         return bit.lower_bound(i);
      }
      int find_first(){
         return bit.lower_bound(1);
      }
      int find_last(){
         return bit.lower_bound(size);
      }
      void insert(int x){
         if (cnt[x]==0 && size){
            int i=get_order(x);
            int prev=i?find_by_order(i):find_last();
            int next=next_arr[prev];
            ans-=distance(tour[prev], tour[next]);
            ans+=distance(tour[prev], tour[x]);
            ans+=distance(tour[x], tour[next]);
            prev_arr[x]=prev; next_arr[prev]=x;
            prev_arr[next]=x; next_arr[x]=next;
         }
         ++cnt[x];
         bit.update(x, 1);
         if (!size){
            prev_arr[x]=x;
            next_arr[x]=x;
         }
         ++size;
      }
      void erase(int x){
         bit.update(x, -1);
         --size;
         --cnt[x];
         if (cnt[x]==0 && size){
            int i=get_order(x);
            int prev=i?find_by_order(i):find_last();
            int next=next_arr[x];
            ans+=distance(tour[prev], tour[next]);
            ans-=distance(tour[prev], tour[x]);
            ans-=distance(tour[x], tour[next]);
            prev_arr[next]=prev; next_arr[prev]=next;
         }
      }
   } us;
}

void solve(){
   #ifdef sus
   freopen("03-04.txt", "r", stdin);
   freopen("cf.out", "w", stdout);
   #endif
   cin >> n >> m >> q;
   for (int i=1; i<n; ++i){
      int x, y; cin >> x >> y;
      g[x].push_back(y);
      g[y].push_back(x);
   }
   dfs(1, 0);
   build();
   for (int i=1; i<=m; ++i) cin >> a[i];
   for (int i=1; i<=q; ++i){
      int x, y; cin >> x >> y;
      qq[i]={x, y, i};
   }
   sort(qq+1, qq+q+1);
   int cl=1, cr=0;
   among::us.bit.init(n*2);
   for (int i=1; i<=q; ++i){
      int l=qq[i].l, r=qq[i].r;
      while (l<cl){
         --cl;
         among::us.insert(tin2[a[cl]]);
      }
      while (r>cr){
         ++cr;
         among::us.insert(tin2[a[cr]]);
      }
      while (l>cl){
         among::us.erase(tin2[a[cl]]);
         ++cl;
      }
      while (r<cr){
         among::us.erase(tin2[a[cr]]);
         --cr;
      }
      ans[qq[i].i]=among::us.ans/2+1;
   }
   for (int i=1; i<=q; ++i) cout << ans[i] << '\n';
}

int32_t main(){
   ios_base::sync_with_stdio(false);
   cin.tie(nullptr);
   int ntests=1;
   // cin >> ntests;
   for (int i=1; i<=ntests; ++i) solve();
   return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5720 KB Output is correct
2 Correct 2 ms 5724 KB Output is correct
3 Correct 2 ms 5724 KB Output is correct
4 Correct 3 ms 5724 KB Output is correct
5 Correct 2 ms 5724 KB Output is correct
6 Correct 3 ms 5724 KB Output is correct
7 Correct 3 ms 5724 KB Output is correct
8 Correct 2 ms 5724 KB Output is correct
9 Correct 3 ms 5724 KB Output is correct
10 Correct 3 ms 5724 KB Output is correct
11 Correct 3 ms 5724 KB Output is correct
12 Correct 2 ms 5724 KB Output is correct
13 Correct 3 ms 5720 KB Output is correct
14 Correct 2 ms 5724 KB Output is correct
15 Correct 4 ms 5724 KB Output is correct
16 Correct 4 ms 5724 KB Output is correct
17 Correct 4 ms 5720 KB Output is correct
18 Correct 4 ms 5876 KB Output is correct
19 Correct 3 ms 5724 KB Output is correct
20 Correct 3 ms 5724 KB Output is correct
21 Correct 3 ms 5724 KB Output is correct
22 Correct 3 ms 5724 KB Output is correct
23 Correct 3 ms 5724 KB Output is correct
24 Correct 3 ms 5724 KB Output is correct
25 Correct 3 ms 6008 KB Output is correct
26 Correct 3 ms 5724 KB Output is correct
27 Correct 2 ms 5660 KB Output is correct
28 Correct 2 ms 5720 KB Output is correct
29 Correct 2 ms 5724 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5720 KB Output is correct
2 Correct 2 ms 5724 KB Output is correct
3 Correct 2 ms 5724 KB Output is correct
4 Correct 3 ms 5724 KB Output is correct
5 Correct 2 ms 5724 KB Output is correct
6 Correct 3 ms 5724 KB Output is correct
7 Correct 3 ms 5724 KB Output is correct
8 Correct 2 ms 5724 KB Output is correct
9 Correct 3 ms 5724 KB Output is correct
10 Correct 3 ms 5724 KB Output is correct
11 Correct 3 ms 5724 KB Output is correct
12 Correct 2 ms 5724 KB Output is correct
13 Correct 3 ms 5720 KB Output is correct
14 Correct 2 ms 5724 KB Output is correct
15 Correct 4 ms 5724 KB Output is correct
16 Correct 4 ms 5724 KB Output is correct
17 Correct 4 ms 5720 KB Output is correct
18 Correct 4 ms 5876 KB Output is correct
19 Correct 3 ms 5724 KB Output is correct
20 Correct 3 ms 5724 KB Output is correct
21 Correct 3 ms 5724 KB Output is correct
22 Correct 3 ms 5724 KB Output is correct
23 Correct 3 ms 5724 KB Output is correct
24 Correct 3 ms 5724 KB Output is correct
25 Correct 3 ms 6008 KB Output is correct
26 Correct 3 ms 5724 KB Output is correct
27 Correct 2 ms 5660 KB Output is correct
28 Correct 2 ms 5720 KB Output is correct
29 Correct 2 ms 5724 KB Output is correct
30 Correct 12 ms 5896 KB Output is correct
31 Correct 16 ms 5888 KB Output is correct
32 Correct 21 ms 5720 KB Output is correct
33 Correct 18 ms 5928 KB Output is correct
34 Correct 17 ms 5932 KB Output is correct
35 Correct 4 ms 5724 KB Output is correct
36 Correct 4 ms 5724 KB Output is correct
37 Correct 4 ms 5724 KB Output is correct
38 Correct 17 ms 6032 KB Output is correct
39 Correct 17 ms 5980 KB Output is correct
40 Correct 17 ms 6064 KB Output is correct
41 Correct 4 ms 5976 KB Output is correct
42 Correct 4 ms 5976 KB Output is correct
43 Correct 4 ms 5980 KB Output is correct
44 Correct 22 ms 6228 KB Output is correct
45 Correct 17 ms 5724 KB Output is correct
46 Correct 17 ms 5980 KB Output is correct
47 Correct 4 ms 5980 KB Output is correct
48 Correct 4 ms 5724 KB Output is correct
49 Correct 4 ms 5980 KB Output is correct
50 Correct 16 ms 5724 KB Output is correct
51 Correct 20 ms 5720 KB Output is correct
52 Correct 15 ms 5724 KB Output is correct
53 Correct 16 ms 5724 KB Output is correct
54 Correct 16 ms 5932 KB Output is correct
55 Correct 17 ms 5724 KB Output is correct
56 Correct 4 ms 5724 KB Output is correct
57 Correct 3 ms 5724 KB Output is correct
58 Correct 5 ms 5724 KB Output is correct

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5724 KB Output is correct
2 Correct 2 ms 5724 KB Output is correct
3 Correct 3 ms 5724 KB Output is correct
4 Correct 3629 ms 31036 KB Output is correct
5 Correct 2409 ms 40616 KB Output is correct
6 Correct 4102 ms 46604 KB Output is correct
7 Execution timed out 5084 ms 47952 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5724 KB Output is correct
2 Correct 55 ms 25860 KB Output is correct
3 Correct 95 ms 26484 KB Output is correct
4 Correct 90 ms 29024 KB Output is correct
5 Correct 102 ms 40016 KB Output is correct
6 Correct 117 ms 40016 KB Output is correct
7 Correct 131 ms 40024 KB Output is correct
8 Correct 141 ms 40024 KB Output is correct
9 Correct 152 ms 39924 KB Output is correct
10 Correct 156 ms 40020 KB Output is correct
11 Correct 143 ms 40312 KB Output is correct
12 Correct 171 ms 40020 KB Output is correct
13 Correct 146 ms 40128 KB Output is correct
14 Correct 146 ms 40200 KB Output is correct
15 Correct 196 ms 40536 KB Output is correct
16 Correct 139 ms 40020 KB Output is correct
17 Correct 144 ms 40024 KB Output is correct
18 Correct 156 ms 40608 KB Output is correct
19 Correct 84 ms 40020 KB Output is correct
20 Correct 102 ms 39964 KB Output is correct
21 Correct 111 ms 40048 KB Output is correct
22 Correct 121 ms 40028 KB Output is correct
23 Correct 122 ms 40016 KB Output is correct
24 Correct 121 ms 40032 KB Output is correct
25 Correct 128 ms 40016 KB Output is correct
26 Correct 165 ms 40020 KB Output is correct
27 Correct 134 ms 40016 KB Output is correct
28 Correct 131 ms 40044 KB Output is correct
29 Correct 152 ms 40148 KB Output is correct
30 Correct 152 ms 40020 KB Output is correct
31 Correct 133 ms 40016 KB Output is correct
32 Correct 130 ms 40072 KB Output is correct
33 Correct 144 ms 40788 KB Output is correct
34 Correct 182 ms 40576 KB Output is correct

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5724 KB Output is correct
2 Correct 2 ms 5724 KB Output is correct
3 Correct 4 ms 5724 KB Output is correct
4 Correct 4420 ms 27088 KB Output is correct
5 Correct 4800 ms 27212 KB Output is correct
6 Execution timed out 5040 ms 36436 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #6
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5720 KB Output is correct
2 Correct 2 ms 5724 KB Output is correct
3 Correct 2 ms 5724 KB Output is correct
4 Correct 3 ms 5724 KB Output is correct
5 Correct 2 ms 5724 KB Output is correct
6 Correct 3 ms 5724 KB Output is correct
7 Correct 3 ms 5724 KB Output is correct
8 Correct 2 ms 5724 KB Output is correct
9 Correct 3 ms 5724 KB Output is correct
10 Correct 3 ms 5724 KB Output is correct
11 Correct 3 ms 5724 KB Output is correct
12 Correct 2 ms 5724 KB Output is correct
13 Correct 3 ms 5720 KB Output is correct
14 Correct 2 ms 5724 KB Output is correct
15 Correct 4 ms 5724 KB Output is correct
16 Correct 4 ms 5724 KB Output is correct
17 Correct 4 ms 5720 KB Output is correct
18 Correct 4 ms 5876 KB Output is correct
19 Correct 3 ms 5724 KB Output is correct
20 Correct 3 ms 5724 KB Output is correct
21 Correct 3 ms 5724 KB Output is correct
22 Correct 3 ms 5724 KB Output is correct
23 Correct 3 ms 5724 KB Output is correct
24 Correct 3 ms 5724 KB Output is correct
25 Correct 3 ms 6008 KB Output is correct
26 Correct 3 ms 5724 KB Output is correct
27 Correct 2 ms 5660 KB Output is correct
28 Correct 2 ms 5720 KB Output is correct
29 Correct 2 ms 5724 KB Output is correct
30 Correct 12 ms 5896 KB Output is correct
31 Correct 16 ms 5888 KB Output is correct
32 Correct 21 ms 5720 KB Output is correct
33 Correct 18 ms 5928 KB Output is correct
34 Correct 17 ms 5932 KB Output is correct
35 Correct 4 ms 5724 KB Output is correct
36 Correct 4 ms 5724 KB Output is correct
37 Correct 4 ms 5724 KB Output is correct
38 Correct 17 ms 6032 KB Output is correct
39 Correct 17 ms 5980 KB Output is correct
40 Correct 17 ms 6064 KB Output is correct
41 Correct 4 ms 5976 KB Output is correct
42 Correct 4 ms 5976 KB Output is correct
43 Correct 4 ms 5980 KB Output is correct
44 Correct 22 ms 6228 KB Output is correct
45 Correct 17 ms 5724 KB Output is correct
46 Correct 17 ms 5980 KB Output is correct
47 Correct 4 ms 5980 KB Output is correct
48 Correct 4 ms 5724 KB Output is correct
49 Correct 4 ms 5980 KB Output is correct
50 Correct 16 ms 5724 KB Output is correct
51 Correct 20 ms 5720 KB Output is correct
52 Correct 15 ms 5724 KB Output is correct
53 Correct 16 ms 5724 KB Output is correct
54 Correct 16 ms 5932 KB Output is correct
55 Correct 17 ms 5724 KB Output is correct
56 Correct 4 ms 5724 KB Output is correct
57 Correct 3 ms 5724 KB Output is correct
58 Correct 5 ms 5724 KB Output is correct
59 Correct 2 ms 5724 KB Output is correct
60 Correct 2 ms 5724 KB Output is correct
61 Correct 3 ms 5724 KB Output is correct
62 Correct 3629 ms 31036 KB Output is correct
63 Correct 2409 ms 40616 KB Output is correct
64 Correct 4102 ms 46604 KB Output is correct
65 Execution timed out 5084 ms 47952 KB Time limit exceeded
66 Halted 0 ms 0 KB -