oj.uz

Submission #873698

# Submission time Handle Problem Language Result Execution time Memory
873698 2023-11-15T13:23:29 Z vjudge1 Reconstruction Project (JOI22_reconstruction) C++17
7 / 100
 5000 ms 8852 KB 
#include<bits/stdc++.h>
#define pb push_back
#define pli pair<int,int>
#define fi first
#define se second
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL);
using namespace std;
using ll=long long;
const ll maxn=2e5;
const ll inf=1e18;
const ll mod=1e9+7;
ll lab[maxn];
ll u[maxn],v[maxn],w[maxn];
ll findset(ll x)
{
    return lab[x]<0?x:lab[x]=findset(lab[x]);
}
bool unite(ll u,ll v)
{
    u=findset(u);
    v=findset(v);
    if(u==v) return false;
    if(lab[u]>lab[v]) swap(u,v);
    lab[u]+=lab[v];
    lab[v]=u;
    return true;
}
ll n,m,q;
void solve()
{
    cin >> n >> m;
    for(int i=1;i<=m;i++)
    {
        cin >> u[i] >> v[i] >> w[i];
    }
    cin >> q;
    while(q--)
    {
        ll x;
        cin >> x;
        vector<pli>a,b;
        for(int j=1;j<=m;j++)
        {
            if(w[j]<=x)
            {
                a.pb({x-w[j],j});
            }
            else
            {
                b.pb({w[j]-x,j});
            }
        }
        sort(a.begin(),a.end());
        sort(b.begin(),b.end());
        vector<ll>c,d;
        for(int i=1;i<=n;i++) lab[i]=-1;
        for(int j=0;j<a.size();j++)
        {
            ll id=a[j].se;
            if(unite(u[id],v[id])) c.pb(id);
        }
        for(int i=1;i<=n;i++) lab[i]=-1;
        for(int j=0;j<b.size();j++)
        {
            ll id=b[j].se;
            if(unite(u[id],v[id])) d.pb(id);
        }
        for(int i=1;i<=n;i++) lab[i]=-1;
        ll j=0,k=0,ans=0;
        while(-lab[findset(1)]!=n)
        {
            if(j==c.size())
            {
                ans+=unite(u[d[k]],v[d[k]])*abs(w[d[k]]-x);
                k++;
                continue;
            }
            if(k==d.size())
            {
                ans+=unite(u[c[j]],v[c[j]])*abs(w[c[j]]-x);
                j++;
                continue;
            }
            ll cost1=abs(w[c[j]]-x);
            ll cost2=abs(w[d[k]]-x);
            if(cost1<cost2)
            {
                ans+=unite(u[c[j]],v[c[j]])*abs(w[c[j]]-x);
                j++;
            }
            else
            {
                ans+=unite(u[d[k]],v[d[k]])*abs(w[d[k]]-x);
                k++;
            }
        }
        cout << ans << '\n';
    }
}
int main()
{
    fastio
    //freopen(TASKNAME".INP","r",stdin);
    //freopen(TASKNAME".OUT","w",stdout);
    solve();
}

Compilation message

reconstruction.cpp: In function 'void solve()':
reconstruction.cpp:57:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |         for(int j=0;j<a.size();j++)
      |                     ~^~~~~~~~~
reconstruction.cpp:63:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |         for(int j=0;j<b.size();j++)
      |                     ~^~~~~~~~~
reconstruction.cpp:72:17: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |             if(j==c.size())
      |                ~^~~~~~~~~~
reconstruction.cpp:78:17: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |             if(k==d.size())
      |                ~^~~~~~~~~~

Subtask #1
3.0 / 3.0

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

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4440 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4564 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 98 ms 6560 KB Output is correct
21 Correct 102 ms 8176 KB Output is correct
22 Correct 99 ms 8448 KB Output is correct
23 Correct 100 ms 8272 KB Output is correct
24 Correct 100 ms 8140 KB Output is correct
25 Correct 105 ms 8184 KB Output is correct
26 Correct 101 ms 8388 KB Output is correct
27 Correct 99 ms 8128 KB Output is correct
28 Correct 114 ms 8196 KB Output is correct
29 Correct 107 ms 8444 KB Output is correct
30 Correct 105 ms 8432 KB Output is correct
31 Correct 102 ms 8352 KB Output is correct
32 Correct 102 ms 8188 KB Output is correct
33 Correct 102 ms 8152 KB Output is correct
34 Correct 55 ms 8356 KB Output is correct
35 Correct 98 ms 7692 KB Output is correct

Subtask #3
0 / 7.0

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

Subtask #4
0 / 28.0

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

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4440 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4564 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 98 ms 6560 KB Output is correct
21 Correct 102 ms 8176 KB Output is correct
22 Correct 99 ms 8448 KB Output is correct
23 Correct 100 ms 8272 KB Output is correct
24 Correct 100 ms 8140 KB Output is correct
25 Correct 105 ms 8184 KB Output is correct
26 Correct 101 ms 8388 KB Output is correct
27 Correct 99 ms 8128 KB Output is correct
28 Correct 114 ms 8196 KB Output is correct
29 Correct 107 ms 8444 KB Output is correct
30 Correct 105 ms 8432 KB Output is correct
31 Correct 102 ms 8352 KB Output is correct
32 Correct 102 ms 8188 KB Output is correct
33 Correct 102 ms 8152 KB Output is correct
34 Correct 55 ms 8356 KB Output is correct
35 Correct 98 ms 7692 KB Output is correct
36 Execution timed out 5006 ms 8852 KB Time limit exceeded
37 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4440 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4564 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 98 ms 6560 KB Output is correct
21 Correct 102 ms 8176 KB Output is correct
22 Correct 99 ms 8448 KB Output is correct
23 Correct 100 ms 8272 KB Output is correct
24 Correct 100 ms 8140 KB Output is correct
25 Correct 105 ms 8184 KB Output is correct
26 Correct 101 ms 8388 KB Output is correct
27 Correct 99 ms 8128 KB Output is correct
28 Correct 114 ms 8196 KB Output is correct
29 Correct 107 ms 8444 KB Output is correct
30 Correct 105 ms 8432 KB Output is correct
31 Correct 102 ms 8352 KB Output is correct
32 Correct 102 ms 8188 KB Output is correct
33 Correct 102 ms 8152 KB Output is correct
34 Correct 55 ms 8356 KB Output is correct
35 Correct 98 ms 7692 KB Output is correct
36 Correct 1 ms 4444 KB Output is correct
37 Correct 1 ms 4444 KB Output is correct
38 Correct 1 ms 4444 KB Output is correct
39 Execution timed out 5074 ms 7088 KB Time limit exceeded
40 Halted 0 ms 0 KB -