oj.uz

Submission #582995

# Submission time Handle Problem Language Result Execution time Memory
582995 2022-06-24T16:33:53 Z NintsiChkhaidze Sirni (COCI17_sirni) C++14
112 / 140
 5000 ms 435808 KB 
#include <bits/stdc++.h>
//#include <iostream>
//#include <vector>
#define s second
#define pb push_back
#define f first
using namespace std;

const int N = 100005,M = 10000005;
int p[N],ans,sz[N];
int m[M];

vector <pair<int,pair<int,int> > >  edges;
vector <pair<int,int> > d;

int P(int x){
    if (x == p[x]) return x;
    return p[x] = P(p[x]);
}

void dsu(int a,int b,int c){
    int pa = P(a),pb = P(b);
    if (pa == pb) return;
    ans += c;
    if (sz[pa] < sz[pb]) swap(pa,pb);
    sz[pa]+=sz[pb];
    sz[pb]=0;
    p[pb] = pa;
}

int main() {
    ios_base::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL);
    int n;
    cin>>n;
    for (int i = 1; i <= n; i++){
        int a;
        cin>>a;
        p[i] = i,sz[i] = 1;
        d.pb({a,i});
    }


    sort(d.begin(),d.end());
    int r = d.size() - 1;
    m[10000001] = -1;
    for (int i = 1e7; i >= 1; i--){
        m[i] = m[i + 1];
        while (r >= 0 && i <= d[r].f)
            m[i] = r,r--;
    }

    for (int y = 0; y < n; y++){
        if (y > 0 && d[y].f == d[y - 1].f)
            edges.pb({0,{y,y - 1}});

        if (y + 1 < n && d[y+1].f - d[y].f < d[y].f) edges.pb({d[y+1].f - d[y].f,{y,y + 1}});

        if (y > 0 && d[y].f == d[y - 1].f) continue;
        for (int j = d[y].f; j <= 1e7; j += d[y].f){
            if (m[j] < 0) continue;
            if (d[m[j]].f - j < d[y].f)
                edges.pb({d[m[j]].f - j,{y,m[j]}});
        }
    }

    sort(edges.begin(),edges.end());
    for (int i=0;i<edges.size();i++){
        int x = edges[i].s.f,y = edges[i].s.s,c = edges[i].f;
        dsu(x,y,c);
    }
    cout<<ans;
}

Compilation message

sirni.cpp: In function 'int main()':
sirni.cpp:67:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |     for (int i=0;i<edges.size();i++){
      |                  ~^~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 39628 KB Output is correct
2 Correct 101 ms 42588 KB Output is correct
3 Correct 50 ms 39756 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 39628 KB Output is correct
2 Correct 255 ms 41068 KB Output is correct
3 Correct 46 ms 39756 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 39628 KB Output is correct
2 Correct 40 ms 39424 KB Output is correct
3 Correct 39 ms 39752 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 327 ms 66316 KB Output is correct
2 Correct 969 ms 90876 KB Output is correct
3 Correct 424 ms 66428 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 43096 KB Output is correct
2 Correct 696 ms 90968 KB Output is correct
3 Correct 359 ms 66256 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 652 ms 91204 KB Output is correct
2 Correct 1359 ms 140308 KB Output is correct
3 Correct 379 ms 66388 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 268 ms 46592 KB Output is correct
2 Correct 1339 ms 140184 KB Output is correct
3 Correct 418 ms 66332 KB Output is correct

Subtask #8
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 292 ms 66440 KB Output is correct
2 Correct 4904 ms 435744 KB Output is correct
3 Correct 352 ms 66316 KB Output is correct

Subtask #9
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 307 ms 66368 KB Output is correct
2 Execution timed out 5066 ms 435808 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 42872 KB Output is correct
2 Execution timed out 5117 ms 435676 KB Time limit exceeded
3 Halted 0 ms 0 KB -