oj.uz

Submission #568724

# Submission time Handle Problem Language Result Execution time Memory
568724 2022-05-26T06:26:01 Z zaneyu Reconstruction Project (JOI22_reconstruction) C++14
7 / 100
 5000 ms 4488 KB 
/*input
5 10
1 2 8
1 3 13
1 4 5
1 5 11
1 5 3
2 3 7
2 4 15
3 4 6
3 5 6
4 5 2
6
3
6
8
10
13
17
*/
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<long long,null_type,less_equal<long long>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("Ofast")
//#pragma GCC target("avx2")
//order_of_key #of elements less than x
// find_by_order kth element
using ll=long long;
using ld=long double;
using pii=pair<int,int>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll maxn=5e5+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const int MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-6;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
    out<<P.f<<' '<<P.s;
    return out;
}
template<typename T>
ostream& operator<<(ostream& out,vector<T> V){
    REP(i,sz(V)) out<<V[i]<<((i!=sz(V)-1)?" ":"");
    return out;
}
ll mult(ll a,ll b){
    return a*b%MOD;
}
ll mypow(ll a,ll b){
    a%=MOD;
    if(a==0) return 0;
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=(res*a)%MOD;
        a=(a*a)%MOD;
        b>>=1;
    }
    return res;
}
int par[maxn];
int find(int u){
    if(par[u]==u) return u;
    return par[u]=find(par[u]);
}
void merge(int a,int b){
    a=find(a),b=find(b);
    if(a==b) return;
    par[a]=b;
}
int main(){
    int n,m;
    cin>>n>>m;
    vector<pair<int,pii>> eds;
    REP(i,m){
        int a,b,c;
        cin>>a>>b>>c;
        --a,--b;
        eds.pb({c,{a,b}});
    }
    int q;
    cin>>q;
    while(q--){
        vector<pair<int,pii>> ed;
        int c;
        cin>>c;
        for(auto x:eds){
            ed.pb({abs(x.f-c),x.s});
        }
        sort(ALL(ed));
        ll ans=0;
        REP(i,n) par[i]=i;
        for(auto x:ed){
            int a=x.s.f,b=x.s.s;
            if(find(a)!=find(b)){
                ans+=x.f;
                merge(a,b);
            }
        } 
        cout<<ans<<'\n';
    } 
    

}

Subtask #1
3.0 / 3.0

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

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 196 ms 4204 KB Output is correct
21 Correct 207 ms 4332 KB Output is correct
22 Correct 197 ms 4264 KB Output is correct
23 Correct 184 ms 4200 KB Output is correct
24 Correct 203 ms 4236 KB Output is correct
25 Correct 196 ms 4188 KB Output is correct
26 Correct 188 ms 4200 KB Output is correct
27 Correct 210 ms 4288 KB Output is correct
28 Correct 219 ms 4212 KB Output is correct
29 Correct 233 ms 4240 KB Output is correct
30 Correct 220 ms 4256 KB Output is correct
31 Correct 181 ms 4200 KB Output is correct
32 Correct 188 ms 4308 KB Output is correct
33 Correct 231 ms 4268 KB Output is correct
34 Correct 212 ms 4212 KB Output is correct
35 Correct 196 ms 4216 KB Output is correct

Subtask #3
0 / 7.0

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

Subtask #4
0 / 28.0

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

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 196 ms 4204 KB Output is correct
21 Correct 207 ms 4332 KB Output is correct
22 Correct 197 ms 4264 KB Output is correct
23 Correct 184 ms 4200 KB Output is correct
24 Correct 203 ms 4236 KB Output is correct
25 Correct 196 ms 4188 KB Output is correct
26 Correct 188 ms 4200 KB Output is correct
27 Correct 210 ms 4288 KB Output is correct
28 Correct 219 ms 4212 KB Output is correct
29 Correct 233 ms 4240 KB Output is correct
30 Correct 220 ms 4256 KB Output is correct
31 Correct 181 ms 4200 KB Output is correct
32 Correct 188 ms 4308 KB Output is correct
33 Correct 231 ms 4268 KB Output is correct
34 Correct 212 ms 4212 KB Output is correct
35 Correct 196 ms 4216 KB Output is correct
36 Execution timed out 5094 ms 4312 KB Time limit exceeded
37 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 196 ms 4204 KB Output is correct
21 Correct 207 ms 4332 KB Output is correct
22 Correct 197 ms 4264 KB Output is correct
23 Correct 184 ms 4200 KB Output is correct
24 Correct 203 ms 4236 KB Output is correct
25 Correct 196 ms 4188 KB Output is correct
26 Correct 188 ms 4200 KB Output is correct
27 Correct 210 ms 4288 KB Output is correct
28 Correct 219 ms 4212 KB Output is correct
29 Correct 233 ms 4240 KB Output is correct
30 Correct 220 ms 4256 KB Output is correct
31 Correct 181 ms 4200 KB Output is correct
32 Correct 188 ms 4308 KB Output is correct
33 Correct 231 ms 4268 KB Output is correct
34 Correct 212 ms 4212 KB Output is correct
35 Correct 196 ms 4216 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Execution timed out 5025 ms 4488 KB Time limit exceeded
40 Halted 0 ms 0 KB -