Submission #1645924
Source Code Expand
#include<iostream> #include<vector> #include<algorithm> #include<cstring> #include<cstdio> #include<cmath> #include<cstdlib> #include<ctime> #include<queue> #include<set> #include<map> #include<stack> #include<bitset> using namespace std; typedef vector<int> vi; const int N=2010; int gi() { int w=0;bool q=1;char c=getchar(); while ((c<'0'||c>'9') && c!='-') c=getchar(); if (c=='-') q=0,c=getchar(); while (c>='0'&&c <= '9') w=w*10+c-'0',c=getchar(); return q? w:-w; } int a[N],n; bool v[N]; struct cmp{ bool operator () (const vi &a,const vi &b) { return a.back()<b.back(); } }; vi merge(vector<vi> p) { priority_queue<vi,vector<vi>,cmp>q; for (auto k:p) reverse(k.begin(),k.end()),q.push(k); vi ans,t; while (!q.empty()) { t=q.top();q.pop(); ans.push_back(t.back());t.pop_back(); if (!t.empty()) q.push(t); } return ans; } inline vi dfs(int k) { v[k]=true; vector<vi>ans; for (int i=1;i<=n;i++) if (!v[i]&&__gcd(a[k],a[i])!=1) ans.push_back(dfs(i)); vi v=merge(ans); v.insert(v.begin(),a[k]); return v; } int main() { n=gi(); for (int i=1;i<=n;i++) a[i]=gi(); sort(a+1,a+1+n); vector<vi>ans; for (int i=1;i<=n;i++) if (!v[i]) ans.push_back(dfs(i)); vi v=merge(ans); for (auto k:v) printf("%d ",k); putchar(10); return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Rearranging |
User | laofu |
Language | C++14 (GCC 5.4.1) |
Score | 1600 |
Code Size | 1334 Byte |
Status | AC |
Exec Time | 452 ms |
Memory | 640 KB |
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 | 395 ms | 640 KB |
in10.txt | AC | 396 ms | 640 KB |
in11.txt | AC | 429 ms | 640 KB |
in12.txt | AC | 428 ms | 640 KB |
in13.txt | AC | 429 ms | 640 KB |
in14.txt | AC | 431 ms | 640 KB |
in15.txt | AC | 428 ms | 640 KB |
in16.txt | AC | 423 ms | 640 KB |
in17.txt | AC | 424 ms | 640 KB |
in18.txt | AC | 424 ms | 640 KB |
in19.txt | AC | 423 ms | 640 KB |
in2.txt | AC | 393 ms | 640 KB |
in20.txt | AC | 424 ms | 640 KB |
in21.txt | AC | 173 ms | 512 KB |
in22.txt | AC | 171 ms | 512 KB |
in23.txt | AC | 172 ms | 512 KB |
in24.txt | AC | 171 ms | 512 KB |
in25.txt | AC | 171 ms | 512 KB |
in26.txt | AC | 429 ms | 640 KB |
in27.txt | AC | 428 ms | 640 KB |
in28.txt | AC | 428 ms | 640 KB |
in29.txt | AC | 428 ms | 640 KB |
in3.txt | AC | 399 ms | 640 KB |
in30.txt | AC | 428 ms | 640 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 | 198 ms | 640 KB |
in35.txt | AC | 197 ms | 640 KB |
in36.txt | AC | 427 ms | 640 KB |
in37.txt | AC | 426 ms | 640 KB |
in38.txt | AC | 426 ms | 640 KB |
in39.txt | AC | 426 ms | 640 KB |
in4.txt | AC | 412 ms | 640 KB |
in40.txt | AC | 426 ms | 640 KB |
in41.txt | AC | 426 ms | 640 KB |
in42.txt | AC | 425 ms | 640 KB |
in43.txt | AC | 426 ms | 640 KB |
in44.txt | AC | 452 ms | 640 KB |
in45.txt | AC | 427 ms | 640 KB |
in5.txt | AC | 400 ms | 640 KB |
in6.txt | AC | 391 ms | 640 KB |
in7.txt | AC | 393 ms | 640 KB |
in8.txt | AC | 399 ms | 640 KB |
in9.txt | AC | 397 ms | 640 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |