Submission #1096608
Source Code Expand
#include <cstdio> #include <vector> #include <map> #include <queue> #include <algorithm> using namespace std; int a[2000]; int d[2000]; int f[2000]; vector <int> v[2000]; vector <int> w[2000]; int gcd(int a, int b) { if (a % b == 0) { return b; } else { return gcd(b, a % b); } } void dfs(int x) { int i; f[x] = 1; for (i = 0; i < v[x].size(); i++) { int y = v[x][i]; if (f[y] == 0) { d[y]++; w[x].push_back(y); dfs(y); } } } int main() { int n, i, j; vector <int> ans; priority_queue <int> q; scanf("%d", &n); for (i = 0; i < n; i++) scanf("%d", &a[i]); sort(a, a + n); for (i = 0; i < n; i++) { for (j = i + 1; j < n; j++) { if (gcd(a[i], a[j]) > 1) { v[i].push_back(j); v[j].push_back(i); } } } for (i = 0; i < n; i++) { if (f[i] == 0) { dfs(i); q.push(i); } } while (!q.empty()) { int x = q.top(); q.pop(); ans.push_back(a[x]); for (i = 0; i < w[x].size(); i++) { int y = w[x][i]; d[y]--; if (d[y] == 0) q.push(y); } } for (i = 0; i < n; i++) { if (i > 0) putchar(' '); printf("%d", ans[i]); } puts(""); return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Rearranging |
User | kawatea |
Language | C++14 (GCC 5.4.1) |
Score | 1600 |
Code Size | 1598 Byte |
Status | AC |
Exec Time | 278 ms |
Memory | 17792 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:44:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &n); ^ ./Main.cpp:46:47: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] for (i = 0; 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 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
in1.txt | AC | 278 ms | 10112 KB |
in10.txt | AC | 278 ms | 10752 KB |
in11.txt | AC | 226 ms | 1664 KB |
in12.txt | AC | 227 ms | 1664 KB |
in13.txt | AC | 225 ms | 1664 KB |
in14.txt | AC | 226 ms | 1664 KB |
in15.txt | AC | 226 ms | 1664 KB |
in16.txt | AC | 255 ms | 17664 KB |
in17.txt | AC | 255 ms | 17792 KB |
in18.txt | AC | 254 ms | 17664 KB |
in19.txt | AC | 256 ms | 17792 KB |
in2.txt | AC | 278 ms | 10112 KB |
in20.txt | AC | 255 ms | 17664 KB |
in21.txt | AC | 170 ms | 384 KB |
in22.txt | AC | 171 ms | 384 KB |
in23.txt | AC | 171 ms | 384 KB |
in24.txt | AC | 170 ms | 384 KB |
in25.txt | AC | 170 ms | 384 KB |
in26.txt | AC | 226 ms | 1664 KB |
in27.txt | AC | 226 ms | 1664 KB |
in28.txt | AC | 224 ms | 1664 KB |
in29.txt | AC | 227 ms | 1664 KB |
in3.txt | AC | 278 ms | 9984 KB |
in30.txt | AC | 226 ms | 1664 KB |
in31.txt | AC | 2 ms | 384 KB |
in32.txt | AC | 2 ms | 384 KB |
in33.txt | AC | 2 ms | 384 KB |
in34.txt | AC | 199 ms | 384 KB |
in35.txt | AC | 198 ms | 384 KB |
in36.txt | AC | 241 ms | 3200 KB |
in37.txt | AC | 241 ms | 3200 KB |
in38.txt | AC | 241 ms | 3200 KB |
in39.txt | AC | 242 ms | 3328 KB |
in4.txt | AC | 278 ms | 9984 KB |
in40.txt | AC | 240 ms | 3072 KB |
in41.txt | AC | 241 ms | 3200 KB |
in42.txt | AC | 242 ms | 3200 KB |
in43.txt | AC | 240 ms | 3200 KB |
in44.txt | AC | 242 ms | 3072 KB |
in45.txt | AC | 242 ms | 3200 KB |
in5.txt | AC | 276 ms | 9728 KB |
in6.txt | AC | 278 ms | 10496 KB |
in7.txt | AC | 278 ms | 10624 KB |
in8.txt | AC | 278 ms | 10240 KB |
in9.txt | AC | 278 ms | 9984 KB |
sample1.txt | AC | 2 ms | 384 KB |
sample2.txt | AC | 3 ms | 384 KB |