Submission #582876

#	Time	Username	Problem	Language	Result	Execution time	Memory
582876		NintsiChkhaidze	Sirni (COCI17_sirni)	C++14	70 / 140	5094 ms	786432 KiB

sirni

#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],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 (pa < pb) swap(pa,pb);
    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,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}});
            }
        }else{
            upd.clear();
        }

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

        if (y > 0 && d[y].f == d[y - 1].f) continue;
        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 (stderr)

sirni.cpp: In function 'int main()':
sirni.cpp:49: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]
   49 |             for (int i=0;i<upd.size();i++){
      |                          ~^~~~~~~~~~~
sirni.cpp:68: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]
   68 |     for (int i=0;i<edges.size();i++){
      |                  ~^~~~~~~~~~~~~

• Subtask 1: 14 / 14
• Subtask 2: 0 / 14
• Subtask 3: 14 / 14
• Subtask 4: 14 / 14
• Subtask 5: 0 / 14
• Subtask 6: 14 / 14
• Subtask 7: 14 / 14
• Subtask 8: 0 / 14
• Subtask 9: 0 / 14
• Subtask 10: 0 / 14