oj.uz

답안 #917258

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
917258 2024-01-27T14:17:58 Z huutuan Tourism (JOI23_tourism) C++14
28 / 100
 5000 ms 51580 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 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 (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;
         }
         bit.update(x, 1);
         if (!size){
            prev_arr[x]=x;
            next_arr[x]=x;
         }
         ++size;
      }
      void erase(int x){
         bit.update(x, -1);
         --size;
         if (size){
            int prev=prev_arr[x];
            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;
         if (!cnt[tin2[a[cl]]]) among::us.insert(tin2[a[cl]]);
         ++cnt[tin2[a[cl]]];
      }
      while (r>cr){
         ++cr;
         if (!cnt[tin2[a[cr]]]) among::us.insert(tin2[a[cr]]);
         ++cnt[tin2[a[cr]]];
      }
      while (l>cl){
         --cnt[tin2[a[cl]]];
         if (!cnt[tin2[a[cl]]]) among::us.erase(tin2[a[cl]]);
         ++cl;
      }
      while (r<cr){
         --cnt[tin2[a[cr]]];
         if (!cnt[tin2[a[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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7512 KB Output is correct
2 Correct 2 ms 7516 KB Output is correct
3 Correct 2 ms 7516 KB Output is correct
4 Correct 3 ms 7516 KB Output is correct
5 Correct 2 ms 7516 KB Output is correct
6 Correct 3 ms 7532 KB Output is correct
7 Correct 3 ms 7516 KB Output is correct
8 Correct 2 ms 7516 KB Output is correct
9 Correct 4 ms 7516 KB Output is correct
10 Correct 3 ms 7516 KB Output is correct
11 Correct 3 ms 7512 KB Output is correct
12 Correct 2 ms 7516 KB Output is correct
13 Correct 2 ms 7516 KB Output is correct
14 Correct 2 ms 7540 KB Output is correct
15 Correct 3 ms 7516 KB Output is correct
16 Correct 3 ms 7516 KB Output is correct
17 Correct 3 ms 7516 KB Output is correct
18 Correct 3 ms 7516 KB Output is correct
19 Correct 3 ms 7516 KB Output is correct
20 Correct 3 ms 7516 KB Output is correct
21 Correct 3 ms 7516 KB Output is correct
22 Correct 3 ms 7516 KB Output is correct
23 Correct 4 ms 7516 KB Output is correct
24 Correct 3 ms 7512 KB Output is correct
25 Correct 3 ms 7516 KB Output is correct
26 Correct 3 ms 7516 KB Output is correct
27 Correct 2 ms 7516 KB Output is correct
28 Correct 3 ms 7512 KB Output is correct
29 Correct 2 ms 7516 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7512 KB Output is correct
2 Correct 2 ms 7516 KB Output is correct
3 Correct 2 ms 7516 KB Output is correct
4 Correct 3 ms 7516 KB Output is correct
5 Correct 2 ms 7516 KB Output is correct
6 Correct 3 ms 7532 KB Output is correct
7 Correct 3 ms 7516 KB Output is correct
8 Correct 2 ms 7516 KB Output is correct
9 Correct 4 ms 7516 KB Output is correct
10 Correct 3 ms 7516 KB Output is correct
11 Correct 3 ms 7512 KB Output is correct
12 Correct 2 ms 7516 KB Output is correct
13 Correct 2 ms 7516 KB Output is correct
14 Correct 2 ms 7540 KB Output is correct
15 Correct 3 ms 7516 KB Output is correct
16 Correct 3 ms 7516 KB Output is correct
17 Correct 3 ms 7516 KB Output is correct
18 Correct 3 ms 7516 KB Output is correct
19 Correct 3 ms 7516 KB Output is correct
20 Correct 3 ms 7516 KB Output is correct
21 Correct 3 ms 7516 KB Output is correct
22 Correct 3 ms 7516 KB Output is correct
23 Correct 4 ms 7516 KB Output is correct
24 Correct 3 ms 7512 KB Output is correct
25 Correct 3 ms 7516 KB Output is correct
26 Correct 3 ms 7516 KB Output is correct
27 Correct 2 ms 7516 KB Output is correct
28 Correct 3 ms 7512 KB Output is correct
29 Correct 2 ms 7516 KB Output is correct
30 Correct 10 ms 7512 KB Output is correct
31 Correct 12 ms 7692 KB Output is correct
32 Correct 15 ms 7728 KB Output is correct
33 Correct 20 ms 7716 KB Output is correct
34 Correct 14 ms 7512 KB Output is correct
35 Correct 4 ms 7516 KB Output is correct
36 Correct 4 ms 7724 KB Output is correct
37 Correct 4 ms 7524 KB Output is correct
38 Correct 13 ms 7772 KB Output is correct
39 Correct 14 ms 7772 KB Output is correct
40 Correct 14 ms 7772 KB Output is correct
41 Correct 4 ms 7772 KB Output is correct
42 Correct 4 ms 7768 KB Output is correct
43 Correct 4 ms 7772 KB Output is correct
44 Correct 14 ms 7776 KB Output is correct
45 Correct 14 ms 7768 KB Output is correct
46 Correct 14 ms 7780 KB Output is correct
47 Correct 4 ms 7772 KB Output is correct
48 Correct 4 ms 7516 KB Output is correct
49 Correct 4 ms 7772 KB Output is correct
50 Correct 14 ms 7512 KB Output is correct
51 Correct 13 ms 7516 KB Output is correct
52 Correct 13 ms 7516 KB Output is correct
53 Correct 14 ms 7516 KB Output is correct
54 Correct 14 ms 7516 KB Output is correct
55 Correct 13 ms 7516 KB Output is correct
56 Correct 3 ms 7516 KB Output is correct
57 Correct 3 ms 7512 KB Output is correct
58 Correct 4 ms 7516 KB Output is correct

Subtask #3
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7512 KB Output is correct
2 Correct 3 ms 7516 KB Output is correct
3 Correct 3 ms 7516 KB Output is correct
4 Correct 2576 ms 31956 KB Output is correct
5 Correct 1804 ms 41440 KB Output is correct
6 Correct 3035 ms 47036 KB Output is correct
7 Correct 4951 ms 48720 KB Output is correct
8 Correct 4997 ms 51576 KB Output is correct
9 Correct 4968 ms 51580 KB Output is correct
10 Correct 4885 ms 51580 KB Output is correct
11 Execution timed out 5053 ms 51096 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 7512 KB Output is correct
2 Correct 50 ms 25112 KB Output is correct
3 Correct 72 ms 27484 KB Output is correct
4 Correct 71 ms 29964 KB Output is correct
5 Correct 104 ms 40216 KB Output is correct
6 Correct 114 ms 40272 KB Output is correct
7 Correct 125 ms 40312 KB Output is correct
8 Correct 128 ms 40276 KB Output is correct
9 Correct 133 ms 40272 KB Output is correct
10 Correct 134 ms 40288 KB Output is correct
11 Correct 140 ms 40156 KB Output is correct
12 Correct 139 ms 40276 KB Output is correct
13 Correct 134 ms 40368 KB Output is correct
14 Correct 133 ms 40548 KB Output is correct
15 Correct 138 ms 40664 KB Output is correct
16 Correct 165 ms 40252 KB Output is correct
17 Correct 140 ms 40680 KB Output is correct
18 Correct 132 ms 40196 KB Output is correct
19 Correct 86 ms 40440 KB Output is correct
20 Correct 120 ms 40276 KB Output is correct
21 Correct 109 ms 40320 KB Output is correct
22 Correct 113 ms 40328 KB Output is correct
23 Correct 105 ms 40276 KB Output is correct
24 Correct 128 ms 40272 KB Output is correct
25 Correct 121 ms 40316 KB Output is correct
26 Correct 114 ms 40272 KB Output is correct
27 Correct 121 ms 40272 KB Output is correct
28 Correct 119 ms 40272 KB Output is correct
29 Correct 132 ms 40376 KB Output is correct
30 Correct 120 ms 40272 KB Output is correct
31 Correct 141 ms 40528 KB Output is correct
32 Correct 124 ms 40536 KB Output is correct
33 Correct 127 ms 40528 KB Output is correct
34 Correct 139 ms 40536 KB Output is correct

Subtask #5
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7516 KB Output is correct
2 Correct 2 ms 7516 KB Output is correct
3 Correct 3 ms 7516 KB Output is correct
4 Correct 3564 ms 27860 KB Output is correct
5 Correct 3542 ms 27996 KB Output is correct
6 Execution timed out 5070 ms 37044 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #6
0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7512 KB Output is correct
2 Correct 2 ms 7516 KB Output is correct
3 Correct 2 ms 7516 KB Output is correct
4 Correct 3 ms 7516 KB Output is correct
5 Correct 2 ms 7516 KB Output is correct
6 Correct 3 ms 7532 KB Output is correct
7 Correct 3 ms 7516 KB Output is correct
8 Correct 2 ms 7516 KB Output is correct
9 Correct 4 ms 7516 KB Output is correct
10 Correct 3 ms 7516 KB Output is correct
11 Correct 3 ms 7512 KB Output is correct
12 Correct 2 ms 7516 KB Output is correct
13 Correct 2 ms 7516 KB Output is correct
14 Correct 2 ms 7540 KB Output is correct
15 Correct 3 ms 7516 KB Output is correct
16 Correct 3 ms 7516 KB Output is correct
17 Correct 3 ms 7516 KB Output is correct
18 Correct 3 ms 7516 KB Output is correct
19 Correct 3 ms 7516 KB Output is correct
20 Correct 3 ms 7516 KB Output is correct
21 Correct 3 ms 7516 KB Output is correct
22 Correct 3 ms 7516 KB Output is correct
23 Correct 4 ms 7516 KB Output is correct
24 Correct 3 ms 7512 KB Output is correct
25 Correct 3 ms 7516 KB Output is correct
26 Correct 3 ms 7516 KB Output is correct
27 Correct 2 ms 7516 KB Output is correct
28 Correct 3 ms 7512 KB Output is correct
29 Correct 2 ms 7516 KB Output is correct
30 Correct 10 ms 7512 KB Output is correct
31 Correct 12 ms 7692 KB Output is correct
32 Correct 15 ms 7728 KB Output is correct
33 Correct 20 ms 7716 KB Output is correct
34 Correct 14 ms 7512 KB Output is correct
35 Correct 4 ms 7516 KB Output is correct
36 Correct 4 ms 7724 KB Output is correct
37 Correct 4 ms 7524 KB Output is correct
38 Correct 13 ms 7772 KB Output is correct
39 Correct 14 ms 7772 KB Output is correct
40 Correct 14 ms 7772 KB Output is correct
41 Correct 4 ms 7772 KB Output is correct
42 Correct 4 ms 7768 KB Output is correct
43 Correct 4 ms 7772 KB Output is correct
44 Correct 14 ms 7776 KB Output is correct
45 Correct 14 ms 7768 KB Output is correct
46 Correct 14 ms 7780 KB Output is correct
47 Correct 4 ms 7772 KB Output is correct
48 Correct 4 ms 7516 KB Output is correct
49 Correct 4 ms 7772 KB Output is correct
50 Correct 14 ms 7512 KB Output is correct
51 Correct 13 ms 7516 KB Output is correct
52 Correct 13 ms 7516 KB Output is correct
53 Correct 14 ms 7516 KB Output is correct
54 Correct 14 ms 7516 KB Output is correct
55 Correct 13 ms 7516 KB Output is correct
56 Correct 3 ms 7516 KB Output is correct
57 Correct 3 ms 7512 KB Output is correct
58 Correct 4 ms 7516 KB Output is correct
59 Correct 2 ms 7512 KB Output is correct
60 Correct 3 ms 7516 KB Output is correct
61 Correct 3 ms 7516 KB Output is correct
62 Correct 2576 ms 31956 KB Output is correct
63 Correct 1804 ms 41440 KB Output is correct
64 Correct 3035 ms 47036 KB Output is correct
65 Correct 4951 ms 48720 KB Output is correct
66 Correct 4997 ms 51576 KB Output is correct
67 Correct 4968 ms 51580 KB Output is correct
68 Correct 4885 ms 51580 KB Output is correct
69 Execution timed out 5053 ms 51096 KB Time limit exceeded
70 Halted 0 ms 0 KB -