oj.uz

Submission #575097

# Submission time Handle Problem Language Result Execution time Memory
575097 2022-06-09T16:55:52 Z Sorting Reconstruction Project (JOI22_reconstruction) C++17
31 / 100
 5000 ms 413144 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
template<class T> void check_min(T &a, const T &b){ a = (a < b) ? a : b; }
template<class T> void check_max(T &a, const T &b){ a = (a > b) ? a : b; }
#define all(x) (x).begin(), (x).end()

const int N = 500 + 3;
const int M = 1e5 + 3;
const int Q = 1e6 + 3;
const int INF = 1e9;

int n, m, q;
array<ll, 3> e[M];
ll x[Q];

struct DSU{
    int sz[N], par[N];

    void init(int n){
        for(int i = 1; i <= n; ++i)
            sz[i] = 1, par[i] = i;
    }

    int getP(int x){
        if(par[x] == x) return x;
        return par[x] = getP(par[x]);
    }

    bool unite(int a, int b){
        a = getP(a), b = getP(b);
        if(a == b) return false;
        if(sz[a] < sz[b]) swap(a, b);
        sz[a] += sz[b];
        par[b] = a;
        return true;
    }
} dsu;

vector<int> pr[M], su[M];

pair<ll, int> get_ans(const vector<int> &e1, const vector<int> &e2, ll x, int ptr){
    ll ans = 0;
    int cnt = 0;

    vector<pair<int, int>> e3;
    int ptr1 = 0, ptr2 = 0;
    while(ptr1 != e1.size() && ptr2 != e2.size()){
        int cost1 = x - e[e1[ptr1]][0];
        int cost2 = e[e2[ptr2]][0] - x;

        if(cost1 < cost2)
            e3.push_back({cost1, e1[ptr1++]});
        else
            e3.push_back({cost2, e2[ptr2++]});
    }
    while(ptr1 != e1.size()){
        int cost1 = x - e[e1[ptr1]][0];
        e3.push_back({cost1, e1[ptr1++]});
    }
    while(ptr2 != e2.size()){
        int cost2 = e[e2[ptr2]][0] - x;
        e3.push_back({cost2, e2[ptr2++]});
    }
    
    dsu.init(n);
    for(auto [cost, idx]: e3){
        if(dsu.unite(e[idx][1], e[idx][2])){
            ans += cost;
            if(idx >= ptr)
                ++cnt;
        }
    }

    return {ans, cnt};
}

ll bin_search_next_change(const vector<int> &e1, const vector<int> &e2, ll x, int ptr, int cnt){
    ll l = x + 1, r = INF + 1;
    while(l != r){
        ll mid = (l + r) >> 1;
        if(get_ans(e1, e2, mid, ptr).second > cnt)
            r = mid;
        else
            l = mid + 1;
    }
    return l;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n >> m;
    for(int i = 0; i < m; ++i){
        cin >> e[i][1] >> e[i][2] >> e[i][0];
    }
    sort(e, e + m);

    pr[0] = {0};
    for(int i = 1; i < m; ++i){
        dsu.init(n);
        pr[i].push_back(i);
        for(int idx: pr[i - 1])
            if(dsu.unite(e[idx][1], e[idx][2]))
                pr[i].push_back(idx);
    }

    su[m - 1] = {m - 1};
    for(int i = m - 2; i >= 0; --i){
        dsu.init(n);
        su[i].push_back(i);
        for(int idx: su[i + 1])
            if(dsu.unite(e[idx][1], e[idx][2]))
                su[i].push_back(idx);
    }

    ll ans = 0, cnt = 0, prevx = -INF, next_change;
    auto p = get_ans({}, su[0], prevx, 0);
    ans = p.first;
    cnt = p.second;
    next_change = bin_search_next_change({}, su[0], prevx, 0, cnt);

    int ptr = 0;
    cin >> q;
    for(int i = 0; i < q; ++i){
        cin >> x[i];
        while(ptr != m && x[i] >= e[ptr][0]){
            ++ptr;

            vector<int> e1;
            if(0 <= ptr - 1){
                e1 = pr[ptr - 1];
            }
            vector<int> e2;
            if(ptr <= m - 1){
                e2 = su[ptr];
            }

            auto p = get_ans(e1, e2, x[i], ptr);
            ans = p.first;
            cnt = p.second;
            prevx = x[i];
            next_change = bin_search_next_change(e1, e2, prevx, ptr, cnt);
        }
        
        if(x[i] < next_change){
            cout << ans + (ll)(n - 1 - 2 * cnt) * (x[i] - prevx) << "\n";
        }
        else{
            vector<int> e1;
            if(0 <= ptr - 1){
                e1 = pr[ptr - 1];
            }
            vector<int> e2;
            if(ptr <= m - 1){
                e2 = su[ptr];
            }

            auto p = get_ans(e1, e2, x[i], ptr);
            ans = p.first;
            cnt = p.second;
            prevx = x[i];
            next_change = bin_search_next_change(e1, e2, prevx, ptr, cnt);

            cout << ans << "\n";
        }
    }
}

Compilation message

reconstruction.cpp: In function 'std::pair<long long int, int> get_ans(const std::vector<int>&, const std::vector<int>&, ll, int)':
reconstruction.cpp:50:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |     while(ptr1 != e1.size() && ptr2 != e2.size()){
      |           ~~~~~^~~~~~~~~~~~
reconstruction.cpp:50:37: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |     while(ptr1 != e1.size() && ptr2 != e2.size()){
      |                                ~~~~~^~~~~~~~~~~~
reconstruction.cpp:59:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |     while(ptr1 != e1.size()){
      |           ~~~~~^~~~~~~~~~~~
reconstruction.cpp:63:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |     while(ptr2 != e2.size()){
      |           ~~~~~^~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 5028 KB Output is correct
7 Correct 3 ms 5028 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 4 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct

Subtask #2
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 5028 KB Output is correct
7 Correct 3 ms 5028 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 4 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Execution timed out 5061 ms 412360 KB Time limit exceeded
21 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Execution timed out 5066 ms 413144 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 5028 KB Output is correct
7 Correct 3 ms 5028 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 4 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 958 ms 38204 KB Output is correct
21 Correct 901 ms 38116 KB Output is correct
22 Correct 923 ms 38324 KB Output is correct
23 Correct 931 ms 38304 KB Output is correct
24 Correct 928 ms 38200 KB Output is correct
25 Correct 943 ms 38256 KB Output is correct
26 Correct 825 ms 38156 KB Output is correct
27 Correct 626 ms 38232 KB Output is correct
28 Correct 935 ms 38172 KB Output is correct
29 Correct 932 ms 38092 KB Output is correct
30 Correct 768 ms 38324 KB Output is correct
31 Correct 576 ms 37928 KB Output is correct
32 Correct 192 ms 38416 KB Output is correct
33 Correct 414 ms 38008 KB Output is correct

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 5028 KB Output is correct
7 Correct 3 ms 5028 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 4 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Execution timed out 5061 ms 412360 KB Time limit exceeded
21 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 5028 KB Output is correct
7 Correct 3 ms 5028 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 4 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Execution timed out 5061 ms 412360 KB Time limit exceeded
21 Halted 0 ms 0 KB -