oj.uz

Submission #305334

# Submission time Handle Problem Language Result Execution time Memory
305334 2020-09-23T00:39:36 Z NaimSS Railway (BOI17_railway) C++14
100 / 100
 165 ms 25724 KB 
#include <bits/stdc++.h>
#define ld long double
#define endl "\n"
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pb(x) push_back(x)
#define mp(a,b) make_pair(a,b)
#define ms(v,x) memset(v,x,sizeof(v))
#define all(v) v.begin(),v.end()
#define ff first
#define ss second
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define per(i, a, b) for(int i = b-1; i>=a ; i--)
#define trav(a, x) for(auto& a : x)
#define allin(a , x) for(auto a : x)
#define Unique(v) sort(all(v));v.erase(unique(all(v)),v.end());
#define sz(v) ((int)v.size())
//#define int long long
using namespace std;
typedef vector<int> vi;
#define y1 abacaba
#define left sefude
#define db(x) cerr << #x <<" == "<<x << endl;
#define db2(x,y) cerr<<#x <<" == "<<x<<", "<<#y<<" == "<<y<<endl;
#define db3(x,y,z) cerr << #x<<" == "<<x<<", "<<#y<<" == "<<y<<", "<<#z<<" == "<<z<<endl; 
#define prl cerr<<"called: "<< __LINE__ << endl;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
inline ll mod(ll n, ll m ){ ll ret = n%m; if(ret < 0) ret += m; return ret; }
ll gcd(ll a, ll b){return (b == 0LL ? a : gcd(b, a%b));}
ll exp(ll a,ll b,ll m){
    if(b==0LL) return 1LL;
    if(b==1LL) return mod(a,m);
    ll k = mod(exp(a,b/2,m),m);
    if(b&1LL){
        return mod(a*mod(k*k,m),m);
    }
    else return mod(k*k,m);
}

const int N = 100100,MAXL = 20,inf = 100100;

int ans[N][MAXL];
vi g[N];
int H[N];
int in[N];
int T=0;
void dfs(int v,int p = -1){
  in[v] = ++T;
  for(int to : g[v])if(to!=p){
    ans[to][0] = v;
    H[to] = H[v] + 1;
    dfs(to,v);
  }
}
int lca(int a,int b){
  if(H[a] < H[b])swap(a,b);
  for(int i=MAXL-1;i>=0;i--){
    if(H[a] - (1<<i) >= H[b])a=ans[a][i];
  }
  if(a==b)return a;
  for(int i=MAXL-1;i>=0;i--)
    if(ans[a][i]!=ans[b][i])a=ans[a][i],b=ans[b][i];
  return ans[a][0];
}


ll pre[N];

void add_path(int l,int r){
  if(l==r)return;
  pre[l]++;pre[r]--;
}

void add(int a,int b){
  int L = lca(a,b);
  add_path(a,L);add_path(b,L);
}

void virtual_tree(vi K){
    auto f = [&](int a , int b){
        return in[a] < in[b];
    };
    //vector<edge> e;
    sort(all(K) , f);
    int m = sz(K);
    rep(i,1,m){
        K.push_back(lca(K[i] , K[i-1]));
    }
    sort(all(K) , f);
    K.erase(unique(all(K)) , K.end());
    
    rep(i,0,sz(K) -1){
        int z = lca(K[i] , K[i+1]);
        add(K[i + 1],z);
        //e.push_back({K[i+1] , z ,dist(z,K[i+1])});
    }
    
    return;
    //return {e ,K[0]};
}


int pai[N];
void go(int v,int p = -1){
  for(int to : g[v])if(to!=p){
    pai[to] = v;
    go(to,v);
    pre[v]+=pre[to];
  }
}

pii e[N];

int32_t main(){
  fastio;
  int n,q,k;
  cin >> n >> q >> k;
  for(int i=1;i<n;i++){
    int a,b;cin>>a>>b;
    g[a].pb(b);
    g[b].pb(a);
    e[i] = pii(a,b);
  }
  ans[1][0]=1;
  dfs(1);
  for(int j=1;j<MAXL;j++){
    for(int i=1;i<=n;i++){
      ans[i][j] = ans[ans[i][j-1]][j-1];
    }
  }
  while(q--){
    int s;
    cin >> s;
    vi v(s);
    rep(i,0,s)cin >> v[i];
    virtual_tree(v);
  }
  go(1);
 
  vi res;
  
  for(int i=1;i<n;i++){

    if(pai[e[i].ff] != e[i].ss)swap(e[i].ff,e[i].ss);
    assert(pai[e[i].ff] == e[i].ss);
    if(pre[e[i].ff] >= k)res.pb(i);
  }
  cout << sz(res)<<endl;
  for(int x : res)cout<<x<<" ";
  cout<<endl;

  // math -> gcd it all
  // Did u check N=1? Did you switch N,M?
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 7 ms 4224 KB Output is correct
3 Correct 7 ms 4224 KB Output is correct
4 Correct 3 ms 2688 KB Output is correct
5 Correct 2 ms 2688 KB Output is correct
6 Correct 8 ms 4608 KB Output is correct
7 Correct 7 ms 4224 KB Output is correct
8 Correct 6 ms 4224 KB Output is correct
9 Correct 6 ms 4224 KB Output is correct
10 Correct 3 ms 2688 KB Output is correct
11 Correct 2 ms 2688 KB Output is correct
12 Correct 2 ms 2688 KB Output is correct
13 Correct 2 ms 2688 KB Output is correct
14 Correct 2 ms 2688 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 7 ms 4224 KB Output is correct
3 Correct 7 ms 4224 KB Output is correct
4 Correct 3 ms 2688 KB Output is correct
5 Correct 2 ms 2688 KB Output is correct
6 Correct 8 ms 4608 KB Output is correct
7 Correct 7 ms 4224 KB Output is correct
8 Correct 6 ms 4224 KB Output is correct
9 Correct 6 ms 4224 KB Output is correct
10 Correct 3 ms 2688 KB Output is correct
11 Correct 2 ms 2688 KB Output is correct
12 Correct 2 ms 2688 KB Output is correct
13 Correct 2 ms 2688 KB Output is correct
14 Correct 2 ms 2688 KB Output is correct
15 Correct 42 ms 4600 KB Output is correct
16 Correct 43 ms 4600 KB Output is correct
17 Correct 43 ms 4600 KB Output is correct
18 Correct 11 ms 4608 KB Output is correct
19 Correct 9 ms 4224 KB Output is correct
20 Correct 38 ms 4856 KB Output is correct
21 Correct 42 ms 4728 KB Output is correct
22 Correct 2 ms 2688 KB Output is correct
23 Correct 8 ms 4224 KB Output is correct
24 Correct 7 ms 4224 KB Output is correct
25 Correct 2 ms 2688 KB Output is correct
26 Correct 2 ms 2688 KB Output is correct
27 Correct 8 ms 4608 KB Output is correct
28 Correct 8 ms 4224 KB Output is correct
29 Correct 6 ms 4224 KB Output is correct
30 Correct 7 ms 4224 KB Output is correct
31 Correct 2 ms 2688 KB Output is correct
32 Correct 2 ms 2688 KB Output is correct
33 Correct 2 ms 2688 KB Output is correct
34 Correct 2 ms 2688 KB Output is correct
35 Correct 2 ms 2688 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 23536 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Correct 149 ms 25076 KB Output is correct
4 Correct 130 ms 24440 KB Output is correct
5 Correct 165 ms 25328 KB Output is correct
6 Correct 142 ms 25724 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 19576 KB Output is correct
2 Correct 116 ms 18552 KB Output is correct
3 Correct 119 ms 18296 KB Output is correct
4 Correct 120 ms 18424 KB Output is correct
5 Correct 120 ms 18296 KB Output is correct
6 Correct 123 ms 21496 KB Output is correct
7 Correct 103 ms 21368 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 19576 KB Output is correct
2 Correct 116 ms 18552 KB Output is correct
3 Correct 119 ms 18296 KB Output is correct
4 Correct 120 ms 18424 KB Output is correct
5 Correct 120 ms 18296 KB Output is correct
6 Correct 123 ms 21496 KB Output is correct
7 Correct 103 ms 21368 KB Output is correct
8 Correct 137 ms 21496 KB Output is correct
9 Correct 130 ms 21500 KB Output is correct
10 Correct 151 ms 25504 KB Output is correct
11 Correct 137 ms 25456 KB Output is correct
12 Correct 114 ms 18168 KB Output is correct
13 Correct 110 ms 18168 KB Output is correct
14 Correct 143 ms 18296 KB Output is correct
15 Correct 124 ms 18168 KB Output is correct
16 Correct 119 ms 18424 KB Output is correct
17 Correct 126 ms 18296 KB Output is correct
18 Correct 123 ms 18296 KB Output is correct
19 Correct 116 ms 18552 KB Output is correct
20 Correct 99 ms 21880 KB Output is correct
21 Correct 102 ms 21836 KB Output is correct
22 Correct 112 ms 21744 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 7 ms 4224 KB Output is correct
3 Correct 7 ms 4224 KB Output is correct
4 Correct 3 ms 2688 KB Output is correct
5 Correct 2 ms 2688 KB Output is correct
6 Correct 8 ms 4608 KB Output is correct
7 Correct 7 ms 4224 KB Output is correct
8 Correct 6 ms 4224 KB Output is correct
9 Correct 6 ms 4224 KB Output is correct
10 Correct 3 ms 2688 KB Output is correct
11 Correct 2 ms 2688 KB Output is correct
12 Correct 2 ms 2688 KB Output is correct
13 Correct 2 ms 2688 KB Output is correct
14 Correct 2 ms 2688 KB Output is correct
15 Correct 42 ms 4600 KB Output is correct
16 Correct 43 ms 4600 KB Output is correct
17 Correct 43 ms 4600 KB Output is correct
18 Correct 11 ms 4608 KB Output is correct
19 Correct 9 ms 4224 KB Output is correct
20 Correct 38 ms 4856 KB Output is correct
21 Correct 42 ms 4728 KB Output is correct
22 Correct 2 ms 2688 KB Output is correct
23 Correct 8 ms 4224 KB Output is correct
24 Correct 7 ms 4224 KB Output is correct
25 Correct 2 ms 2688 KB Output is correct
26 Correct 2 ms 2688 KB Output is correct
27 Correct 8 ms 4608 KB Output is correct
28 Correct 8 ms 4224 KB Output is correct
29 Correct 6 ms 4224 KB Output is correct
30 Correct 7 ms 4224 KB Output is correct
31 Correct 2 ms 2688 KB Output is correct
32 Correct 2 ms 2688 KB Output is correct
33 Correct 2 ms 2688 KB Output is correct
34 Correct 2 ms 2688 KB Output is correct
35 Correct 2 ms 2688 KB Output is correct
36 Correct 127 ms 23536 KB Output is correct
37 Correct 2 ms 2688 KB Output is correct
38 Correct 149 ms 25076 KB Output is correct
39 Correct 130 ms 24440 KB Output is correct
40 Correct 165 ms 25328 KB Output is correct
41 Correct 142 ms 25724 KB Output is correct
42 Correct 99 ms 19576 KB Output is correct
43 Correct 116 ms 18552 KB Output is correct
44 Correct 119 ms 18296 KB Output is correct
45 Correct 120 ms 18424 KB Output is correct
46 Correct 120 ms 18296 KB Output is correct
47 Correct 123 ms 21496 KB Output is correct
48 Correct 103 ms 21368 KB Output is correct
49 Correct 137 ms 21496 KB Output is correct
50 Correct 130 ms 21500 KB Output is correct
51 Correct 151 ms 25504 KB Output is correct
52 Correct 137 ms 25456 KB Output is correct
53 Correct 114 ms 18168 KB Output is correct
54 Correct 110 ms 18168 KB Output is correct
55 Correct 143 ms 18296 KB Output is correct
56 Correct 124 ms 18168 KB Output is correct
57 Correct 119 ms 18424 KB Output is correct
58 Correct 126 ms 18296 KB Output is correct
59 Correct 123 ms 18296 KB Output is correct
60 Correct 116 ms 18552 KB Output is correct
61 Correct 99 ms 21880 KB Output is correct
62 Correct 102 ms 21836 KB Output is correct
63 Correct 112 ms 21744 KB Output is correct
64 Correct 109 ms 21656 KB Output is correct
65 Correct 127 ms 18296 KB Output is correct
66 Correct 149 ms 18168 KB Output is correct
67 Correct 145 ms 18272 KB Output is correct
68 Correct 88 ms 18040 KB Output is correct
69 Correct 87 ms 18076 KB Output is correct
70 Correct 112 ms 22012 KB Output is correct
71 Correct 133 ms 21372 KB Output is correct
72 Correct 2 ms 2688 KB Output is correct
73 Correct 7 ms 4224 KB Output is correct
74 Correct 7 ms 4224 KB Output is correct
75 Correct 2 ms 2688 KB Output is correct
76 Correct 2 ms 2688 KB Output is correct
77 Correct 8 ms 4608 KB Output is correct
78 Correct 8 ms 4224 KB Output is correct
79 Correct 6 ms 4224 KB Output is correct
80 Correct 6 ms 4224 KB Output is correct
81 Correct 2 ms 2688 KB Output is correct
82 Correct 2 ms 2688 KB Output is correct
83 Correct 2 ms 2688 KB Output is correct
84 Correct 2 ms 2688 KB Output is correct
85 Correct 2 ms 2688 KB Output is correct
86 Correct 43 ms 4600 KB Output is correct
87 Correct 42 ms 4600 KB Output is correct
88 Correct 42 ms 4600 KB Output is correct
89 Correct 8 ms 4608 KB Output is correct
90 Correct 8 ms 4224 KB Output is correct
91 Correct 38 ms 4728 KB Output is correct
92 Correct 47 ms 4728 KB Output is correct
93 Correct 2 ms 2688 KB Output is correct
94 Correct 134 ms 25328 KB Output is correct
95 Correct 130 ms 25076 KB Output is correct
96 Correct 128 ms 24440 KB Output is correct
97 Correct 156 ms 25328 KB Output is correct
98 Correct 132 ms 25712 KB Output is correct
99 Correct 128 ms 18296 KB Output is correct
100 Correct 119 ms 18296 KB Output is correct
101 Correct 121 ms 18296 KB Output is correct
102 Correct 114 ms 18552 KB Output is correct
103 Correct 99 ms 21496 KB Output is correct
104 Correct 102 ms 21752 KB Output is correct
105 Correct 99 ms 21368 KB Output is correct
106 Correct 133 ms 21624 KB Output is correct
107 Correct 122 ms 21496 KB Output is correct
108 Correct 130 ms 25456 KB Output is correct
109 Correct 129 ms 25456 KB Output is correct
110 Correct 101 ms 18168 KB Output is correct
111 Correct 98 ms 18168 KB Output is correct
112 Correct 123 ms 18188 KB Output is correct
113 Correct 121 ms 18168 KB Output is correct