Submission #1516558

---

Source Code Expand

//by yjz
#include<bits/stdc++.h>
using namespace std;
#define FF first
#define SS second
#define PB push_back
#define MP make_pair
#define bged(v) (v).begin(),(v).end()
#define foreach(it,s) for(__typeof((s).begin()) it=(s).begin();it!=(s).end();it++)
typedef long long ll;
const int Imx=2147483647;
const ll Lbig=2e18;
const int mod=1e9+7;
//My i/o stream
struct fastio
{
	char s[100000];
	int it,len;
	fastio(){it=len=0;}
	inline char get()
	{
		if(it<len)return s[it++];it=0;
		len=fread(s,1,100000,stdin);
		if(len==0)return EOF;else return s[it++];
	}
	bool notend()
	{
		char c=get();
		while(c==' '||c=='\n')c=get();
		if(it>0)it--;
		return c!=EOF;
	}
}_buff;
#define geti(x) x=getnum()
#define getii(x,y) geti(x),geti(y)
#define getiii(x,y,z) getii(x,y),geti(z)
#define puti(x) putnum(x),putchar(' ')
#define putii(x,y) puti(x),puti(y)
#define putiii(x,y,z) putii(x,y),puti(z)
#define putsi(x) putnum(x),putchar('\n')
#define putsii(x,y) puti(x),putsi(y)
#define putsiii(x,y,z) putii(x,y),putsi(z)
inline ll getnum()
{
	ll r=0;bool ng=0;char c;c=_buff.get();
	while(c!='-'&&(c<'0'||c>'9'))c=_buff.get();
	if(c=='-')ng=1,c=_buff.get();
	while(c>='0'&&c<='9')r=r*10+c-'0',c=_buff.get();
	return ng?-r:r;
}
template<class T> inline void putnum(T x)
{
	if(x<0)putchar('-'),x=-x;
	register short a[20]={},sz=0;
	while(x)a[sz++]=x%10,x/=10;
	if(sz==0)putchar('0');
	for(int i=sz-1;i>=0;i--)putchar('0'+a[i]);
}
inline char getreal(){char c=_buff.get();while(c==' '||c=='\n')c=_buff.get();return c;}
int n,a[2011],g[2011][2011];
vector<int> facp[2011];
vector<int> vp,v[20011];
bool used[2011],hs[20011];
bool vis[2011],visp[20011];
void dfs(int x);
void dfsp(int p)
{
	visp[p]=1;
	for(int i=0;i<v[p].size();i++)
	{
		if(!vis[v[p][i]])dfs(v[p][i]);
	}
}
void dfs(int x)
{
	vis[x]=1;
	if(used[x])return;
	for(int i=0;i<facp[x].size();i++)
	{
		if(!visp[facp[x][i]])dfsp(facp[x][i]);
	}
}
void dfsgraph(int v)
{
	dfs(v);
}
int tag[2011],mn[2011];
int main()
{
	geti(n);
	for(int i=1;i<=n;i++)geti(a[i]);
	sort(a+1,a+n+1);
	for(int i=1;i<=n;i++)
	{
		for(int j=i;j<=n;j++)
		{
			g[i][j]=g[j][i]=__gcd(a[i],a[j]);
		}
	}
	for(int i=1;i<=n;i++)
	{
		int x=a[i];
		for(int j=2;j*j<=x;j++)
		{
			if(x%j==0)
			{
				facp[i].PB(j);
				while(x%j==0)x/=j;
				vp.PB(j);
			}
		}
		if(x>1)facp[i].PB(x),vp.PB(x);
	}
	sort(vp.begin(),vp.end());
	for(int i=1;i<=n;i++)
	{
		for(int j=0;j<facp[i].size();j++)
		{
			facp[i][j]=lower_bound(vp.begin(),vp.end(),facp[i][j])-vp.begin();
			v[facp[i][j]].PB(i);
		}
	}
	for(int i=0;i<=n+1;i++)mn[i]=Imx;
	for(int i=1;i<=n;i++)
	{
		memset(vis,0,sizeof(vis));
		memset(visp,0,sizeof(visp));
		int cur=-1;
		for(int j=1;j<=n;j++)
		{
			if(used[j])continue;
			if(mn[tag[j]+1]>=a[j])
			{
				if(!vis[j])
				{
					dfsgraph(j);
					cur=j;
				}
			}
		}
		assert(cur!=-1);
		for(int j=1;j<=n;j++)if(g[cur][j]>1)tag[j]=i;
		used[cur]=1;
		puti(a[cur]);
		for(int j=1;j<=i;j++)mn[j]=min(mn[j],a[cur]);
	}
	return 0;
}

Submission Info

Judge Result