Submission #1837390


Source Code Expand

#define _CRT_SECURE_NO_WARNINGS
#include <vector>
#include <iostream>
#include <string.h>
#include <string>
#include <algorithm>
#include <queue>
using namespace std;

typedef double LD;
typedef long long LL;
typedef pair<int, int> PII;
#define MP make_pair
#define PB push_back
#define FOR(i,a,b) for(int i = (a); i < (b); ++i)
#define RFOR(i,b,a) for(int i = (b) - 1; i >= (a); --i)
#define REP(i, t) FOR(i,0,t)
#define ALL(a) a.begin(), a.end()
#define SZ(a) (int)((a).size())

const LL MOD = 1000000007;
const int INF = 1e9;
const int MAXN = 2007;
const LD EPS = 1e-7;

int n, A[MAXN], B[MAXN][MAXN], P[MAXN], r = 0;
bool used[MAXN];
queue <int> Q;

int gcd(int a, int b)
{
	if (a == 0) return b;
	return gcd(b % a, a);
}

int main()
{
	ios_base::sync_with_stdio(0);
	freopen("In.txt", "r", stdin);
	cin >> n;
	REP(i, n) cin >> A[i];
	REP(i, n)
	{
		if (used[i]) continue;
		used[i] = true;
		Q.push(i);
		int sz = 0;
		while (!Q.empty())
		{
			int v = Q.front();
			Q.pop();
			B[r][sz++] = A[v];
			REP(j, n)
			{
				if (!used[j] && gcd(A[v], A[j]) > 1)
				{
					used[j] = true;
					Q.push(j);
				}
			}
		}
		++r;
	}
	REP(i, r) P[i] = 0;
	REP(i, n)
	{
		int mr = 0;
		REP(j, r)
			if (B[j][P[j]] > B[mr][P[mr]])
				mr = j;
		cout << B[mr][P[mr]] << ' ';
		++P[mr];
	}
	//cout << endl; system("pause");
	return 0;
}

Submission Info

Submission Time
Task E - Rearranging
User vjudge2
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1328 Byte
Status RE
Exec Time 104 ms
Memory 640 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:39:31: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
  freopen("In.txt", "r", stdin);
                               ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1600
Status
RE × 2
RE × 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 RE 104 ms 640 KB
in10.txt RE 96 ms 256 KB
in11.txt RE 96 ms 256 KB
in12.txt RE 96 ms 256 KB
in13.txt RE 96 ms 256 KB
in14.txt RE 96 ms 256 KB
in15.txt RE 98 ms 256 KB
in16.txt RE 96 ms 256 KB
in17.txt RE 96 ms 256 KB
in18.txt RE 96 ms 256 KB
in19.txt RE 99 ms 256 KB
in2.txt RE 98 ms 256 KB
in20.txt RE 96 ms 256 KB
in21.txt RE 96 ms 256 KB
in22.txt RE 96 ms 256 KB
in23.txt RE 96 ms 256 KB
in24.txt RE 97 ms 256 KB
in25.txt RE 96 ms 256 KB
in26.txt RE 96 ms 256 KB
in27.txt RE 96 ms 256 KB
in28.txt RE 96 ms 256 KB
in29.txt RE 96 ms 256 KB
in3.txt RE 96 ms 256 KB
in30.txt RE 96 ms 256 KB
in31.txt RE 96 ms 256 KB
in32.txt RE 96 ms 256 KB
in33.txt RE 96 ms 256 KB
in34.txt RE 96 ms 256 KB
in35.txt RE 97 ms 256 KB
in36.txt RE 97 ms 256 KB
in37.txt RE 95 ms 256 KB
in38.txt RE 97 ms 256 KB
in39.txt RE 96 ms 256 KB
in4.txt RE 96 ms 256 KB
in40.txt RE 96 ms 256 KB
in41.txt RE 96 ms 256 KB
in42.txt RE 97 ms 256 KB
in43.txt RE 98 ms 256 KB
in44.txt RE 97 ms 256 KB
in45.txt RE 98 ms 256 KB
in5.txt RE 96 ms 256 KB
in6.txt RE 96 ms 256 KB
in7.txt RE 96 ms 256 KB
in8.txt RE 96 ms 256 KB
in9.txt RE 96 ms 256 KB
sample1.txt RE 98 ms 256 KB
sample2.txt RE 96 ms 256 KB