oj.uz

Submission #582991

# Submission time Handle Problem Language Result Execution time Memory
582991 2022-06-24T16:32:02 Z NintsiChkhaidze Sirni (COCI17_sirni) C++14
112 / 140
 5000 ms 436088 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) 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 92 ms 42628 KB Output is correct
3 Correct 40 ms 39716 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 82 ms 39636 KB Output is correct
2 Correct 260 ms 41136 KB Output is correct
3 Correct 41 ms 39720 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 39620 KB Output is correct
2 Correct 38 ms 39500 KB Output is correct
3 Correct 39 ms 39692 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 296 ms 66448 KB Output is correct
2 Correct 913 ms 90888 KB Output is correct
3 Correct 381 ms 66340 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 42984 KB Output is correct
2 Correct 582 ms 91020 KB Output is correct
3 Correct 354 ms 66272 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 586 ms 90984 KB Output is correct
2 Correct 1169 ms 140316 KB Output is correct
3 Correct 356 ms 66432 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 238 ms 46540 KB Output is correct
2 Correct 1179 ms 140296 KB Output is correct
3 Correct 340 ms 66364 KB Output is correct

Subtask #8
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 257 ms 66404 KB Output is correct
2 Correct 4197 ms 435760 KB Output is correct
3 Correct 311 ms 66480 KB Output is correct

Subtask #9
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 254 ms 66408 KB Output is correct
2 Execution timed out 5048 ms 436088 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 42948 KB Output is correct
2 Execution timed out 5047 ms 435872 KB Time limit exceeded
3 Halted 0 ms 0 KB -