oj.uz

Submission #973102

# Submission time Handle Problem Language Result Execution time Memory
973102 2024-05-01T13:46:17 Z Unforgettablepl Bridges (APIO19_bridges) C++17
14 / 100
 78 ms 12992 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long

struct UFDS{
    vector<int> siz,p;
    UFDS(int n):siz(n+1,1),p(n+1){iota(p.begin(),p.end(),0);}
    int findRoot(int x){
        return x==p[x] ? x : p[x]= findRoot(p[x]);
    }
    void unite(int a,int b){
        a = findRoot(a);
        b = findRoot(b);
        if(a==b)return;
        if(siz[b]>siz[a])swap(a,b);
        siz[a]+=siz[b];
        p[b] = a;
    }
};


int ans[100001];
UFDS dsu(50000);

int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    vector<pair<int,pair<int,int>>> edges;
    vector<tuple<int,int,int>> queries;
    int n,m;
    cin >> n >> m;
    for(int i=1;i<=m;i++){
        int a,b,c;cin>>a>>b>>c;
        edges.emplace_back(c,make_pair(a,b));
    }
    int q;
    cin >> q;
    for(int i=1;i<=q;i++){
        int type,a,b;cin>>type>>a>>b;
        queries.emplace_back(b,a,i);
    }
    sort(edges.rbegin(), edges.rend());
    sort(queries.rbegin(), queries.rend());
    auto iter = edges.begin();
    for(auto[wt,x,idx]:queries){
        while(iter!=edges.end() and iter->first>=wt){
            dsu.unite(iter->second.first,iter->second.second);
            iter++;
        }
        ans[idx] = dsu.siz[dsu.findRoot(x)];
    }
    for(int i=1;i<=q;i++)cout<<ans[i]<<'\n';
}

Subtask #1
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 1112 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 51 ms 8008 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 42 ms 6992 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 11980 KB Output is correct
2 Correct 29 ms 6604 KB Output is correct
3 Correct 30 ms 6604 KB Output is correct
4 Correct 32 ms 7372 KB Output is correct
5 Correct 59 ms 10752 KB Output is correct
6 Correct 65 ms 12992 KB Output is correct
7 Correct 60 ms 11364 KB Output is correct
8 Correct 50 ms 8512 KB Output is correct
9 Correct 51 ms 8620 KB Output is correct
10 Correct 50 ms 8512 KB Output is correct
11 Correct 58 ms 10964 KB Output is correct
12 Correct 58 ms 11200 KB Output is correct
13 Correct 64 ms 11324 KB Output is correct
14 Correct 59 ms 11712 KB Output is correct
15 Correct 60 ms 10948 KB Output is correct
16 Correct 72 ms 11464 KB Output is correct
17 Correct 68 ms 11624 KB Output is correct
18 Correct 64 ms 12792 KB Output is correct
19 Correct 63 ms 11712 KB Output is correct
20 Correct 57 ms 11212 KB Output is correct
21 Correct 56 ms 11248 KB Output is correct
22 Correct 63 ms 11712 KB Output is correct
23 Correct 52 ms 9920 KB Output is correct

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 51 ms 8008 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 1112 KB Output isn't correct
2 Halted 0 ms 0 KB -