| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 | 
|---|---|---|---|---|---|---|---|
| 1284781 | hainam2k9 | Sirni (COCI17_sirni) | C++20 | 1008 ms | 427088 KiB | 
#include <bits/stdc++.h>
#define tt cin.tie(0), cout.tie(0), ios_base::sync_with_stdio(0)
#define fo freopen((NAME+".INP").c_str(), "r", stdin), freopen((NAME+".OUT").c_str(), "w", stdout)
#define ll long long
#define ull unsigned long long
#define i128 __int128
#define db long double
#define sz(a) ((int)(a).size())
#define pb emplace_back
#define pf emplace_front
#define pob pop_back
#define pof pop_front
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define ins emplace
#define mp make_pair
using namespace std;
const int MOD = 1e9+7, MAXN = 1e7+5;
const string NAME = "";
struct DSU{
    int par[MAXN],sz[MAXN];
    void init(int n){
        iota(par+1,par+n+1,1);
        fill(sz+1,sz+n+1,1);
    }
    int Find(int u){
        if(u==par[u]) return u;
        return par[u]=Find(par[u]);
    }
    bool Union(int x, int y){
        x=Find(x), y=Find(y);
        if(x==y) return 0;
        if(sz[x]<sz[y]) swap(x,y);
        par[y]=x, sz[x]+=sz[y];
        return 1;
    }
}dsu;
int n,nxt[MAXN],m=0;
ll rs=0;
bool vis[MAXN];
vector<pair<int,int>> v[MAXN];
int main()
{
    tt;
    if(fopen((NAME + ".INP").c_str(), "r")) fo;
    cin >> n;
    for(int i = 1; i<=n; ++i){
        int x;
        cin >> x;
        vis[x]=1, m=max(m,x);
    }
    for(int i = m; i>0; --i)
        nxt[i]=(vis[i] ? i : nxt[i+1]);
    for(int i = 1; i<=m; ++i){
        if(!vis[i]) continue;
        if(nxt[i+1]&&nxt[i+1]<i*2) v[nxt[i+1]-i].pb(i,nxt[i+1]);
        for(int j = i*2; j<=m; j+=i)
            if(nxt[j]&&nxt[j]<j+i) v[nxt[j]-j].pb(i,nxt[j]);
    }
    dsu.init(m);
    for(int i = 0; i<m; ++i)
        for(pair<int,int>& p : v[i])
            if(dsu.Union(p.fi,p.se)) rs+=i;
    cout << rs;
}
컴파일 시 표준 에러 (stderr) 메시지
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
