oj.uz

Submission #881853

# Submission time Handle Problem Language Result Execution time Memory
881853 2023-12-02T05:12:51 Z boyliguanhan Sirni (COCI17_sirni) C++17
0 / 140
 217 ms 292292 KB 
#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize(2)
int nxt[10001000], p[100100],pa[100100],n,mx,ans;
vector<pair<int,int>> edges[10001000];
int abp(int n) {
    return (pa[n]?pa[n]=abp(pa[n]):n);
}
bool un(int a, int b) {
    a=abp(a);
    b=abp(b);
    if(a==b)
        return 0;
    pa[a]=b;
    return 1;
}
int main() {
    cin.sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> n;
    for(int i = 1; i <= n; i++)
        cin >> p[i], mx=max(mx,p[i]),nxt[p[i]]=i;
    for(int i = mx; i--;)
        if(!nxt[i])
            nxt[i]=nxt[i+1];
    for(int i = 1; i <= n; i++)
        if(i-p[i-1])
            for(int j = p[i]; j <= mx; j+=p[i])
                edges[p[nxt[j+(j==p[i])]]%p[i]].push_back({i,nxt[j]});
    for(int i = 0; i <= mx/2; i++)
        for(auto [u,v]: edges[i])
            if(un(u,v))
                ans+=i;
    cout << ans << '\n';
}

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 140 ms 274396 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 80 ms 235600 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 135 ms 274584 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 122 ms 249512 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 90 ms 241232 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 158 ms 263896 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 93 ms 240072 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 217 ms 288596 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 211 ms 292292 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 141 ms 276860 KB Output isn't correct
2 Halted 0 ms 0 KB -