Submission #1096548

---

Source Code Expand

#include <cstdio>
#include <vector>
#include <map>
#include <queue>
#include <algorithm>

using namespace std;

int n, c;
int a[2000];
int d[2000];
int f[12000];
vector <int> v[12000];
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 c, vector <int> &z) {
    int i;
    
    f[x] = c;
    if (x < n) z.push_back(x);
    
    for (i = 0; i < v[x].size(); i++) {
        if (f[v[x][i]] == c || f[v[x][i]] == -1) continue;
        
        dfs(v[x][i], c, z);
    }
}

void calc(vector <int> &z, int x) {
    int i, j;
    
    if (z.size() == 0) return;
    
    sort(z.begin(), z.end());
    
    for (i = 0; i < z.size(); i++) {
        if (x == -1 || gcd(x, a[z[i]]) != 1) break;
    }
    
    f[z[i]] = -1;
    for (j = 0; j < z.size(); j++) {
        if (i != j) {
            d[z[j]]++;
            w[z[i]].push_back(z[j]);
        }
    }
    
    for (j = 0; j < v[z[i]].size(); j++) {
        int y = v[z[i]][j];
        
        if (f[y] != -1) {
            vector <int> z2;
            
            dfs(y, ++c, z2);
            
            calc(z2, a[z[i]]);
        }
    }
}

int main() {
    int p, i, j;
    vector <int> ans;
    map <int, int> mp;
    priority_queue <int> q;
    
    scanf("%d", &n);
    
    for (i = 0; i < n; i++) scanf("%d", &a[i]);
    
    sort(a, a + n);
    
    p = n;
    
    for (i = 0; i < n; i++) {
        int x = a[i];
        
        for (j = 2; j * j <= x; j++) {
            if (x % j == 0) {
                while (x % j == 0) x /= j;
                
                if (!mp.count(j)) mp[j] = p++;
                
                v[i].push_back(mp[j]);
                v[mp[j]].push_back(i);
            }
        }
        
        if (x > 1) {
            if (!mp.count(x)) mp[x] = p++;
            
            v[i].push_back(mp[x]);
            v[mp[x]].push_back(i);
        }
    }
    
    for (i = 0; i < n; i++) {
        if (f[i] != -1) {
            vector <int> z;
            
            dfs(i, ++c, z);
            
            calc(z, -1);
            
            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

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:75:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
                    ^
./Main.cpp:77: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