Submission #583346

#	Time	Username	Problem	Language	Result	Execution time	Memory
583346		NintsiChkhaidze	Sirni (COCI17_sirni)	C++14	140 / 140	3362 ms	575096 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],ans,m[M];

vector <pair<int,int>> w[M];
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++){
        int a;
        cin>>a;
        p[i] = i;
        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--;
    }

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

        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] >= 0 && d[m[j]].f - d[y].f < j)
                w[d[m[j]].f - j].pb({y,m[j]});
    }

    for (int i = 0; i <= 1e7; i++){
        for (int j = 0; j < w[i].size(); j++){
            int x = w[i][j].f,y = w[i][j].s;
            dsu(x,y,i);
        }
    }
    cout<<ans;
}

Compilation message (stderr)

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

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