Submission #757062

#	Time	Username	Problem	Language	Result	Execution time	Memory
757062		nonono	Sirni (COCI17_sirni)	C++14	140 / 140	3873 ms	746872 KiB

sirni

#include "bits/stdc++.h"
using namespace std;

void file(string name = "") {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    if(name != "") {
        freopen((name + ".inp").c_str(), "r", stdin);
        freopen((name + ".out").c_str(), "w", stdout);
    }
}

struct DSU {
    vector<int> lab;
    
    void init(int n){
        lab.resize(n + 5);
        for(int i = 1; i <= n; i ++) lab[i] = -1;
    }
    
    int get_root(int u){
        return lab[u] < 0 ? u : lab[u] = get_root(lab[u]);
    }
    
    bool unite(int u, int v){
        u = get_root(u);
        v = get_root(v);
        
        if(u == v) return false;
        if(lab[u] > lab[v]) swap(u, v);
        
        lab[u] += lab[v];
        lab[v] = u;
        
        return true;
    }
} dsu;

const int mxN = 1e5 + 10, mxP = 1e7 + 10;
int n;
int p[mxN];
int nxt[mxP];
vector<vector<pair<int, int>>> edge(mxP);

void solve(){
    
    cin >> n;
    
    for(int i = 1; i <= n; i ++) cin >> p[i];
    
    sort(p + 1, p + 1 + n);
    
    int m = 0;
    for(int i = 0; i <= n; i ++){
        if(p[i - 1] != p[i]){
            p[++ m] = p[i];
        }
    }
    
    dsu.init(m);
    
    for(int i = 1; i <= m; i ++){
        nxt[p[i]] = -i;
    }
    
    for(int i = p[m]; i >= 1; i --){
        if(nxt[i] == 0){
            nxt[i] = nxt[i + 1];
            if(nxt[i] < 0) nxt[i] *= -1;
        }
    }
    
    for(int i = 1; i <= m; i ++){
        for(int j = p[i]; j <= p[m]; j += p[i]){
            int v = 0;
            
            if(j == p[i]){
                v = (nxt[j + 1] < 0 ? - nxt[j + 1] : nxt[j + 1]);
            } else {
                v = (nxt[j] < 0 ? - nxt[j] : nxt[j]);
            }
            
            if(v > 0){
                edge[p[v] % p[i]].push_back({i, v});
            }
        }
    }
    
    long long Res = 0;
    
    for(int i = 0; i < p[m]; i ++){
        for(auto [u, v] : edge[i]){
            if(dsu.unite(u, v)){
                Res += i;
            }
        }    
    }
    
    cout << Res << "\n";
}

signed main(){
    file("");
    
    int T = 1;
    while(T --) solve();
    
    return 0;
}

Compilation message (stderr)

sirni.cpp: In function 'void solve()':
sirni.cpp:92:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   92 |         for(auto [u, v] : edge[i]){
      |                  ^
sirni.cpp: In function 'void file(std::string)':
sirni.cpp:8:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    8 |         freopen((name + ".inp").c_str(), "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sirni.cpp:9:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    9 |         freopen((name + ".out").c_str(), "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 14 / 14
• Subtask 2: 14 / 14
• Subtask 3: 14 / 14
• Subtask 4: 14 / 14
• Subtask 5: 14 / 14
• Subtask 6: 14 / 14
• Subtask 7: 14 / 14
• Subtask 8: 14 / 14
• Subtask 9: 14 / 14
• Subtask 10: 14 / 14