Submission #1111360
Source Code Expand
#include<vector> #include<cmath> #include<map> #include<cstdlib> #include<iostream> #include<sstream> #include<fstream> #include<string> #include<algorithm> #include<cstring> #include<cstdio> #include<set> #include<stack> #include<bitset> #include<functional> #include<ctime> #include<queue> #include<deque> #include<complex> using namespace std; #define pb push_back #define pf push_front typedef long long lint; typedef complex<double> P; #define mp make_pair #define fi first #define se second typedef pair<int,int> pint; #define All(s) s.begin(),s.end() #define rAll(s) s.rbegin(),s.rend() #define REP(i,a,b) for(int i=a;i<b;i++) #define rep(i,n) REP(i,0,n) vector<int> gr[2525],ed[2525]; bool sumi[2525]; priority_queue<int> p; int a[2525],num[2525]; int gcd( int m, int n ) { int a=max(m,n),b=min(m,n); if(m==0) return n;if(n==0) return m; if(a%b==0) return b; return gcd(b,a-b*(a/b)); } void cal(int v){ //if(sumi[v]) return; sumi[v]=true; rep(i,gr[v].size()){ int w=gr[v][i]; if(sumi[w]) continue; ed[v].pb(w); num[w]++; cal(w); } } int main() { int n; cin>>n; rep(i,n) cin>>a[i]; sort(a,a+n); rep(i,n) rep(j,n){ if(i!=j && gcd(a[i],a[j])>1) gr[i].pb(j),gr[j].pb(i); } memset(sumi,false,sizeof(sumi)); memset(num,0,sizeof(num)); rep(i,n){ if(!sumi[i]){ cal(i);p.push(i); } } vector<int> out; rep(i,n){ int q=p.top();p.pop(); out.pb(q); rep(j,ed[q].size()){ int w=ed[q][j]; num[w]--; if(num[w]<1) p.push(w); } } rep(i,n){ cout<<a[out[i]]; if(i<n-1) cout<<' ';else cout<<endl; } }
Submission Info
Submission Time | |
---|---|
Task | E - Rearranging |
User | sky58 |
Language | C++14 (GCC 5.4.1) |
Score | 1600 |
Code Size | 1635 Byte |
Status | AC |
Exec Time | 569 ms |
Memory | 31616 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 | 565 ms | 18560 KB |
in10.txt | AC | 567 ms | 19840 KB |
in11.txt | AC | 479 ms | 2688 KB |
in12.txt | AC | 482 ms | 2688 KB |
in13.txt | AC | 478 ms | 2560 KB |
in14.txt | AC | 481 ms | 2560 KB |
in15.txt | AC | 480 ms | 2560 KB |
in16.txt | AC | 496 ms | 31360 KB |
in17.txt | AC | 494 ms | 31616 KB |
in18.txt | AC | 492 ms | 31232 KB |
in19.txt | AC | 493 ms | 31360 KB |
in2.txt | AC | 566 ms | 18432 KB |
in20.txt | AC | 494 ms | 31616 KB |
in21.txt | AC | 361 ms | 384 KB |
in22.txt | AC | 362 ms | 384 KB |
in23.txt | AC | 364 ms | 384 KB |
in24.txt | AC | 362 ms | 384 KB |
in25.txt | AC | 362 ms | 384 KB |
in26.txt | AC | 480 ms | 2560 KB |
in27.txt | AC | 482 ms | 2688 KB |
in28.txt | AC | 477 ms | 2688 KB |
in29.txt | AC | 483 ms | 2688 KB |
in3.txt | AC | 565 ms | 18304 KB |
in30.txt | AC | 481 ms | 2688 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 | 425 ms | 384 KB |
in35.txt | AC | 424 ms | 384 KB |
in36.txt | AC | 506 ms | 5632 KB |
in37.txt | AC | 506 ms | 5760 KB |
in38.txt | AC | 507 ms | 5632 KB |
in39.txt | AC | 509 ms | 5760 KB |
in4.txt | AC | 569 ms | 17792 KB |
in40.txt | AC | 506 ms | 5504 KB |
in41.txt | AC | 505 ms | 5504 KB |
in42.txt | AC | 508 ms | 5504 KB |
in43.txt | AC | 505 ms | 5632 KB |
in44.txt | AC | 507 ms | 5376 KB |
in45.txt | AC | 507 ms | 5504 KB |
in5.txt | AC | 565 ms | 17536 KB |
in6.txt | AC | 566 ms | 19200 KB |
in7.txt | AC | 566 ms | 19328 KB |
in8.txt | AC | 567 ms | 18688 KB |
in9.txt | AC | 565 ms | 17920 KB |
sample1.txt | AC | 1 ms | 384 KB |
sample2.txt | AC | 1 ms | 384 KB |