oj.uz

Submission #917209

# Submission time Handle Problem Language Result Execution time Memory
917209 2024-01-27T12:41:36 Z huutuan Tourism (JOI23_tourism) C++14
28 / 100
 5000 ms 50636 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=LG; 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];
pair<int, int> st[N*2][LG];
vector<int> g[N];

void dfs(int u, int p){
   tin[u]=++tdfs;
   tour[tdfs]=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;
}

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*2], prev_arr[N*2], next_arr[N*2];
      int size;
      FenwickTree bit;
      int ans;
      int get_order(int i){
         return bit.get(i);
      }
      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-01.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(tin[a[cl]]);
      }
      while (r>cr){
         ++cr;
         among::us.insert(tin[a[cr]]);
      }
      while (l>cl){
         among::us.erase(tin[a[cl]]);
         ++cl;
      }
      while (r<cr){
         among::us.erase(tin[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 3 ms 11868 KB Output is correct
2 Correct 3 ms 11868 KB Output is correct
3 Correct 3 ms 11868 KB Output is correct
4 Correct 4 ms 11868 KB Output is correct
5 Correct 3 ms 11868 KB Output is correct
6 Correct 3 ms 11880 KB Output is correct
7 Correct 4 ms 11868 KB Output is correct
8 Correct 4 ms 11900 KB Output is correct
9 Correct 4 ms 11868 KB Output is correct
10 Correct 4 ms 11868 KB Output is correct
11 Correct 4 ms 11868 KB Output is correct
12 Correct 3 ms 11868 KB Output is correct
13 Correct 3 ms 11868 KB Output is correct
14 Correct 3 ms 11868 KB Output is correct
15 Correct 4 ms 11868 KB Output is correct
16 Correct 4 ms 12120 KB Output is correct
17 Correct 4 ms 11892 KB Output is correct
18 Correct 4 ms 11868 KB Output is correct
19 Correct 4 ms 11868 KB Output is correct
20 Correct 5 ms 11848 KB Output is correct
21 Correct 4 ms 11868 KB Output is correct
22 Correct 4 ms 11868 KB Output is correct
23 Correct 4 ms 11888 KB Output is correct
24 Correct 4 ms 11868 KB Output is correct
25 Correct 4 ms 11868 KB Output is correct
26 Correct 4 ms 11864 KB Output is correct
27 Correct 3 ms 11884 KB Output is correct
28 Correct 3 ms 11868 KB Output is correct
29 Correct 3 ms 11868 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 11868 KB Output is correct
2 Correct 3 ms 11868 KB Output is correct
3 Correct 3 ms 11868 KB Output is correct
4 Correct 4 ms 11868 KB Output is correct
5 Correct 3 ms 11868 KB Output is correct
6 Correct 3 ms 11880 KB Output is correct
7 Correct 4 ms 11868 KB Output is correct
8 Correct 4 ms 11900 KB Output is correct
9 Correct 4 ms 11868 KB Output is correct
10 Correct 4 ms 11868 KB Output is correct
11 Correct 4 ms 11868 KB Output is correct
12 Correct 3 ms 11868 KB Output is correct
13 Correct 3 ms 11868 KB Output is correct
14 Correct 3 ms 11868 KB Output is correct
15 Correct 4 ms 11868 KB Output is correct
16 Correct 4 ms 12120 KB Output is correct
17 Correct 4 ms 11892 KB Output is correct
18 Correct 4 ms 11868 KB Output is correct
19 Correct 4 ms 11868 KB Output is correct
20 Correct 5 ms 11848 KB Output is correct
21 Correct 4 ms 11868 KB Output is correct
22 Correct 4 ms 11868 KB Output is correct
23 Correct 4 ms 11888 KB Output is correct
24 Correct 4 ms 11868 KB Output is correct
25 Correct 4 ms 11868 KB Output is correct
26 Correct 4 ms 11864 KB Output is correct
27 Correct 3 ms 11884 KB Output is correct
28 Correct 3 ms 11868 KB Output is correct
29 Correct 3 ms 11868 KB Output is correct
30 Correct 13 ms 11868 KB Output is correct
31 Correct 16 ms 11868 KB Output is correct
32 Correct 20 ms 11972 KB Output is correct
33 Correct 22 ms 12044 KB Output is correct
34 Correct 18 ms 11868 KB Output is correct
35 Correct 5 ms 11868 KB Output is correct
36 Correct 5 ms 11984 KB Output is correct
37 Correct 5 ms 11868 KB Output is correct
38 Correct 18 ms 12140 KB Output is correct
39 Correct 17 ms 12120 KB Output is correct
40 Correct 19 ms 12120 KB Output is correct
41 Correct 5 ms 12124 KB Output is correct
42 Correct 5 ms 11984 KB Output is correct
43 Correct 5 ms 11892 KB Output is correct
44 Correct 19 ms 12104 KB Output is correct
45 Correct 18 ms 11868 KB Output is correct
46 Correct 18 ms 11868 KB Output is correct
47 Correct 5 ms 11868 KB Output is correct
48 Correct 5 ms 11864 KB Output is correct
49 Correct 5 ms 11868 KB Output is correct
50 Correct 18 ms 12060 KB Output is correct
51 Correct 17 ms 11868 KB Output is correct
52 Correct 17 ms 11868 KB Output is correct
53 Correct 18 ms 12052 KB Output is correct
54 Correct 21 ms 11868 KB Output is correct
55 Correct 17 ms 11868 KB Output is correct
56 Correct 5 ms 11868 KB Output is correct
57 Correct 4 ms 11868 KB Output is correct
58 Correct 4 ms 11868 KB Output is correct

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 11864 KB Output is correct
2 Correct 3 ms 11864 KB Output is correct
3 Correct 4 ms 11896 KB Output is correct
4 Correct 3319 ms 35512 KB Output is correct
5 Correct 2175 ms 46684 KB Output is correct
6 Correct 3490 ms 50344 KB Output is correct
7 Execution timed out 5035 ms 50636 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 11884 KB Output is correct
2 Correct 58 ms 28764 KB Output is correct
3 Correct 83 ms 31608 KB Output is correct
4 Correct 82 ms 34736 KB Output is correct
5 Correct 96 ms 42840 KB Output is correct
6 Correct 112 ms 42836 KB Output is correct
7 Correct 128 ms 42832 KB Output is correct
8 Correct 149 ms 42760 KB Output is correct
9 Correct 151 ms 42876 KB Output is correct
10 Correct 144 ms 42836 KB Output is correct
11 Correct 146 ms 42832 KB Output is correct
12 Correct 144 ms 43092 KB Output is correct
13 Correct 136 ms 43104 KB Output is correct
14 Correct 139 ms 43344 KB Output is correct
15 Correct 153 ms 44204 KB Output is correct
16 Correct 137 ms 43008 KB Output is correct
17 Correct 138 ms 43096 KB Output is correct
18 Correct 139 ms 43088 KB Output is correct
19 Correct 84 ms 42836 KB Output is correct
20 Correct 92 ms 42900 KB Output is correct
21 Correct 102 ms 42832 KB Output is correct
22 Correct 122 ms 42836 KB Output is correct
23 Correct 114 ms 42860 KB Output is correct
24 Correct 127 ms 42828 KB Output is correct
25 Correct 125 ms 42832 KB Output is correct
26 Correct 125 ms 42816 KB Output is correct
27 Correct 135 ms 43136 KB Output is correct
28 Correct 126 ms 42832 KB Output is correct
29 Correct 124 ms 43052 KB Output is correct
30 Correct 128 ms 43108 KB Output is correct
31 Correct 129 ms 43092 KB Output is correct
32 Correct 129 ms 43092 KB Output is correct
33 Correct 134 ms 43604 KB Output is correct
34 Correct 144 ms 44504 KB Output is correct

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 11868 KB Output is correct
2 Correct 4 ms 11864 KB Output is correct
3 Correct 4 ms 11868 KB Output is correct
4 Correct 4130 ms 30636 KB Output is correct
5 Correct 4387 ms 33832 KB Output is correct
6 Execution timed out 5033 ms 41040 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #6
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 11868 KB Output is correct
2 Correct 3 ms 11868 KB Output is correct
3 Correct 3 ms 11868 KB Output is correct
4 Correct 4 ms 11868 KB Output is correct
5 Correct 3 ms 11868 KB Output is correct
6 Correct 3 ms 11880 KB Output is correct
7 Correct 4 ms 11868 KB Output is correct
8 Correct 4 ms 11900 KB Output is correct
9 Correct 4 ms 11868 KB Output is correct
10 Correct 4 ms 11868 KB Output is correct
11 Correct 4 ms 11868 KB Output is correct
12 Correct 3 ms 11868 KB Output is correct
13 Correct 3 ms 11868 KB Output is correct
14 Correct 3 ms 11868 KB Output is correct
15 Correct 4 ms 11868 KB Output is correct
16 Correct 4 ms 12120 KB Output is correct
17 Correct 4 ms 11892 KB Output is correct
18 Correct 4 ms 11868 KB Output is correct
19 Correct 4 ms 11868 KB Output is correct
20 Correct 5 ms 11848 KB Output is correct
21 Correct 4 ms 11868 KB Output is correct
22 Correct 4 ms 11868 KB Output is correct
23 Correct 4 ms 11888 KB Output is correct
24 Correct 4 ms 11868 KB Output is correct
25 Correct 4 ms 11868 KB Output is correct
26 Correct 4 ms 11864 KB Output is correct
27 Correct 3 ms 11884 KB Output is correct
28 Correct 3 ms 11868 KB Output is correct
29 Correct 3 ms 11868 KB Output is correct
30 Correct 13 ms 11868 KB Output is correct
31 Correct 16 ms 11868 KB Output is correct
32 Correct 20 ms 11972 KB Output is correct
33 Correct 22 ms 12044 KB Output is correct
34 Correct 18 ms 11868 KB Output is correct
35 Correct 5 ms 11868 KB Output is correct
36 Correct 5 ms 11984 KB Output is correct
37 Correct 5 ms 11868 KB Output is correct
38 Correct 18 ms 12140 KB Output is correct
39 Correct 17 ms 12120 KB Output is correct
40 Correct 19 ms 12120 KB Output is correct
41 Correct 5 ms 12124 KB Output is correct
42 Correct 5 ms 11984 KB Output is correct
43 Correct 5 ms 11892 KB Output is correct
44 Correct 19 ms 12104 KB Output is correct
45 Correct 18 ms 11868 KB Output is correct
46 Correct 18 ms 11868 KB Output is correct
47 Correct 5 ms 11868 KB Output is correct
48 Correct 5 ms 11864 KB Output is correct
49 Correct 5 ms 11868 KB Output is correct
50 Correct 18 ms 12060 KB Output is correct
51 Correct 17 ms 11868 KB Output is correct
52 Correct 17 ms 11868 KB Output is correct
53 Correct 18 ms 12052 KB Output is correct
54 Correct 21 ms 11868 KB Output is correct
55 Correct 17 ms 11868 KB Output is correct
56 Correct 5 ms 11868 KB Output is correct
57 Correct 4 ms 11868 KB Output is correct
58 Correct 4 ms 11868 KB Output is correct
59 Correct 3 ms 11864 KB Output is correct
60 Correct 3 ms 11864 KB Output is correct
61 Correct 4 ms 11896 KB Output is correct
62 Correct 3319 ms 35512 KB Output is correct
63 Correct 2175 ms 46684 KB Output is correct
64 Correct 3490 ms 50344 KB Output is correct
65 Execution timed out 5035 ms 50636 KB Time limit exceeded
66 Halted 0 ms 0 KB -