Submission #1693067
Source Code Expand
// Copyright (C) 2017 __debug. // This program is free software; you can redistribute it and/or // modify it under the terms of the GNU General Public License as // published by the Free Software Foundation; version 3 // This program is distributed in the hope that it will be useful, // but WITHOUT ANY WARRANTY; without even the implied warranty of // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the // GNU General Public License for more details. // You should have received a copy of the GNU General Public License // along with this program; If not, see <http://www.gnu.org/licenses/>. #include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/priority_queue.hpp> #define x first #define y second #define MP std::make_pair #define SZ(x) ((int)(x).size()) #define ALL(x) (x).begin(), (x).end() #define DEBUG(...) fprintf(stderr, __VA_ARGS__) #ifdef __linux__ #define getchar getchar_unlocked #define putchar putchar_unlocked #endif using std::pair; using std::vector; using std::string; typedef long long LL; typedef pair<int, int> Pii; const int oo = 0x3f3f3f3f; template<typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, true : false; } template<typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, true : false; } string procStatus() { std::ifstream t("/proc/self/status"); return string(std::istreambuf_iterator<char>(t), std::istreambuf_iterator<char>()); } template<typename T> T read(T &x) { int f = 1; char ch = getchar(); for (; !isdigit(ch); ch = getchar()) f = (ch == '-' ? -1 : 1); for (x = 0; isdigit(ch); ch = getchar()) x = 10 * x + ch - '0'; return x *= f; } template<typename T> void write(T x) { if (x == 0) { putchar('0'); return; } if (x < 0) { putchar('-'); x = -x; } static char s[20]; int top = 0; for (; x; x /= 10) s[++top] = x % 10 + '0'; while (top) putchar(s[top--]); } // EOT const int MAXN = 2e3 + 5; int N; int A[MAXN]; void input() { read(N); for (int i = 1; i <= N; ++i) { read(A[i]); } } bool vis[MAXN]; inline void merge(vector<int> &a, const vector<int> &b) { vector<int> ret; int p = 0, q = 0; while (p < SZ(a) || q < SZ(b)) { if (p < SZ(a) && (q == SZ(b) || a[p] > b[q])) ret.push_back(a[p++]); else ret.push_back(b[q++]); } a = ret; } vector<int> dfs(int u) { vis[u] = true; vector<int> ret; for (int v = 1; v <= N; ++v) { if (vis[v] || std::__gcd(A[u], A[v]) == 1) continue; merge(ret, dfs(v)); } ret.insert(ret.begin(), A[u]); return ret; } void solve() { vector<int> ans; std::sort(A + 1, A + N + 1); for (int i = 1; i <= N; ++i) { if (!vis[i]) merge(ans, dfs(i)); } for (auto x : ans) { printf("%d ", x); } puts(""); } int main() { #ifdef __DEBUG freopen("E.in", "r", stdin); freopen("E.out", "w", stdout); #endif input(); solve(); return 0; } // 三万里河东入海,五千仞岳上摩天。 // -- 陆游《秋夜将晓出篱门迎凉有感》
Submission Info
Submission Time | |
---|---|
Task | E - Rearranging |
User | Ivlleiooq |
Language | C++14 (GCC 5.4.1) |
Score | 1600 |
Code Size | 3372 Byte |
Status | AC |
Exec Time | 207 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 | 59 ms | 640 KB |
in10.txt | AC | 56 ms | 640 KB |
in11.txt | AC | 17 ms | 640 KB |
in12.txt | AC | 17 ms | 640 KB |
in13.txt | AC | 17 ms | 640 KB |
in14.txt | AC | 17 ms | 640 KB |
in15.txt | AC | 17 ms | 640 KB |
in16.txt | AC | 13 ms | 640 KB |
in17.txt | AC | 12 ms | 640 KB |
in18.txt | AC | 12 ms | 640 KB |
in19.txt | AC | 13 ms | 640 KB |
in2.txt | AC | 59 ms | 640 KB |
in20.txt | AC | 12 ms | 640 KB |
in21.txt | AC | 177 ms | 256 KB |
in22.txt | AC | 178 ms | 256 KB |
in23.txt | AC | 179 ms | 256 KB |
in24.txt | AC | 178 ms | 256 KB |
in25.txt | AC | 177 ms | 256 KB |
in26.txt | AC | 17 ms | 640 KB |
in27.txt | AC | 17 ms | 640 KB |
in28.txt | AC | 17 ms | 640 KB |
in29.txt | AC | 17 ms | 640 KB |
in3.txt | AC | 55 ms | 640 KB |
in30.txt | AC | 17 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 | 207 ms | 256 KB |
in35.txt | AC | 207 ms | 256 KB |
in36.txt | AC | 14 ms | 640 KB |
in37.txt | AC | 14 ms | 640 KB |
in38.txt | AC | 14 ms | 640 KB |
in39.txt | AC | 14 ms | 640 KB |
in4.txt | AC | 65 ms | 640 KB |
in40.txt | AC | 14 ms | 640 KB |
in41.txt | AC | 14 ms | 640 KB |
in42.txt | AC | 14 ms | 640 KB |
in43.txt | AC | 14 ms | 640 KB |
in44.txt | AC | 14 ms | 640 KB |
in45.txt | AC | 14 ms | 640 KB |
in5.txt | AC | 54 ms | 640 KB |
in6.txt | AC | 60 ms | 640 KB |
in7.txt | AC | 60 ms | 640 KB |
in8.txt | AC | 55 ms | 640 KB |
in9.txt | AC | 58 ms | 640 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |