Submission #881853

#	Time	Username	Problem	Language	Result	Execution time	Memory
881853		boyliguanhan	Sirni (COCI17_sirni)	C++17	0 / 140	217 ms	292292 KiB

sirni

#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
• Subtask 2: 0 / 14
• Subtask 3: 0 / 14
• Subtask 4: 0 / 14
• Subtask 5: 0 / 14
• Subtask 6: 0 / 14
• Subtask 7: 0 / 14
• Subtask 8: 0 / 14
• Subtask 9: 0 / 14
• Subtask 10: 0 / 14