oj.uz

Submission #1004160

# Submission time Handle Problem Language Result Execution time Memory
1004160 2024-06-21T05:58:24 Z TahirAliyev Sirni (COCI17_sirni) C++17
84 / 140
 1985 ms 786432 KB 
#include <bits/stdc++.h>

using namespace std;

#define int long long
#define pii pair<int, int>
#define all(v) v.begin(), v.end()
#define oo 1e9

const int MAX = 1e5 + 5, MX = 1e7 + 7;
int n;
int arr[MAX];
int nxt[MX];
vector<pii> E[MX];

struct DSU{
    int par[MAX];
    void init(){
        for(int i = 0; i < MAX; i++) par[i] = -1;
    }
    int get(int i){
        if(par[i] < 0) return i;
        return par[i] = get(par[i]);
    }
    bool unite(int u, int v){
        u = get(u), v = get(v);
        if(u == v) return 0;
        if(-par[u] < -par[v]) swap(u, v);
        par[u] += par[v];
        par[v] = u;
        return 1;
    }
};

DSU dsu;

void solve(){
    cin >> n;
    dsu.init();
    for(int i = 1; i <= n; i++){
        cin >> arr[i];
        if(nxt[arr[i]]) dsu.unite(i, nxt[arr[i]]);
        nxt[arr[i]] = i;
    } 
    int cur = 0;
    for(int i = MX - 1; i >= 1; i--){
        if(nxt[i]) cur = nxt[i];
        nxt[i] = cur;
    }
    for(int i = 1; i <= n; i++){
        if(nxt[arr[i] + 1] && arr[nxt[arr[i] + 1]] < 2 * arr[i]) E[arr[nxt[arr[i] + 1]] - arr[i]].push_back({i, nxt[arr[i] + 1]});
        for(int j = 2 * arr[i]; j < MX; j += arr[i]){
            if(nxt[j] && arr[nxt[j]] < j + arr[i]) E[arr[nxt[j]] - j].push_back({i, nxt[j]});
        }
    }
    int ans = 0;
    for(int i = 0; i < MX; i++){
        for(auto a : E[i]){
            if(dsu.unite(a.first, a.second)){
                ans += i;
            }
        }
    }
    cout << ans << '\n';
}

signed main(){
    // ios::sync_with_stdio(0);
    // cin.tie(0);
    // cout.tie(0);
    int t = 1;
    while(t--){
        solve();
    }
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 128 ms 314256 KB Output is correct
2 Correct 160 ms 320844 KB Output is correct
3 Correct 135 ms 314504 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 173 ms 314320 KB Output is correct
2 Correct 361 ms 316500 KB Output is correct
3 Correct 135 ms 314560 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 138 ms 314448 KB Output is correct
2 Correct 130 ms 314364 KB Output is correct
3 Correct 140 ms 314340 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 249 ms 334576 KB Output is correct
2 Correct 539 ms 410180 KB Output is correct
3 Correct 302 ms 353612 KB Output is correct

Subtask #5
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 137 ms 317524 KB Output is correct
2 Runtime error 1985 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 341 ms 363692 KB Output is correct
2 Correct 732 ms 467848 KB Output is correct
3 Correct 249 ms 343128 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 229 ms 321480 KB Output is correct
2 Correct 702 ms 452720 KB Output is correct
3 Correct 290 ms 348104 KB Output is correct

Subtask #8
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 235 ms 338392 KB Output is correct
2 Runtime error 791 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #9
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 186 ms 339052 KB Output is correct
2 Runtime error 747 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 135 ms 318892 KB Output is correct
2 Runtime error 749 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -