oj.uz

답안 #1033381

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1033381 2024-07-24T17:45:55 Z shenfe1 Reconstruction Project (JOI22_reconstruction) C++17
7 / 100
 5000 ms 14344 KB 
#include <bits/stdc++.h>
 
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")
 
using namespace std;
 
#define pb push_back
#define all(v) v.begin(),v.end()
#define sz(s) (int)s.size()
#define ppb pop_back
#define ll long long
#define pii pair<int,int>
#define F first
#define S second
#define lb lower_bound
// #define int ll
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
const int MAX=2e5+10;
 
int n,m;
vector<pair<int,pii>> e;
 
struct DSU{
    int f[MAX];
 
    void init(int n){
        for(int i=1;i<=n;i++)f[i]=i;
    }
 
    int get(int v){
        return (f[v]==v?v:f[v]=get(f[v]));
    }
 
    void unite(int a,int b){
        a=get(a);
        b=get(b);
        f[a]=b;
    }
}D;
 
int make(int a,pii x){
    if(D.get(x.F)!=D.get(x.S)){
        D.unite(x.F,x.S);
        return a;
    }
    return 0;
}
 
ll solve(int d){
    int r=lb(all(e),make_pair(d,make_pair(0,0)))-e.begin();
    int l=r-1;
    D.init(n);
    ll ans=0;
    int cnt=0;
    for(int i=1;i<=m,cnt<n-1;i++){
        if((r<sz(e)&&l>=0&&e[r].F-d<=d-e[l].F)||l<0){
            if(D.get(e[r].S.F)!=D.get(e[r].S.S)){
                ans+=e[r].F-d;
                D.unite(e[r].S.F,e[r].S.S);
                cnt++;
            }
            r++;
        }
        else{
            if(D.get(e[l].S.F)!=D.get(e[l].S.S)){
                ans+=d-e[l].F;
                D.unite(e[l].S.F,e[l].S.S);
                cnt++;
            }
            l--;
        }
    }
    return ans;
}
 
void solve(){
    cin>>n>>m;
    for(int i=1;i<=m;i++){
        int a,b,c;
        cin>>a>>b>>c;
        e.pb({c,{a,b}});
    }
    sort(all(e));
    // cout<<e[0].F<<" "<<e[1].F<<"\n";
    int q;
    cin>>q;
    while(q--){
        int d;
        cin>>d;
        cout<<solve(d)<<"\n";
    }
}
 
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t=1;
    // cin>>t;
    while(t--)solve();
}

Compilation message

reconstruction.cpp: In function 'long long int solve(int)':
reconstruction.cpp:58:18: warning: left operand of comma operator has no effect [-Wunused-value]
   58 |     for(int i=1;i<=m,cnt<n-1;i++){
      |                 ~^~~

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 0 ms 468 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 472 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 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 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 0 ms 468 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 472 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 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 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 348 KB Output is correct
20 Correct 29 ms 3284 KB Output is correct
21 Correct 29 ms 3280 KB Output is correct
22 Correct 25 ms 3284 KB Output is correct
23 Correct 23 ms 3284 KB Output is correct
24 Correct 23 ms 3284 KB Output is correct
25 Correct 23 ms 3280 KB Output is correct
26 Correct 23 ms 3280 KB Output is correct
27 Correct 22 ms 3104 KB Output is correct
28 Correct 31 ms 3236 KB Output is correct
29 Correct 26 ms 3284 KB Output is correct
30 Correct 22 ms 3284 KB Output is correct
31 Correct 22 ms 3280 KB Output is correct
32 Correct 19 ms 3276 KB Output is correct
33 Correct 25 ms 3284 KB Output is correct
34 Correct 25 ms 3536 KB Output is correct
35 Correct 28 ms 3280 KB Output is correct

Subtask #3
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 5040 ms 6340 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 0 ms 468 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 472 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 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 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 Execution timed out 5062 ms 14344 KB Time limit exceeded
21 Halted 0 ms 0 KB -

Subtask #5
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 0 ms 468 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 472 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 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 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 348 KB Output is correct
20 Correct 29 ms 3284 KB Output is correct
21 Correct 29 ms 3280 KB Output is correct
22 Correct 25 ms 3284 KB Output is correct
23 Correct 23 ms 3284 KB Output is correct
24 Correct 23 ms 3284 KB Output is correct
25 Correct 23 ms 3280 KB Output is correct
26 Correct 23 ms 3280 KB Output is correct
27 Correct 22 ms 3104 KB Output is correct
28 Correct 31 ms 3236 KB Output is correct
29 Correct 26 ms 3284 KB Output is correct
30 Correct 22 ms 3284 KB Output is correct
31 Correct 22 ms 3280 KB Output is correct
32 Correct 19 ms 3276 KB Output is correct
33 Correct 25 ms 3284 KB Output is correct
34 Correct 25 ms 3536 KB Output is correct
35 Correct 28 ms 3280 KB Output is correct
36 Correct 759 ms 3768 KB Output is correct
37 Execution timed out 5026 ms 3644 KB Time limit exceeded
38 Halted 0 ms 0 KB -

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 0 ms 468 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 472 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 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 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 348 KB Output is correct
20 Correct 29 ms 3284 KB Output is correct
21 Correct 29 ms 3280 KB Output is correct
22 Correct 25 ms 3284 KB Output is correct
23 Correct 23 ms 3284 KB Output is correct
24 Correct 23 ms 3284 KB Output is correct
25 Correct 23 ms 3280 KB Output is correct
26 Correct 23 ms 3280 KB Output is correct
27 Correct 22 ms 3104 KB Output is correct
28 Correct 31 ms 3236 KB Output is correct
29 Correct 26 ms 3284 KB Output is correct
30 Correct 22 ms 3284 KB Output is correct
31 Correct 22 ms 3280 KB Output is correct
32 Correct 19 ms 3276 KB Output is correct
33 Correct 25 ms 3284 KB Output is correct
34 Correct 25 ms 3536 KB Output is correct
35 Correct 28 ms 3280 KB Output is correct
36 Correct 0 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 5040 ms 6340 KB Time limit exceeded
40 Halted 0 ms 0 KB -