Submission #1693582


Source Code Expand

#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <memory.h>

using namespace std;
const int maxn = 2005;

bool e[maxn][maxn];
int deg[maxn],n,a[maxn],usd[maxn];
int gcd(int n,int m) {return m?gcd(m,n%m):n;}

void dfs(int u)
{
	usd[u]=1;
	for (int j=1;j<=n;j++)
	if (e[u][j]) {
		if (!usd[j]) {
			e[j][u]=false;deg[j]++;dfs(j);
		}
		else {
			e[j][u]=e[u][j]=false;
		}
	}
}
int main()
{
	#ifdef Amberframe
		freopen("agc010e.in","r",stdin);
		freopen("agc010e.out","w",stdout);
	#endif
	scanf("%d",&n);
	for (int i=1;i<=n;i++)
		scanf("%d",&a[i]);
	sort(a+1,a+n+1);
	
	for (int i=1;i<=n;i++)
	for (int j=i+1;j<=n;j++)
		if (gcd(a[i],a[j])>1) e[i][j]=e[j][i]=true; 
	for (int i=1;i<=n;i++)
		if (!usd[i]) dfs(i);
	for (int i=1;i<=n;i++)
	{
		int pos=n;while (!usd[pos]||deg[pos]) --pos;
		printf("%d ",a[pos]);usd[pos]=0;
		for (int j=1;j<=n;j++)
			if (e[pos][j]) --deg[j];
	}
	return 0;
}

Submission Info

Submission Time
Task E - Rearranging
User Amberframe
Language C++14 (GCC 5.4.1)
Score 1600
Code Size 960 Byte
Status AC
Exec Time 266 ms
Memory 4352 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:32:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
./Main.cpp:34:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&a[i]);
                    ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1600 / 1600
Status
AC × 2
AC × 49
Set Name Test Cases
Sample sample1.txt, sample2.txt
All sample1.txt, sample2.txt, in1.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in2.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in3.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, in39.txt, in4.txt, in40.txt, in41.txt, in42.txt, in43.txt, in44.txt, in45.txt, in5.txt, in6.txt, in7.txt, in8.txt, in9.txt, sample1.txt, sample2.txt
Case Name Status Exec Time Memory
in1.txt AC 265 ms 4224 KB
in10.txt AC 265 ms 4224 KB
in11.txt AC 226 ms 4224 KB
in12.txt AC 228 ms 4352 KB
in13.txt AC 226 ms 4224 KB
in14.txt AC 227 ms 4224 KB
in15.txt AC 227 ms 4224 KB
in16.txt AC 228 ms 4224 KB
in17.txt AC 228 ms 4224 KB
in18.txt AC 230 ms 4352 KB
in19.txt AC 229 ms 4224 KB
in2.txt AC 265 ms 4224 KB
in20.txt AC 228 ms 4224 KB
in21.txt AC 173 ms 1664 KB
in22.txt AC 174 ms 1536 KB
in23.txt AC 175 ms 1536 KB
in24.txt AC 173 ms 1536 KB
in25.txt AC 174 ms 1536 KB
in26.txt AC 227 ms 4224 KB
in27.txt AC 227 ms 4224 KB
in28.txt AC 226 ms 4224 KB
in29.txt AC 228 ms 4224 KB
in3.txt AC 265 ms 4224 KB
in30.txt AC 227 ms 4224 KB
in31.txt AC 1 ms 256 KB
in32.txt AC 1 ms 256 KB
in33.txt AC 1 ms 256 KB
in34.txt AC 201 ms 256 KB
in35.txt AC 200 ms 256 KB
in36.txt AC 238 ms 4224 KB
in37.txt AC 238 ms 4352 KB
in38.txt AC 238 ms 4352 KB
in39.txt AC 240 ms 4352 KB
in4.txt AC 266 ms 4224 KB
in40.txt AC 238 ms 4224 KB
in41.txt AC 238 ms 4352 KB
in42.txt AC 239 ms 4224 KB
in43.txt AC 238 ms 4224 KB
in44.txt AC 238 ms 4224 KB
in45.txt AC 239 ms 4224 KB
in5.txt AC 265 ms 4224 KB
in6.txt AC 266 ms 4224 KB
in7.txt AC 265 ms 4224 KB
in8.txt AC 265 ms 4224 KB
in9.txt AC 266 ms 4224 KB
sample1.txt AC 1 ms 256 KB
sample2.txt AC 1 ms 256 KB