oj.uz

답안 #582735

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
582735 2022-06-24T11:07:02 Z NintsiChkhaidze Sirni (COCI17_sirni) C++14
70 / 140
 5000 ms 786432 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 = 10000005;
int p[N],m[N],sz[N],a[N],ans,MR[N];

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++)
        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 i = 1; i <= n; i++){
        if (MR[i]) edges.pb({a[MR[i]] - a[i],{i,MR[i]}});

        for (int j = 2*a[i]; j <= 1e7; j += a[i])
            if (m[j]) edges.pb({a[m[j]] - j,{i,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:56: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]
   56 |     for (int i=0;i<edges.size();i++){
      |                  ~^~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 39628 KB Output is correct
2 Correct 532 ms 88816 KB Output is correct
3 Correct 42 ms 39996 KB Output is correct

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 84 ms 39652 KB Output is correct
2 Runtime error 1796 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 39568 KB Output is correct
2 Correct 40 ms 39488 KB Output is correct
3 Correct 41 ms 39744 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 339 ms 67172 KB Output is correct
2 Correct 1468 ms 140920 KB Output is correct
3 Correct 669 ms 91896 KB Output is correct

Subtask #5
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 86 ms 43040 KB Output is correct
2 Execution timed out 5108 ms 436636 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #6
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 740 ms 91744 KB Output is correct
2 Correct 2333 ms 239564 KB Output is correct
3 Correct 516 ms 67212 KB Output is correct

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 266 ms 47036 KB Output is correct
2 Correct 2360 ms 239612 KB Output is correct
3 Correct 653 ms 91848 KB Output is correct

Subtask #8
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 279 ms 67176 KB Output is correct
2 Runtime error 961 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #9
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 366 ms 67260 KB Output is correct
2 Runtime error 1018 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 80 ms 43136 KB Output is correct
2 Runtime error 1141 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -