oj.uz

답안 #999485

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
999485 2024-06-15T15:16:27 Z vladilius Reconstruction Project (JOI22_reconstruction) C++17
42 / 100
 5000 ms 416208 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define pb push_back
#define ff first
#define ss second
#define ins insert
#define arr3 array<int, 3>
const int inf = 1e9 + 5;

struct ST{
    vector<vector<pii>> g;
    vector<pii> ed;
    vector<int> gd;
    int n, m, A;
    bool type;
    ST(int ns, int ms){
        n = ns;
        m = ms;
        g.resize(n + 1);
        ed.resize(m + 1);
    }
    void set_mini(){
        A = m + 1;
        type = 1;
    }
    void set_maxi(){
        A = 0;
        type = 0;
    }
    int f(int x, int y){
        if (type){
            return min(x, y);
        }
        return max(x, y);
    }
    vector<pii> st;
    bool ind;
    void dfs(int v, int pr, int pre, int& t){
        // cout<<"дідько "<<v<<" "<<pr<<" "<<t<<" "<<"\n";
        if (ind) return;
        st.pb({v, pre});
        if (v == t){
            ind = 1;
            return;
        }
        for (auto [i, j]: g[v]){
            if (i == pr) continue;
            dfs(i, v, j, t);
        }
        if (ind) return;
        st.pop_back();
    }
    void add(int x, int y, int i){
        ed[i] = {x, y};
        st.clear();
        ind = 0;
        dfs(x, 0, A, y);
        if (st.size() > 1){
            int mn = A;
            for (auto [j, ii]: st) mn = f(mn, ii);
            auto [u, v] = ed[mn];
            gd.erase(find(gd.begin(), gd.end(), mn));
            for (int i = 0; i < g[u].size(); i++){
                if (g[u][i].ff == v){
                    g[u].erase(g[u].begin() + i);
                    break;
                }
            }
            for (int i = 0; i < g[v].size(); i++){
                if (g[v][i].ff == u){
                    g[v].erase(g[v].begin() + i);
                    break;
                }
            }
        }
        g[x].pb({y, i});
        g[y].pb({x, i});
        gd.pb(i);
    }
    void clear(){
        for (int i = 1; i <= n; i++){
            g[i].clear();
        }
        ed.clear();
        gd.clear();
    }
};

struct dsu{
    vector<int> sz, p;
    int n;
    ll W;
    dsu(int ns){
        n = ns;
        p.resize(n + 1);
        sz.resize(n + 1);
        for (int i = 1; i <= n; i++){
            p[i] = i;
            sz[i] = 1;
        }
        W = 0;
    }
    int get(int v){
        if (p[v] != v){
            p[v] = get(p[v]);
        }
        return p[v];
    }
    void unite(int x, int y, int w){
        x = get(x); y = get(y);
        if (x == y) return;
        if (sz[x] > sz[y]) swap(x, y);
        p[x] = y;
        sz[y] += sz[x];
        W += w;
    }
};

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    int n, m; cin>>n>>m;
    vector<arr3> ed = {{0, 0, 0}};
    for (int i = 1; i <= m; i++){
        int a, b, w; cin>>a>>b>>w;
        ed.pb({a, b, w});
    }
    ed.pb({0, 0, inf});

    auto cmp = [&](arr3& x, arr3& y){
        return x[2] < y[2];
    };
    sort(ed.begin(), ed.end(), cmp);
    
    vector<int> actl[m + 2];
    ST T(n, m);
    T.set_mini();
    for (int i = 1; i <= m; i++){
        T.add(ed[i][0], ed[i][1], i);
        actl[i] = T.gd;
        reverse(actl[i].begin(), actl[i].end());
    }
    
    T.clear();
    T.set_maxi();
    vector<int> actr[m + 2];
    for (int i = m; i > 0; i--){
        T.add(ed[i][0], ed[i][1], i);
        actr[i] = T.gd;
        reverse(actr[i].begin(), actr[i].end());
    }
    
    int q; cin>>q;
    vector<pii> qs;
    for (int i = 1; i <= q; i++){
        int x; cin>>x;
        qs.pb({x, i});
    }
    sort(qs.begin(), qs.end());

    vector<ll> out(q + 1);
    int j1 = 0;
    for (int i = 0; i <= m; i++){
        vector<int>& edg1 = actl[i], edg2 = actr[i + 1];
        
        int l = ed[i][2], r = ed[i + 1][2] - 1;
        int j2 = j1;
        while (j2 < qs.size() && l <= qs[j2].ff && qs[j2].ff <= r){
            j2++;
        }
        while (j1 < j2){
            int x = qs[j1].ff;
            int i1 = 0, i2 = 0;
            dsu T(n);
            while (i1 < edg1.size() || i2 < edg2.size()){
                if (i1 == edg1.size()){
                    int j = edg2[i2];
                    T.unite(ed[j][0], ed[j][1], abs(ed[j][2] - x));
                    i2++;
                    continue;
                }
                if (i2 == edg2.size()){
                    int j = edg1[i1];
                    T.unite(ed[j][0], ed[j][1], abs(ed[j][2] - x));
                    i1++;
                    continue;
                }
                int v1 = abs(ed[edg1[i1]][2] - x);
                int v2 = abs(ed[edg2[i2]][2] - x);
                if (v1 < v2){
                    int j = edg1[i1];
                    T.unite(ed[j][0], ed[j][1], v1);
                    i1++;
                }
                else {
                    int j = edg2[i2];
                    T.unite(ed[j][0], ed[j][1], v2);
                    i2++;
                }
            }
            out[qs[j1].ss] = T.W;
            j1++;
        }
    }
    
    for (int i = 1; i <= q; i++) cout<<out[i]<<"\n";
}

Compilation message

reconstruction.cpp: In member function 'void ST::add(int, int, int)':
reconstruction.cpp:65:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |             for (int i = 0; i < g[u].size(); i++){
      |                             ~~^~~~~~~~~~~~~
reconstruction.cpp:71:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   71 |             for (int i = 0; i < g[v].size(); i++){
      |                             ~~^~~~~~~~~~~~~
reconstruction.cpp: In function 'int main()':
reconstruction.cpp:172:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  172 |         while (j2 < qs.size() && l <= qs[j2].ff && qs[j2].ff <= r){
      |                ~~~^~~~~~~~~~~
reconstruction.cpp:179:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  179 |             while (i1 < edg1.size() || i2 < edg2.size()){
      |                    ~~~^~~~~~~~~~~~~
reconstruction.cpp:179:43: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  179 |             while (i1 < edg1.size() || i2 < edg2.size()){
      |                                        ~~~^~~~~~~~~~~~~
reconstruction.cpp:180:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  180 |                 if (i1 == edg1.size()){
      |                     ~~~^~~~~~~~~~~~~~
reconstruction.cpp:186:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  186 |                 if (i2 == edg2.size()){
      |                     ~~~^~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct

Subtask #2
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 877 ms 400528 KB Output is correct
21 Correct 558 ms 378816 KB Output is correct
22 Correct 731 ms 395228 KB Output is correct
23 Correct 762 ms 399368 KB Output is correct
24 Correct 756 ms 400176 KB Output is correct
25 Correct 842 ms 400400 KB Output is correct
26 Correct 872 ms 400324 KB Output is correct
27 Correct 892 ms 400416 KB Output is correct
28 Correct 873 ms 400540 KB Output is correct
29 Correct 868 ms 400328 KB Output is correct
30 Correct 878 ms 400508 KB Output is correct
31 Correct 871 ms 400324 KB Output is correct
32 Correct 879 ms 400368 KB Output is correct
33 Correct 878 ms 400316 KB Output is correct
34 Correct 876 ms 400324 KB Output is correct
35 Correct 874 ms 400460 KB Output is correct

Subtask #3
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Execution timed out 5098 ms 416208 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Execution timed out 5090 ms 18960 KB Time limit exceeded
21 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 877 ms 400528 KB Output is correct
21 Correct 558 ms 378816 KB Output is correct
22 Correct 731 ms 395228 KB Output is correct
23 Correct 762 ms 399368 KB Output is correct
24 Correct 756 ms 400176 KB Output is correct
25 Correct 842 ms 400400 KB Output is correct
26 Correct 872 ms 400324 KB Output is correct
27 Correct 892 ms 400416 KB Output is correct
28 Correct 873 ms 400540 KB Output is correct
29 Correct 868 ms 400328 KB Output is correct
30 Correct 878 ms 400508 KB Output is correct
31 Correct 871 ms 400324 KB Output is correct
32 Correct 879 ms 400368 KB Output is correct
33 Correct 878 ms 400316 KB Output is correct
34 Correct 876 ms 400324 KB Output is correct
35 Correct 874 ms 400460 KB Output is correct
36 Correct 1365 ms 400996 KB Output is correct
37 Correct 926 ms 379472 KB Output is correct
38 Correct 1173 ms 395972 KB Output is correct
39 Correct 1242 ms 399984 KB Output is correct
40 Correct 1186 ms 400880 KB Output is correct
41 Correct 1261 ms 400940 KB Output is correct
42 Correct 1280 ms 400984 KB Output is correct
43 Correct 1353 ms 401024 KB Output is correct
44 Correct 1110 ms 401088 KB Output is correct
45 Correct 1101 ms 401092 KB Output is correct
46 Correct 1326 ms 401092 KB Output is correct
47 Correct 1299 ms 401092 KB Output is correct
48 Correct 1277 ms 401096 KB Output is correct
49 Correct 1269 ms 400920 KB Output is correct
50 Correct 980 ms 401092 KB Output is correct
51 Correct 1020 ms 400900 KB Output is correct

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 877 ms 400528 KB Output is correct
21 Correct 558 ms 378816 KB Output is correct
22 Correct 731 ms 395228 KB Output is correct
23 Correct 762 ms 399368 KB Output is correct
24 Correct 756 ms 400176 KB Output is correct
25 Correct 842 ms 400400 KB Output is correct
26 Correct 872 ms 400324 KB Output is correct
27 Correct 892 ms 400416 KB Output is correct
28 Correct 873 ms 400540 KB Output is correct
29 Correct 868 ms 400328 KB Output is correct
30 Correct 878 ms 400508 KB Output is correct
31 Correct 871 ms 400324 KB Output is correct
32 Correct 879 ms 400368 KB Output is correct
33 Correct 878 ms 400316 KB Output is correct
34 Correct 876 ms 400324 KB Output is correct
35 Correct 874 ms 400460 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Execution timed out 5098 ms 416208 KB Time limit exceeded
40 Halted 0 ms 0 KB -