oj.uz

Submission #917199

# Submission time Handle Problem Language Result Execution time Memory
917199 2024-01-27T12:24:42 Z huutuan Tourism (JOI23_tourism) C++14
28 / 100
 5000 ms 47092 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=500, 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 get(int l, int r){
      return get(r)-get(l-1);
   }
   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 size;
      FenwickTree bit;
      int ans;
      int get_order(int i){
         return bit.get(i);
      }
      int count(int i){
         return bit.get(i, 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){
         int cnt=count(x);
         if (cnt==0 && size){
            int i=get_order(x);
            int next=i==size?find_first():find_by_order(i+1);
            int prev=i==0?find_last():find_by_order(i);
            ans-=distance(tour[prev], tour[next]);
            ans+=distance(tour[prev], tour[x]);
            ans+=distance(tour[x], tour[next]);
         }
         bit.update(x, 1);
         ++size;
      }
      void erase(int x){
         int cnt=count(x);
         bit.update(x, -1);
         --size;
         if (cnt==1 && size){
            int i=get_order(x);
            int next=i==size?find_first():find_by_order(i+1);
            int prev=i==0?find_last():find_by_order(i);
            ans+=distance(tour[prev], tour[next]);
            ans-=distance(tour[prev], tour[x]);
            ans-=distance(tour[x], tour[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 2 ms 7772 KB Output is correct
2 Correct 3 ms 7772 KB Output is correct
3 Correct 2 ms 7772 KB Output is correct
4 Correct 4 ms 7772 KB Output is correct
5 Correct 3 ms 7996 KB Output is correct
6 Correct 3 ms 7772 KB Output is correct
7 Correct 4 ms 7772 KB Output is correct
8 Correct 3 ms 7772 KB Output is correct
9 Correct 5 ms 7772 KB Output is correct
10 Correct 4 ms 7772 KB Output is correct
11 Correct 5 ms 7772 KB Output is correct
12 Correct 3 ms 7772 KB Output is correct
13 Correct 3 ms 7772 KB Output is correct
14 Correct 3 ms 7772 KB Output is correct
15 Correct 4 ms 7912 KB Output is correct
16 Correct 4 ms 7772 KB Output is correct
17 Correct 4 ms 7868 KB Output is correct
18 Correct 4 ms 7772 KB Output is correct
19 Correct 4 ms 8008 KB Output is correct
20 Correct 4 ms 7772 KB Output is correct
21 Correct 4 ms 7772 KB Output is correct
22 Correct 4 ms 7768 KB Output is correct
23 Correct 4 ms 7772 KB Output is correct
24 Correct 4 ms 8004 KB Output is correct
25 Correct 4 ms 7772 KB Output is correct
26 Correct 4 ms 7772 KB Output is correct
27 Correct 3 ms 7772 KB Output is correct
28 Correct 2 ms 7772 KB Output is correct
29 Correct 3 ms 7772 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7772 KB Output is correct
2 Correct 3 ms 7772 KB Output is correct
3 Correct 2 ms 7772 KB Output is correct
4 Correct 4 ms 7772 KB Output is correct
5 Correct 3 ms 7996 KB Output is correct
6 Correct 3 ms 7772 KB Output is correct
7 Correct 4 ms 7772 KB Output is correct
8 Correct 3 ms 7772 KB Output is correct
9 Correct 5 ms 7772 KB Output is correct
10 Correct 4 ms 7772 KB Output is correct
11 Correct 5 ms 7772 KB Output is correct
12 Correct 3 ms 7772 KB Output is correct
13 Correct 3 ms 7772 KB Output is correct
14 Correct 3 ms 7772 KB Output is correct
15 Correct 4 ms 7912 KB Output is correct
16 Correct 4 ms 7772 KB Output is correct
17 Correct 4 ms 7868 KB Output is correct
18 Correct 4 ms 7772 KB Output is correct
19 Correct 4 ms 8008 KB Output is correct
20 Correct 4 ms 7772 KB Output is correct
21 Correct 4 ms 7772 KB Output is correct
22 Correct 4 ms 7768 KB Output is correct
23 Correct 4 ms 7772 KB Output is correct
24 Correct 4 ms 8004 KB Output is correct
25 Correct 4 ms 7772 KB Output is correct
26 Correct 4 ms 7772 KB Output is correct
27 Correct 3 ms 7772 KB Output is correct
28 Correct 2 ms 7772 KB Output is correct
29 Correct 3 ms 7772 KB Output is correct
30 Correct 25 ms 8028 KB Output is correct
31 Correct 30 ms 8028 KB Output is correct
32 Correct 39 ms 8028 KB Output is correct
33 Correct 37 ms 8028 KB Output is correct
34 Correct 36 ms 8024 KB Output is correct
35 Correct 6 ms 8028 KB Output is correct
36 Correct 5 ms 8028 KB Output is correct
37 Correct 5 ms 8028 KB Output is correct
38 Correct 34 ms 8028 KB Output is correct
39 Correct 33 ms 8028 KB Output is correct
40 Correct 35 ms 8024 KB Output is correct
41 Correct 5 ms 8028 KB Output is correct
42 Correct 5 ms 8028 KB Output is correct
43 Correct 5 ms 8024 KB Output is correct
44 Correct 41 ms 8124 KB Output is correct
45 Correct 35 ms 8028 KB Output is correct
46 Correct 35 ms 8144 KB Output is correct
47 Correct 5 ms 8028 KB Output is correct
48 Correct 5 ms 8028 KB Output is correct
49 Correct 5 ms 8148 KB Output is correct
50 Correct 32 ms 8028 KB Output is correct
51 Correct 30 ms 8024 KB Output is correct
52 Correct 31 ms 8080 KB Output is correct
53 Correct 30 ms 8028 KB Output is correct
54 Correct 30 ms 8028 KB Output is correct
55 Correct 31 ms 8104 KB Output is correct
56 Correct 4 ms 7768 KB Output is correct
57 Correct 3 ms 8028 KB Output is correct
58 Correct 4 ms 8028 KB Output is correct

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7772 KB Output is correct
2 Correct 3 ms 7772 KB Output is correct
3 Correct 4 ms 7772 KB Output is correct
4 Correct 4911 ms 30368 KB Output is correct
5 Correct 3654 ms 43692 KB Output is correct
6 Execution timed out 5091 ms 47092 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7772 KB Output is correct
2 Correct 71 ms 25280 KB Output is correct
3 Correct 122 ms 27860 KB Output is correct
4 Correct 94 ms 30332 KB Output is correct
5 Correct 107 ms 38484 KB Output is correct
6 Correct 134 ms 38452 KB Output is correct
7 Correct 161 ms 38492 KB Output is correct
8 Correct 192 ms 38480 KB Output is correct
9 Correct 175 ms 38468 KB Output is correct
10 Correct 170 ms 38480 KB Output is correct
11 Correct 170 ms 38452 KB Output is correct
12 Correct 171 ms 38536 KB Output is correct
13 Correct 178 ms 38456 KB Output is correct
14 Correct 168 ms 38736 KB Output is correct
15 Correct 182 ms 39084 KB Output is correct
16 Correct 166 ms 38484 KB Output is correct
17 Correct 163 ms 38484 KB Output is correct
18 Correct 166 ms 38488 KB Output is correct
19 Correct 92 ms 38484 KB Output is correct
20 Correct 102 ms 38396 KB Output is correct
21 Correct 125 ms 38380 KB Output is correct
22 Correct 129 ms 38480 KB Output is correct
23 Correct 138 ms 38324 KB Output is correct
24 Correct 159 ms 38548 KB Output is correct
25 Correct 152 ms 38328 KB Output is correct
26 Correct 149 ms 38484 KB Output is correct
27 Correct 156 ms 38424 KB Output is correct
28 Correct 159 ms 38540 KB Output is correct
29 Correct 151 ms 38480 KB Output is correct
30 Correct 162 ms 38484 KB Output is correct
31 Correct 159 ms 38484 KB Output is correct
32 Correct 157 ms 38628 KB Output is correct
33 Correct 155 ms 38744 KB Output is correct
34 Correct 182 ms 39396 KB Output is correct

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7768 KB Output is correct
2 Correct 3 ms 7768 KB Output is correct
3 Correct 5 ms 7768 KB Output is correct
4 Execution timed out 5081 ms 25784 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #6
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7772 KB Output is correct
2 Correct 3 ms 7772 KB Output is correct
3 Correct 2 ms 7772 KB Output is correct
4 Correct 4 ms 7772 KB Output is correct
5 Correct 3 ms 7996 KB Output is correct
6 Correct 3 ms 7772 KB Output is correct
7 Correct 4 ms 7772 KB Output is correct
8 Correct 3 ms 7772 KB Output is correct
9 Correct 5 ms 7772 KB Output is correct
10 Correct 4 ms 7772 KB Output is correct
11 Correct 5 ms 7772 KB Output is correct
12 Correct 3 ms 7772 KB Output is correct
13 Correct 3 ms 7772 KB Output is correct
14 Correct 3 ms 7772 KB Output is correct
15 Correct 4 ms 7912 KB Output is correct
16 Correct 4 ms 7772 KB Output is correct
17 Correct 4 ms 7868 KB Output is correct
18 Correct 4 ms 7772 KB Output is correct
19 Correct 4 ms 8008 KB Output is correct
20 Correct 4 ms 7772 KB Output is correct
21 Correct 4 ms 7772 KB Output is correct
22 Correct 4 ms 7768 KB Output is correct
23 Correct 4 ms 7772 KB Output is correct
24 Correct 4 ms 8004 KB Output is correct
25 Correct 4 ms 7772 KB Output is correct
26 Correct 4 ms 7772 KB Output is correct
27 Correct 3 ms 7772 KB Output is correct
28 Correct 2 ms 7772 KB Output is correct
29 Correct 3 ms 7772 KB Output is correct
30 Correct 25 ms 8028 KB Output is correct
31 Correct 30 ms 8028 KB Output is correct
32 Correct 39 ms 8028 KB Output is correct
33 Correct 37 ms 8028 KB Output is correct
34 Correct 36 ms 8024 KB Output is correct
35 Correct 6 ms 8028 KB Output is correct
36 Correct 5 ms 8028 KB Output is correct
37 Correct 5 ms 8028 KB Output is correct
38 Correct 34 ms 8028 KB Output is correct
39 Correct 33 ms 8028 KB Output is correct
40 Correct 35 ms 8024 KB Output is correct
41 Correct 5 ms 8028 KB Output is correct
42 Correct 5 ms 8028 KB Output is correct
43 Correct 5 ms 8024 KB Output is correct
44 Correct 41 ms 8124 KB Output is correct
45 Correct 35 ms 8028 KB Output is correct
46 Correct 35 ms 8144 KB Output is correct
47 Correct 5 ms 8028 KB Output is correct
48 Correct 5 ms 8028 KB Output is correct
49 Correct 5 ms 8148 KB Output is correct
50 Correct 32 ms 8028 KB Output is correct
51 Correct 30 ms 8024 KB Output is correct
52 Correct 31 ms 8080 KB Output is correct
53 Correct 30 ms 8028 KB Output is correct
54 Correct 30 ms 8028 KB Output is correct
55 Correct 31 ms 8104 KB Output is correct
56 Correct 4 ms 7768 KB Output is correct
57 Correct 3 ms 8028 KB Output is correct
58 Correct 4 ms 8028 KB Output is correct
59 Correct 3 ms 7772 KB Output is correct
60 Correct 3 ms 7772 KB Output is correct
61 Correct 4 ms 7772 KB Output is correct
62 Correct 4911 ms 30368 KB Output is correct
63 Correct 3654 ms 43692 KB Output is correct
64 Execution timed out 5091 ms 47092 KB Time limit exceeded
65 Halted 0 ms 0 KB -