제출 #1061021

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1061021		12345678	Reconstruction Project (JOI22_reconstruction)	C++17	7 / 100	5092 ms	6452 KiB

reconstruction

#include <bits/stdc++.h>

using namespace std;

#define ll long long
#pragma gcc-optimize("o3, unroll-loops")

const int nx=5e2+5, mx=1e5+5;

ll n, m, a[mx], b[mx], w[mx], dsu[nx], x, q;

int find(int x)
{
    if (dsu[x]==x) return x;
    return dsu[x]=find(dsu[x]);
}

int32_t main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>m;
    for (int i=1; i<=m; i++) cin>>a[i]>>b[i]>>w[i];
    cin>>q;
    while (q--)
    {
        cin>>x;
        vector<pair<ll, ll>> edg;
        for (int i=1; i<=n; i++) dsu[i]=i;
        for (int i=1; i<=m; i++) edg.push_back({abs(w[i]-x), i});
        sort(edg.begin(), edg.end());
        ll res=0, cnt=0;
        for (auto [k, idx]:edg)
        {
            if (find(a[idx])==find(b[idx])) continue;
            res+=k;
            cnt++;
            dsu[find(a[idx])]=find(b[idx]);
            if (cnt==n-1) break;
        }
        cout<<res<<'\n';
    }
}

컴파일 시 표준 에러 (stderr) 메시지

reconstruction.cpp:6: warning: ignoring '#pragma gcc ' [-Wunknown-pragmas]
    6 | #pragma gcc-optimize("o3, unroll-loops")
      |

• Subtask 1: 3 / 3
• Subtask 2: 4 / 4
• Subtask 3: 0 / 7
• Subtask 4: 0 / 28
• Subtask 5: 0 / 35
• Subtask 6: 0 / 23