oj.uz

Submission #582754

# Submission time Handle Problem Language Result Execution time Memory
582754 2022-06-24T11:25:46 Z NintsiChkhaidze Sirni (COCI17_sirni) C++14
0 / 140
 803 ms 93124 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],sz[N],a[N],MR[N],ans;
int m[M];

vector <pair<int,pair<int,int> > >  edges,upd;
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++)
        cin>>a[i],p[i] = i,sz[i] = 1,d.pb({a[i],i});

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

    for(int i = n - 2; i >= 0; i--)
        MR[d[i].s] = d[i + 1].s;

    for (int y = 0; y < n; y++){
        if (y > 0 && d[y].f == d[y - 1].f){
            for (int i=0;i<upd.size();i++){
                edges.pb({upd[i].f,{d[y].s,upd[i].s.s}});
            }
            continue;
        }else{
            upd.clear();
        }

        int id = d[y].s;
        if (MR[id]) {
            edges.pb({a[MR[id]] - a[id],{id,MR[id]}});
            upd.pb({a[MR[id]] - a[id],{id,MR[id]}});
        }

        for (int j = 2*d[y].f; j <= 1e7; j += d[y].f){
            if (!m[j]) continue;
            edges.pb({a[m[j]] - j,{id,m[j]}});
            upd.pb({a[m[j]] - j,{id,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:51:27: 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]
   51 |             for (int i=0;i<upd.size();i++){
      |                          ~^~~~~~~~~~~
sirni.cpp:73: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]
   73 |     for (int i=0;i<edges.size();i++){
      |                  ~^~~~~~~~~~~~~

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 39612 KB Output is correct
2 Incorrect 626 ms 88980 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

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

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 39664 KB Output is correct
2 Incorrect 42 ms 39516 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

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

Subtask #5
0 / 14.0

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

Subtask #6
0 / 14.0

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

Subtask #7
0 / 14.0

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

Subtask #8
0 / 14.0

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

Subtask #9
0 / 14.0

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

Subtask #10
0 / 14.0

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