Submission #2214735
Source Code Expand
#include <iostream> #include <cstdio> #include <cstring> #include <algorithm> #include <vector> using namespace std; struct ha{ vector<int> a; }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]; bool mp[2005][2005]; int fst[2005],lst[2005],cnt=0,e[4000005]; bool vis[2005]; vector<int> ans; void dfs(int k){ vis[k]=1;c[now].a.push_back(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,mp[i][p]=1; } 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(a[c[now].a[0]],now); /*for(int i=0;i<c[now].a.size();i++){ int x=c[now].a[i]; for(int p=i-1;~p;p--){ if(mp[x][c[now].a[p]]){ if(x<=c[now].a[p+1]) break; c[now].a.erase(c[now].a.begin()+i); c[now].a.insert(c[now].a.begin()+p+1,x); break; } } }*/ } sort(g+1,g+now+1); for(int i=now;i;i--){ int id=g[i].second; for(int p=0;p<c[id].a.size();p++) ans.push_back(c[id].a[p]); } for(int i=0;i<ans.size();i++){ int x=ans[i],now=i; for(int p=i-1;~p;p--){ if(mp[x][ans[p]]) break; if(x<=ans[p]) continue; ans.erase(ans.begin()+now); ans.insert(ans.begin()+p,x); now=p; } } for(int i=0;i<ans.size();i++) printf("%d ",a[ans[i]]); return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Rearranging |
User | liumy2010 |
Language | C++14 (GCC 5.4.1) |
Score | 1600 |
Code Size | 1615 Byte |
Status | AC |
Exec Time | 512 ms |
Memory | 16896 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:29:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&n); ^ ./Main.cpp:30: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 | 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 | 509 ms | 12672 KB |
in10.txt | AC | 510 ms | 14720 KB |
in11.txt | AC | 419 ms | 7296 KB |
in12.txt | AC | 422 ms | 7296 KB |
in13.txt | AC | 419 ms | 7168 KB |
in14.txt | AC | 421 ms | 7296 KB |
in15.txt | AC | 421 ms | 7168 KB |
in16.txt | AC | 446 ms | 16768 KB |
in17.txt | AC | 448 ms | 16896 KB |
in18.txt | AC | 445 ms | 16768 KB |
in19.txt | AC | 447 ms | 16768 KB |
in2.txt | AC | 509 ms | 12672 KB |
in20.txt | AC | 446 ms | 16768 KB |
in21.txt | AC | 318 ms | 6528 KB |
in22.txt | AC | 322 ms | 6528 KB |
in23.txt | AC | 321 ms | 6528 KB |
in24.txt | AC | 319 ms | 6528 KB |
in25.txt | AC | 319 ms | 6528 KB |
in26.txt | AC | 421 ms | 7296 KB |
in27.txt | AC | 421 ms | 7296 KB |
in28.txt | AC | 418 ms | 7296 KB |
in29.txt | AC | 422 ms | 7296 KB |
in3.txt | AC | 509 ms | 12672 KB |
in30.txt | AC | 421 ms | 7296 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 | 4480 KB |
in35.txt | AC | 374 ms | 4480 KB |
in36.txt | AC | 444 ms | 8192 KB |
in37.txt | AC | 444 ms | 8192 KB |
in38.txt | AC | 445 ms | 8192 KB |
in39.txt | AC | 446 ms | 8192 KB |
in4.txt | AC | 512 ms | 12672 KB |
in40.txt | AC | 444 ms | 8192 KB |
in41.txt | AC | 445 ms | 8192 KB |
in42.txt | AC | 446 ms | 8192 KB |
in43.txt | AC | 444 ms | 8192 KB |
in44.txt | AC | 445 ms | 8192 KB |
in45.txt | AC | 446 ms | 8192 KB |
in5.txt | AC | 508 ms | 12672 KB |
in6.txt | AC | 510 ms | 12672 KB |
in7.txt | AC | 511 ms | 14720 KB |
in8.txt | AC | 512 ms | 14720 KB |
in9.txt | AC | 509 ms | 12672 KB |
sample1.txt | AC | 2 ms | 4352 KB |
sample2.txt | AC | 2 ms | 4352 KB |