제출 #162408

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
162408		MvC	Railway (BOI17_railway)	C++11	23 / 100	1083 ms	24108 KiB

railway

#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define mkp make_pair
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<62);
const int inf=(1<<30);
const int nmax=1e5+50;
const int mod=1e9+7;
using namespace std;
int n,m,k,i,x,y,in[nmax],out[nmax],tin,up[nmax][20],mn,mx,ed[nmax],rs;
vector<pair<int,int> >a[nmax];
bitset<nmax>on;
void dfs(int x,int p)
{
	in[x]=++tin;
	up[x][0]=p;
	for(int i=1;i<19;i++)up[x][i]=up[up[x][i-1]][i-1];
	for(int i=0;i<(int)a[x].size();i++)
	{
		int y=a[x][i].fr;
		if(y==p)continue;
		dfs(y,x);
	}
	out[x]=++tin;
}
void sol(int x,int p,int e)
{
	for(int i=0;i<(int)a[x].size();i++)
	{
		int y=a[x][i].fr;
		if(y==p)continue;
		sol(y,x,a[x][i].sc);
		if(on[y])on[x]=1;
	}
	if(on[x] && (mn<in[x] || mx>out[x]))ed[e]++;
}
int main()
{
	//freopen("sol.in","r",stdin);
	//freopen("sol.out","w",stdout);
	//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
	ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
	cin>>n>>m>>k;
	for(i=1;i<n;i++)
	{
		cin>>x>>y;
		a[x].pb(mkp(y,i));
		a[y].pb(mkp(x,i));
	}
	dfs(1,1);
	while(m--)
	{
		cin>>x;
		mn=inf,mx=0;
		for(i=1;i<=x;i++)
		{
			cin>>y;
			on[y]=1;
			mn=min(mn,in[y]);
			mx=max(mx,out[y]);
		}
		if(x)
		{
			sol(1,1,0);
			on.reset();
		}
	}
	for(i=1;i<n;i++)if(ed[i]>=k)rs++;
	cout<<rs<<endl;
	for(i=1;i<n;i++)if(ed[i]>=k)cout<<i<<" ";
	cout<<endl;
	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

railway.cpp:2:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("O3")
 
railway.cpp:3:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("unroll-loops")

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