oj.uz

답안 #473460

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
473460 2021-09-15T14:39:16 Z fadi57 Railway (BOI17_railway) C++14
100 / 100
 411 ms 66748 KB 
#include<bits/stdc++.h>
using namespace std;
const int mx=1e5+10;
typedef long long ll;

 int mod=1e9+7;
const int MXm=22;
#define F first
#define S second
const int inf=1e9+10;

vector<int>adj[mx];
 vector<pair<int,int>>edges;vector<int>ans;
  int n,m,k;
int depth[mx],dp[20][mx],sz[mx], active[mx];
  set<int>S[mx];
  vector<int>E[mx];
map<pair<int,int>,int>mp;

vector<int>vec[mx];

 void dfs(int node,int par){
 dp[0][node]=par;
 sz[node]=1;
for(int j=1;j<19;j++){

    dp[j][node]=dp[j-1][dp[j-1][node]];
}

  for(auto it:adj[node]){
     if(it==par){continue;}
     depth[it]=depth[node]+1;
     dfs(it,node);
    sz[node]+=sz[it];
  }
 return;
 }
 int kth(int node,int x){
  for(int i=0;i<19;i++){
   if(x&(1<<i)){
        x-=(1<<i);
        node=dp[i][node];
    }
 }
 return node;

 }
 int lca(int a,int b){

   if(depth[b]<depth[a]){swap(a,b);}
   int dis=depth[b]-depth[a];
    b=kth(b,dis);
  // cout<<b;
   if(a==b){return a;}

     for(int j=19;j>=0;j--){
   int aa=dp[j][a];int bb=dp[j][b];
  if(aa==bb){continue;}
  a=aa;b=bb;}

   return dp[0][a];

  }



  void dfs2(int node,int par,bool keep){
     int mx2=-1;int bigchild=-1;
   for(auto it:adj[node]){
     if(it==par){continue;}
    if(sz[it]>mx2){mx2=sz[it];bigchild=it;}
  }

   for(auto it:adj[node]){
    if(it!=bigchild&&it!=par){
        dfs2(it,node,0);
    }
   }
   if(bigchild!=-1){
    dfs2(bigchild,node,1);
    swap(S[bigchild],S[node]);
   }
 for(auto it:vec[node]){

    S[node].insert(it);
 }
   for(auto it:adj[node]){
    if(it!=bigchild&&it!=par){
        for(auto j:S[it]){

            S[node].insert(j);
        }
    }
    /*
    if(it!=par){
         if(vec[it].size()){mp[{min(it,node),max(it,node)}]++;}
    }
    */
   }
   for(auto it:E[node]){

    if(S[node].find(it)!=S[node].end()){
        S[node].erase(it);
    }
   }
  if(S[node].size()>=k){

  ans.push_back(mp[{node,par}]);

  }
return;
 }


 void test(){
 for(int i=1;i<=n;i++){

    for(int j=i+1;j<=n;j++){
        if(mp[{i,j}]){
            cout<<i<<" "<<j<<endl;
        }
    }
 }

 }

void test2(){


  cout<<ans.size()<<endl;
  sort(ans.begin(),ans.end());
  for(auto it:ans){
    cout<<it<<" ";
  }

 }

  int main(){
   ios_base::sync_with_stdio(0) ;
	cin.tie(0) ;
     cin>>n>>m>>k;
     for(int i=0;i<n-1;i++){
          int a,b;cin>>a>>b;

          mp[{a,b}]=mp[{b,a}]=i+1;
         edges.push_back({a,b});
          adj[a].push_back(b);
          adj[b].push_back(a);
      }
      dfs(1,0);
     for(int i=0;i<m;i++){

        int s;
        cin>>s;
        int now=0;
     for(int j=0;j<s;j++){
           int x;cin>>x;

           if(now==0){
                now=x;
           }else{
            now=lca(now,x);
           }
           active[i]=1;
         // S[x].insert(i);
          vec[x].push_back(i);
        }

     E[now].push_back(i);

      }
    dfs2(1,0,0);
      test2();
      }

Compilation message

railway.cpp: In function 'void dfs2(int, int, bool)':
railway.cpp:106:20: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  106 |   if(S[node].size()>=k){
      |                    ^

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 12108 KB Output is correct
2 Correct 19 ms 14884 KB Output is correct
3 Correct 18 ms 14796 KB Output is correct
4 Correct 7 ms 12108 KB Output is correct
5 Correct 7 ms 12108 KB Output is correct
6 Correct 20 ms 15584 KB Output is correct
7 Correct 19 ms 14912 KB Output is correct
8 Correct 17 ms 14924 KB Output is correct
9 Correct 19 ms 15036 KB Output is correct
10 Correct 7 ms 12068 KB Output is correct
11 Correct 7 ms 12152 KB Output is correct
12 Correct 7 ms 12072 KB Output is correct
13 Correct 7 ms 12108 KB Output is correct
14 Correct 8 ms 12108 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 12108 KB Output is correct
2 Correct 19 ms 14884 KB Output is correct
3 Correct 18 ms 14796 KB Output is correct
4 Correct 7 ms 12108 KB Output is correct
5 Correct 7 ms 12108 KB Output is correct
6 Correct 20 ms 15584 KB Output is correct
7 Correct 19 ms 14912 KB Output is correct
8 Correct 17 ms 14924 KB Output is correct
9 Correct 19 ms 15036 KB Output is correct
10 Correct 7 ms 12068 KB Output is correct
11 Correct 7 ms 12152 KB Output is correct
12 Correct 7 ms 12072 KB Output is correct
13 Correct 7 ms 12108 KB Output is correct
14 Correct 8 ms 12108 KB Output is correct
15 Correct 49 ms 19168 KB Output is correct
16 Correct 52 ms 19152 KB Output is correct
17 Correct 53 ms 19212 KB Output is correct
18 Correct 20 ms 15664 KB Output is correct
19 Correct 20 ms 15108 KB Output is correct
20 Correct 68 ms 20656 KB Output is correct
21 Correct 61 ms 20696 KB Output is correct
22 Correct 8 ms 12056 KB Output is correct
23 Correct 19 ms 14796 KB Output is correct
24 Correct 20 ms 14796 KB Output is correct
25 Correct 7 ms 12108 KB Output is correct
26 Correct 7 ms 12108 KB Output is correct
27 Correct 19 ms 15564 KB Output is correct
28 Correct 19 ms 14904 KB Output is correct
29 Correct 22 ms 15120 KB Output is correct
30 Correct 20 ms 15052 KB Output is correct
31 Correct 9 ms 12072 KB Output is correct
32 Correct 7 ms 12068 KB Output is correct
33 Correct 7 ms 12140 KB Output is correct
34 Correct 7 ms 12108 KB Output is correct
35 Correct 7 ms 12108 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 253 ms 58244 KB Output is correct
2 Correct 9 ms 12116 KB Output is correct
3 Correct 249 ms 57772 KB Output is correct
4 Correct 213 ms 57096 KB Output is correct
5 Correct 206 ms 56168 KB Output is correct
6 Correct 197 ms 56176 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 247 ms 50776 KB Output is correct
2 Correct 281 ms 49608 KB Output is correct
3 Correct 306 ms 52644 KB Output is correct
4 Correct 350 ms 61088 KB Output is correct
5 Correct 350 ms 55608 KB Output is correct
6 Correct 254 ms 51036 KB Output is correct
7 Correct 234 ms 50736 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 247 ms 50776 KB Output is correct
2 Correct 281 ms 49608 KB Output is correct
3 Correct 306 ms 52644 KB Output is correct
4 Correct 350 ms 61088 KB Output is correct
5 Correct 350 ms 55608 KB Output is correct
6 Correct 254 ms 51036 KB Output is correct
7 Correct 234 ms 50736 KB Output is correct
8 Correct 237 ms 51064 KB Output is correct
9 Correct 253 ms 50928 KB Output is correct
10 Correct 192 ms 55872 KB Output is correct
11 Correct 245 ms 55848 KB Output is correct
12 Correct 230 ms 45264 KB Output is correct
13 Correct 214 ms 45220 KB Output is correct
14 Correct 292 ms 50348 KB Output is correct
15 Correct 328 ms 49608 KB Output is correct
16 Correct 379 ms 60604 KB Output is correct
17 Correct 400 ms 59312 KB Output is correct
18 Correct 404 ms 59332 KB Output is correct
19 Correct 314 ms 48724 KB Output is correct
20 Correct 236 ms 51232 KB Output is correct
21 Correct 259 ms 51320 KB Output is correct
22 Correct 262 ms 51480 KB Output is correct

Subtask #6
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 12108 KB Output is correct
2 Correct 19 ms 14884 KB Output is correct
3 Correct 18 ms 14796 KB Output is correct
4 Correct 7 ms 12108 KB Output is correct
5 Correct 7 ms 12108 KB Output is correct
6 Correct 20 ms 15584 KB Output is correct
7 Correct 19 ms 14912 KB Output is correct
8 Correct 17 ms 14924 KB Output is correct
9 Correct 19 ms 15036 KB Output is correct
10 Correct 7 ms 12068 KB Output is correct
11 Correct 7 ms 12152 KB Output is correct
12 Correct 7 ms 12072 KB Output is correct
13 Correct 7 ms 12108 KB Output is correct
14 Correct 8 ms 12108 KB Output is correct
15 Correct 49 ms 19168 KB Output is correct
16 Correct 52 ms 19152 KB Output is correct
17 Correct 53 ms 19212 KB Output is correct
18 Correct 20 ms 15664 KB Output is correct
19 Correct 20 ms 15108 KB Output is correct
20 Correct 68 ms 20656 KB Output is correct
21 Correct 61 ms 20696 KB Output is correct
22 Correct 8 ms 12056 KB Output is correct
23 Correct 19 ms 14796 KB Output is correct
24 Correct 20 ms 14796 KB Output is correct
25 Correct 7 ms 12108 KB Output is correct
26 Correct 7 ms 12108 KB Output is correct
27 Correct 19 ms 15564 KB Output is correct
28 Correct 19 ms 14904 KB Output is correct
29 Correct 22 ms 15120 KB Output is correct
30 Correct 20 ms 15052 KB Output is correct
31 Correct 9 ms 12072 KB Output is correct
32 Correct 7 ms 12068 KB Output is correct
33 Correct 7 ms 12140 KB Output is correct
34 Correct 7 ms 12108 KB Output is correct
35 Correct 7 ms 12108 KB Output is correct
36 Correct 253 ms 58244 KB Output is correct
37 Correct 9 ms 12116 KB Output is correct
38 Correct 249 ms 57772 KB Output is correct
39 Correct 213 ms 57096 KB Output is correct
40 Correct 206 ms 56168 KB Output is correct
41 Correct 197 ms 56176 KB Output is correct
42 Correct 247 ms 50776 KB Output is correct
43 Correct 281 ms 49608 KB Output is correct
44 Correct 306 ms 52644 KB Output is correct
45 Correct 350 ms 61088 KB Output is correct
46 Correct 350 ms 55608 KB Output is correct
47 Correct 254 ms 51036 KB Output is correct
48 Correct 234 ms 50736 KB Output is correct
49 Correct 237 ms 51064 KB Output is correct
50 Correct 253 ms 50928 KB Output is correct
51 Correct 192 ms 55872 KB Output is correct
52 Correct 245 ms 55848 KB Output is correct
53 Correct 230 ms 45264 KB Output is correct
54 Correct 214 ms 45220 KB Output is correct
55 Correct 292 ms 50348 KB Output is correct
56 Correct 328 ms 49608 KB Output is correct
57 Correct 379 ms 60604 KB Output is correct
58 Correct 400 ms 59312 KB Output is correct
59 Correct 404 ms 59332 KB Output is correct
60 Correct 314 ms 48724 KB Output is correct
61 Correct 236 ms 51232 KB Output is correct
62 Correct 259 ms 51320 KB Output is correct
63 Correct 262 ms 51480 KB Output is correct
64 Correct 253 ms 50940 KB Output is correct
65 Correct 411 ms 61356 KB Output is correct
66 Correct 318 ms 56640 KB Output is correct
67 Correct 305 ms 51920 KB Output is correct
68 Correct 211 ms 42940 KB Output is correct
69 Correct 203 ms 42900 KB Output is correct
70 Correct 263 ms 53028 KB Output is correct
71 Correct 255 ms 50812 KB Output is correct
72 Correct 8 ms 12108 KB Output is correct
73 Correct 19 ms 14780 KB Output is correct
74 Correct 20 ms 14772 KB Output is correct
75 Correct 7 ms 12104 KB Output is correct
76 Correct 7 ms 12080 KB Output is correct
77 Correct 21 ms 15624 KB Output is correct
78 Correct 26 ms 14956 KB Output is correct
79 Correct 18 ms 14924 KB Output is correct
80 Correct 27 ms 15052 KB Output is correct
81 Correct 7 ms 12072 KB Output is correct
82 Correct 7 ms 12056 KB Output is correct
83 Correct 7 ms 12116 KB Output is correct
84 Correct 8 ms 12108 KB Output is correct
85 Correct 8 ms 12108 KB Output is correct
86 Correct 58 ms 19152 KB Output is correct
87 Correct 52 ms 19228 KB Output is correct
88 Correct 53 ms 19216 KB Output is correct
89 Correct 23 ms 15564 KB Output is correct
90 Correct 23 ms 15068 KB Output is correct
91 Correct 55 ms 20744 KB Output is correct
92 Correct 55 ms 20704 KB Output is correct
93 Correct 8 ms 12108 KB Output is correct
94 Correct 286 ms 58204 KB Output is correct
95 Correct 236 ms 57708 KB Output is correct
96 Correct 285 ms 57108 KB Output is correct
97 Correct 231 ms 56248 KB Output is correct
98 Correct 198 ms 56260 KB Output is correct
99 Correct 372 ms 59536 KB Output is correct
100 Correct 337 ms 59432 KB Output is correct
101 Correct 409 ms 66748 KB Output is correct
102 Correct 300 ms 49944 KB Output is correct
103 Correct 234 ms 51012 KB Output is correct
104 Correct 234 ms 51440 KB Output is correct
105 Correct 221 ms 50884 KB Output is correct
106 Correct 257 ms 51016 KB Output is correct
107 Correct 225 ms 50828 KB Output is correct
108 Correct 204 ms 55792 KB Output is correct
109 Correct 210 ms 55800 KB Output is correct
110 Correct 197 ms 45156 KB Output is correct
111 Correct 200 ms 45204 KB Output is correct
112 Correct 300 ms 50628 KB Output is correct
113 Correct 267 ms 50200 KB Output is correct