Submission #2213520
Source Code Expand
#include <iostream> #include <cstdio> #include <cstring> #include <algorithm> using namespace std; struct ha{ int a[2005],tot; }c[2005]; int gcd(int a,int b){ int t; while(b){ t=a;a=b;b=t%a; } return a; } int n,a[2005],b[2005][2005],tot[2005],now; pair<int,int> g[2005]; int fst[2005],lst[2005],cnt=0,e[4000005]; bool vis[2005]; void dfs(int k){ vis[k]=1;c[now].a[++c[now].tot]=a[k]; for(int i=fst[k];i<=lst[k];i++) if(!vis[e[i]]) dfs(e[i]); } int main(){ 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++){ fst[i]=cnt+1; for(int p=1;p<=n;p++) if(p!=i){ if(gcd(a[i],a[p])>1) e[++cnt]=p; } lst[i]=cnt; sort(e+fst[i],e+lst[i]+1); } for(int i=1;i<=n;i++) if(!vis[i]){ now++; dfs(i); g[now]=make_pair(c[now].a[1],now); } sort(g+1,g+now+1); for(int i=now;i;i--){ int id=g[i].second; for(int p=1;p<=c[id].tot;p++) printf("%d ",c[id].a[p]); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Rearranging |
User | liumy2010 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 988 Byte |
Status | WA |
Exec Time | 500 ms |
Memory | 17664 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:26:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&n); ^ ./Main.cpp:27:41: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] for(int i=1;i<=n;i++) scanf("%d",&a[i]); ^
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | WA | 498 ms | 10496 KB |
in10.txt | WA | 499 ms | 12544 KB |
in11.txt | WA | 417 ms | 5248 KB |
in12.txt | WA | 420 ms | 5120 KB |
in13.txt | WA | 416 ms | 5120 KB |
in14.txt | WA | 419 ms | 5120 KB |
in15.txt | WA | 418 ms | 5120 KB |
in16.txt | WA | 435 ms | 14592 KB |
in17.txt | AC | 435 ms | 14592 KB |
in18.txt | WA | 434 ms | 14592 KB |
in19.txt | AC | 436 ms | 14592 KB |
in2.txt | WA | 498 ms | 10496 KB |
in20.txt | WA | 435 ms | 14592 KB |
in21.txt | AC | 317 ms | 16640 KB |
in22.txt | AC | 318 ms | 16768 KB |
in23.txt | WA | 322 ms | 16768 KB |
in24.txt | AC | 318 ms | 16768 KB |
in25.txt | AC | 318 ms | 16768 KB |
in26.txt | WA | 419 ms | 5120 KB |
in27.txt | WA | 419 ms | 5120 KB |
in28.txt | WA | 416 ms | 5120 KB |
in29.txt | WA | 424 ms | 5248 KB |
in3.txt | WA | 498 ms | 10496 KB |
in30.txt | WA | 419 ms | 5120 KB |
in31.txt | AC | 2 ms | 4352 KB |
in32.txt | AC | 2 ms | 4352 KB |
in33.txt | AC | 2 ms | 4352 KB |
in34.txt | AC | 375 ms | 17664 KB |
in35.txt | AC | 374 ms | 17664 KB |
in36.txt | WA | 440 ms | 6016 KB |
in37.txt | WA | 440 ms | 6016 KB |
in38.txt | WA | 441 ms | 6016 KB |
in39.txt | WA | 442 ms | 6016 KB |
in4.txt | WA | 500 ms | 10496 KB |
in40.txt | WA | 441 ms | 6016 KB |
in41.txt | WA | 441 ms | 6016 KB |
in42.txt | WA | 442 ms | 6016 KB |
in43.txt | WA | 440 ms | 6144 KB |
in44.txt | WA | 441 ms | 6016 KB |
in45.txt | WA | 442 ms | 6016 KB |
in5.txt | WA | 497 ms | 10496 KB |
in6.txt | WA | 498 ms | 10496 KB |
in7.txt | WA | 498 ms | 12544 KB |
in8.txt | WA | 499 ms | 12544 KB |
in9.txt | WA | 498 ms | 10496 KB |
sample1.txt | AC | 2 ms | 4352 KB |
sample2.txt | AC | 1 ms | 4352 KB |