Submission #419679

#	Time	Username	Problem	Language	Result	Execution time	Memory
419679		victoriad	Railway (BOI17_railway)	C++14	23 / 100	322 ms	524292 KiB

railway

#include <cmath>
#include <cstdio>
#include <iostream>
#include <utility>
#include <algorithm>
#include <vector>

using namespace std;

void dfs(int i,vector<int>&depth,vector<int>&parent,vector<vector<int> >&a,vector<bool>&v,int p){
	v[i]=true;
	depth[i]=1+depth[p];
	parent[i]=p;
	for(int c:a[i]){
		if(!v[c])
		dfs(c,depth,parent,a,v,i);
	}
}

void conectar(int a,int b,vector<int>&d,vector<int>&p,vector<int>&con,int k,vector<int>&r,vector<vector<int> >&id,vector<bool>&v){
	if(d[a]<d[b])swap(a,b);
	while(d[a]!=d[b]){
		int pa=p[a];
		if(!v[id[a][pa]]){
		con[id[a][pa]]++;
		v[id[a][pa]]=true;
		if(con[id[a][pa]]==k && pa!=a){
			r.push_back(id[a][pa]);
		}
		}
		a=pa;
	}
	while(a!=b){
		int pa=p[a];
		int pb=p[b];
		if(!v[id[a][pa]]){
		con[id[a][pa]]++;
		v[id[a][pa]]=true;
		if(con[id[a][pa]]==k && pa!=a){
			r.push_back(id[a][pa]);
		}
		}
		if(!v[id[b][pb]]){
		con[id[b][pb]]++;
		v[id[b][pb]]=true;
		if(con[id[b][pb]]==k && pb!=b){
			r.push_back(id[b][pb]);
		}
		}
		a=pa;
		b=pb;
	}
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	int n,k,m,x,y,j;
	cin>>n>>m>>k;
	vector<vector<int> >ref(n+1);
	vector<int>re(n+1,0);
	for(int i=0;i<n+1;i++)ref[i]=re;
	vector<vector<int> >a(n);
	for(int i=0;i<n-1;i++){
		cin>>x>>y;
		x--;
		y--;
		ref[x][y]=i+1;
		ref[y][x]=i+1;
		a[x].push_back(y);
		a[y].push_back(x);
	}
	vector<int>depth(n,0);
	vector<int>parent(n,0);
	vector<bool>v(n,false);
	dfs(0,depth,parent,a,v,0);
	vector<int>con(n+1,0);
	vector<int>r;
	for(int i=0;i<m;i++){
		cin>>j;
		cin>>x;
		x--;
		v.assign(n+1,false);
		for(int o=1;o<j;o++){
			cin>>y;
			y--;
			conectar(x,y,depth,parent,con,k,r,ref,v);
			y=x;
		}
	}
	sort(r.begin(),r.end());
	cout<<r.size()<<"\n";
	for(int i=0;i<r.size();i++){
		cout<<r[i]<<" ";
	}

	return 0;
}

Compilation message (stderr)

railway.cpp: In function 'int main()':
railway.cpp:93:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   93 |  for(int i=0;i<r.size();i++){
      |              ~^~~~~~~~~

• Subtask 1: 8 / 8
• Subtask 2: 15 / 15
• Subtask 3: 0 / 7
• Subtask 4: 0 / 29
• Subtask 5: 0 / 16
• Subtask 6: 0 / 25