Submission #1662343
Source Code Expand
#include<bits/stdc++.h> #define N 2005 using namespace std; vector<int> E[N],F[N]; int n,m,cnt,G[N][N],a[N],vis[N]; int gcd(int x,int y){ return x ? gcd(y%x,x) : y;} void dfs(int t) { int i; vis[t]=1; for(i=1;i<=n;i++) if(G[t][i]&&!vis[i]) E[t].push_back(i),dfs(i); } void sol(int t) { int i,p; if(t<=n) F[t].push_back(t); for(i=0;i<E[t].size();i++) sol(E[t][i]),reverse(F[E[t][i]].begin(),F[E[t][i]].end()); while(1){ p=0; for(i=0;i<E[t].size();i++){ if(!F[E[t][i]].size()) continue; if(!p||F[E[t][i]][F[E[t][i]].size()-1]>F[p][F[p].size()-1]) p=E[t][i]; } if(!p) break; F[t].push_back(F[p][F[p].size()-1]); F[p].pop_back(); } } int main() { int i,j; scanf("%d",&n); for(i=1;i<=n;i++) scanf("%d",&a[i]); sort(a+1,a+n+1); for(i=1;i<=n;i++) for(j=1;j<=n;j++) if(gcd(a[i],a[j])!=1) G[i][j]=1; for(i=1;i<=n;i++){ if(vis[i]) continue; E[n+1].push_back(i),dfs(i); } sol(n+1); for(i=0;i<F[n+1].size();i++) printf("%d ",a[F[n+1][i]]); return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Rearranging |
User | MemorySlices |
Language | C++14 (GCC 5.4.1) |
Score | 1600 |
Code Size | 1050 Byte |
Status | AC |
Exec Time | 536 ms |
Memory | 26752 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:34:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&n); ^ ./Main.cpp:36: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 |
|
|
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 | 523 ms | 25344 KB |
in10.txt | AC | 523 ms | 25472 KB |
in11.txt | AC | 453 ms | 26752 KB |
in12.txt | AC | 455 ms | 26752 KB |
in13.txt | AC | 453 ms | 26752 KB |
in14.txt | AC | 474 ms | 26752 KB |
in15.txt | AC | 455 ms | 26752 KB |
in16.txt | AC | 456 ms | 26752 KB |
in17.txt | AC | 456 ms | 26752 KB |
in18.txt | AC | 456 ms | 26752 KB |
in19.txt | AC | 461 ms | 26752 KB |
in2.txt | AC | 536 ms | 25344 KB |
in20.txt | AC | 462 ms | 26752 KB |
in21.txt | AC | 345 ms | 14592 KB |
in22.txt | AC | 346 ms | 14464 KB |
in23.txt | AC | 353 ms | 14592 KB |
in24.txt | AC | 347 ms | 14592 KB |
in25.txt | AC | 349 ms | 14592 KB |
in26.txt | AC | 455 ms | 26752 KB |
in27.txt | AC | 456 ms | 26752 KB |
in28.txt | AC | 452 ms | 26752 KB |
in29.txt | AC | 456 ms | 26752 KB |
in3.txt | AC | 528 ms | 25472 KB |
in30.txt | AC | 466 ms | 26752 KB |
in31.txt | AC | 1 ms | 384 KB |
in32.txt | AC | 1 ms | 384 KB |
in33.txt | AC | 1 ms | 384 KB |
in34.txt | AC | 404 ms | 14464 KB |
in35.txt | AC | 402 ms | 14464 KB |
in36.txt | AC | 477 ms | 26752 KB |
in37.txt | AC | 476 ms | 26752 KB |
in38.txt | AC | 478 ms | 26752 KB |
in39.txt | AC | 481 ms | 26752 KB |
in4.txt | AC | 526 ms | 25088 KB |
in40.txt | AC | 480 ms | 26752 KB |
in41.txt | AC | 481 ms | 26752 KB |
in42.txt | AC | 506 ms | 26752 KB |
in43.txt | AC | 489 ms | 26752 KB |
in44.txt | AC | 479 ms | 26752 KB |
in45.txt | AC | 478 ms | 26752 KB |
in5.txt | AC | 525 ms | 25600 KB |
in6.txt | AC | 525 ms | 25344 KB |
in7.txt | AC | 527 ms | 25344 KB |
in8.txt | AC | 531 ms | 25472 KB |
in9.txt | AC | 526 ms | 25472 KB |
sample1.txt | AC | 1 ms | 384 KB |
sample2.txt | AC | 1 ms | 384 KB |