oj.uz

Submission #640117

# Submission time Handle Problem Language Result Execution time Memory
640117 2022-09-13T16:50:58 Z victor_gao Reconstruction Project (JOI22_reconstruction) C++17
100 / 100
 2374 ms 43832 KB 
//#pragma GCC optimize("Ofast,unroll-loops,O3")
//#pragma GCC optimize("avx,avx2,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,fma,tune=native")
#include<bits/stdc++.h>
//#include<bits/extc++.h>
//#pragma pack(1)
#define fast ios::sync_with_stdio(0); cin.tie(0);
#define pii pair<int,int>
#define x first
#define y second
#define N 515
using namespace std;
//using namespace __gnu_pbds;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//typedef tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update> order_multiset;
//typedef tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> order_set;
struct dsu{
    int boss[N]={},sz[N]={};
    void init(int n){
        for (int i=1;i<=n;i++){
            boss[i]=i;
            sz[i]=1;
        }
    }
    int find(int x){
        if (boss[x]==x) return x;
        return boss[x]=find(boss[x]);
    }
    void Merge(int a,int b){
        int ra=find(a);
        int rb=find(b);
        if (ra==rb) return;
        if (sz[ra]>sz[rb]){
            boss[rb]=ra;
            sz[ra]+=sz[rb];
        }
        else {
            boss[ra]=rb;
            sz[rb]+=ra;
        }
    }
}d;
int n,m,q;
int fa[N],use_edge[N],dep[N];
long long ans[1000015];
bool vis[100015];
vector<pii>qus;
vector<pair<int,pii> >change;
vector<pair<int,pii> >edge;
set<pii>g[N];
vector<pii>vt;
int count(int pos,int c){
    return abs(edge[pos].x-c);
}
void dfs(int p,int lp,int use){
    fa[p]=lp;
    use_edge[p]=use;
    dep[p]=dep[lp]+1;
    for (auto i:g[p]){
        if (i.x!=lp) dfs(i.x,p,i.y);
    }
}
pii find_min(int a,int b,int val){
    int mx_val=-1,mx_edge=-1,mx_pos=0;
    while (a!=b){
        if (dep[a]>dep[b]){
            if (a!=1&&mx_val<count(use_edge[a],val)){
                mx_val=count(use_edge[a],val);
                mx_edge=use_edge[a];
                mx_pos=a;
            }
            a=fa[a];
        }
        else {
            if (b!=1&&mx_val<count(use_edge[b],val)){
                mx_val=count(use_edge[b],val);
                mx_edge=use_edge[b];
                mx_pos=b;
            }
            b=fa[b];
        }
    }
    assert(mx_edge!=-1);
    return {mx_edge,mx_pos};
}
void Remove(int num){
    g[edge[num].y.x].erase({edge[num].y.y,num});
    g[edge[num].y.y].erase({edge[num].y.x,num});
}
void In(int num){
    g[edge[num].y.x].insert({edge[num].y.y,num});
    g[edge[num].y.y].insert({edge[num].y.x,num});
}
void modify(int num,int out){
    int mid=(edge[num].x+edge[out].x+1)/2;
    change.push_back({mid,{out,num}});
    Remove(out);
    In(num);
    dfs(1,0,-1);
}
signed main(){
    fast
    cin>>n>>m;
    d.init(n);
    for (int i=1;i<=m;i++){
        int a,b,w; cin>>a>>b>>w;
        edge.push_back({w,{a,b}});
    }
    sort(edge.begin(),edge.end());
    for (int di=0;di<m;di++){
        pair<int,pii>i=edge[di];
        if (d.find(i.y.x)!=d.find(i.y.y)){
            d.Merge(i.y.x,i.y.y);
            g[i.y.x].insert({i.y.y,di});
            g[i.y.y].insert({i.y.x,di});
            vis[di]=1;
        }
    }
    dfs(1,0,-1);
    /*
    cout<<'\n';
    for (auto i:edge)
        cout<<i.y.x<<" "<<i.y.y<<' '<<i.x<<'\n';
    cout<<'\n';
    cout<<"father: ";
    for (int i=1;i<=n;i++){
        cout<<fa[i]<<' ';
    }
    cout<<'\n';
    cout<<"Dep: ";
    for (int i=1;i<=n;i++){
        cout<<dep[i]<<' ';
    }
    cout<<'\n';
    */
    for (int i=0;i<m;i++){
        if (vis[i]){
            vt.push_back({edge[i].x,i});
            continue;
        } 
        pii now_change=find_min(edge[i].y.x,edge[i].y.y,edge[i].x);
       // cout<<"Edge "<<edge[i].y.x<<" "<<edge[i].y.y<<" "<<edge[i].x<<" find "<<now_change.x<<" , "<<now_change.y<<'\n';
        modify(i,now_change.x);
    }
    sort(change.begin(),change.end());
    cin>>q;
    for (int i=1;i<=q;i++){
        int np; cin>>np;
        qus.push_back({np,i});
    }
    sort(qus.begin(),qus.end());
    sort(vt.begin(),vt.end());
    long long p=0,val_p=0,big=0,small=0;
    for (auto i:vt)
        big+=i.x;
    for (auto i:qus){
        while (p<change.size()&&i.x>=change[p].x){
            vector<pii>now;
            pii ch=change[p].y;
            for (auto j:vt){
                if (j.y==ch.x) continue;
                else now.push_back(j);
            }
            now.push_back({edge[ch.y].x,ch.y});
            sort(now.begin(),now.end());
            swap(now,vt);
            val_p=0; small=0; big=0;
            for (auto j:vt)
                big+=j.x;
            p++;
        }
        while (val_p<vt.size()&&vt[val_p].x<i.x){
            big-=vt[val_p].x;
            small+=vt[val_p].x;
            val_p++;
        }
        /*
        cout<<"qus: "<<i.x<<" ->\n";
        for (auto j:vt)
            cout<<j.x<<" ";
        cout<<'\n';
        cout<<val_p<<' '<<big<<' '<<small<<'\n';
        */
        ans[i.y]=big-small+(long long)(val_p-(n-1-val_p))*i.x;
    }
    for (int i=1;i<=q;i++)
        cout<<ans[i]<<'\n';
}

Compilation message

reconstruction.cpp: In function 'int main()':
reconstruction.cpp:156:17: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<int, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  156 |         while (p<change.size()&&i.x>=change[p].x){
      |                ~^~~~~~~~~~~~~~
reconstruction.cpp:171:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  171 |         while (val_p<vt.size()&&vt[val_p].x<i.x){
      |                ~~~~~^~~~~~~~~~

Subtask #1
3.0 / 3.0

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

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 360 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 360 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1762 ms 5564 KB Output is correct
21 Correct 1911 ms 5664 KB Output is correct
22 Correct 1874 ms 5612 KB Output is correct
23 Correct 1873 ms 5584 KB Output is correct
24 Correct 1806 ms 5564 KB Output is correct
25 Correct 1748 ms 5588 KB Output is correct
26 Correct 1741 ms 5632 KB Output is correct
27 Correct 1774 ms 5656 KB Output is correct
28 Correct 2082 ms 5684 KB Output is correct
29 Correct 2166 ms 5640 KB Output is correct
30 Correct 1614 ms 5584 KB Output is correct
31 Correct 1675 ms 5684 KB Output is correct
32 Correct 1709 ms 5920 KB Output is correct
33 Correct 1365 ms 5496 KB Output is correct
34 Correct 691 ms 5604 KB Output is correct
35 Correct 1407 ms 5544 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1913 ms 30432 KB Output is correct
5 Correct 1884 ms 30552 KB Output is correct
6 Correct 1925 ms 30468 KB Output is correct
7 Correct 2124 ms 32692 KB Output is correct
8 Correct 2124 ms 32596 KB Output is correct
9 Correct 2126 ms 32732 KB Output is correct
10 Correct 1469 ms 30700 KB Output is correct
11 Correct 1745 ms 32748 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 360 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 360 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 213 ms 35940 KB Output is correct
21 Correct 219 ms 35100 KB Output is correct
22 Correct 215 ms 34884 KB Output is correct
23 Correct 210 ms 35000 KB Output is correct
24 Correct 211 ms 34980 KB Output is correct
25 Correct 214 ms 35044 KB Output is correct
26 Correct 214 ms 34920 KB Output is correct
27 Correct 209 ms 34872 KB Output is correct
28 Correct 209 ms 34852 KB Output is correct
29 Correct 207 ms 34812 KB Output is correct
30 Correct 210 ms 35016 KB Output is correct
31 Correct 204 ms 34784 KB Output is correct
32 Correct 207 ms 35424 KB Output is correct
33 Correct 203 ms 34612 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 360 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 360 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1762 ms 5564 KB Output is correct
21 Correct 1911 ms 5664 KB Output is correct
22 Correct 1874 ms 5612 KB Output is correct
23 Correct 1873 ms 5584 KB Output is correct
24 Correct 1806 ms 5564 KB Output is correct
25 Correct 1748 ms 5588 KB Output is correct
26 Correct 1741 ms 5632 KB Output is correct
27 Correct 1774 ms 5656 KB Output is correct
28 Correct 2082 ms 5684 KB Output is correct
29 Correct 2166 ms 5640 KB Output is correct
30 Correct 1614 ms 5584 KB Output is correct
31 Correct 1675 ms 5684 KB Output is correct
32 Correct 1709 ms 5920 KB Output is correct
33 Correct 1365 ms 5496 KB Output is correct
34 Correct 691 ms 5604 KB Output is correct
35 Correct 1407 ms 5544 KB Output is correct
36 Correct 1748 ms 5712 KB Output is correct
37 Correct 1894 ms 5804 KB Output is correct
38 Correct 1859 ms 5772 KB Output is correct
39 Correct 1858 ms 5796 KB Output is correct
40 Correct 1820 ms 5884 KB Output is correct
41 Correct 1759 ms 5812 KB Output is correct
42 Correct 1763 ms 5820 KB Output is correct
43 Correct 1793 ms 5748 KB Output is correct
44 Correct 2103 ms 5780 KB Output is correct
45 Correct 2169 ms 5692 KB Output is correct
46 Correct 1778 ms 5692 KB Output is correct
47 Correct 1747 ms 5840 KB Output is correct
48 Correct 1733 ms 5780 KB Output is correct
49 Correct 1412 ms 5696 KB Output is correct
50 Correct 688 ms 5984 KB Output is correct
51 Correct 1397 ms 5736 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 360 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 360 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1762 ms 5564 KB Output is correct
21 Correct 1911 ms 5664 KB Output is correct
22 Correct 1874 ms 5612 KB Output is correct
23 Correct 1873 ms 5584 KB Output is correct
24 Correct 1806 ms 5564 KB Output is correct
25 Correct 1748 ms 5588 KB Output is correct
26 Correct 1741 ms 5632 KB Output is correct
27 Correct 1774 ms 5656 KB Output is correct
28 Correct 2082 ms 5684 KB Output is correct
29 Correct 2166 ms 5640 KB Output is correct
30 Correct 1614 ms 5584 KB Output is correct
31 Correct 1675 ms 5684 KB Output is correct
32 Correct 1709 ms 5920 KB Output is correct
33 Correct 1365 ms 5496 KB Output is correct
34 Correct 691 ms 5604 KB Output is correct
35 Correct 1407 ms 5544 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 1913 ms 30432 KB Output is correct
40 Correct 1884 ms 30552 KB Output is correct
41 Correct 1925 ms 30468 KB Output is correct
42 Correct 2124 ms 32692 KB Output is correct
43 Correct 2124 ms 32596 KB Output is correct
44 Correct 2126 ms 32732 KB Output is correct
45 Correct 1469 ms 30700 KB Output is correct
46 Correct 1745 ms 32748 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 213 ms 35940 KB Output is correct
49 Correct 219 ms 35100 KB Output is correct
50 Correct 215 ms 34884 KB Output is correct
51 Correct 210 ms 35000 KB Output is correct
52 Correct 211 ms 34980 KB Output is correct
53 Correct 214 ms 35044 KB Output is correct
54 Correct 214 ms 34920 KB Output is correct
55 Correct 209 ms 34872 KB Output is correct
56 Correct 209 ms 34852 KB Output is correct
57 Correct 207 ms 34812 KB Output is correct
58 Correct 210 ms 35016 KB Output is correct
59 Correct 204 ms 34784 KB Output is correct
60 Correct 207 ms 35424 KB Output is correct
61 Correct 203 ms 34612 KB Output is correct
62 Correct 1748 ms 5712 KB Output is correct
63 Correct 1894 ms 5804 KB Output is correct
64 Correct 1859 ms 5772 KB Output is correct
65 Correct 1858 ms 5796 KB Output is correct
66 Correct 1820 ms 5884 KB Output is correct
67 Correct 1759 ms 5812 KB Output is correct
68 Correct 1763 ms 5820 KB Output is correct
69 Correct 1793 ms 5748 KB Output is correct
70 Correct 2103 ms 5780 KB Output is correct
71 Correct 2169 ms 5692 KB Output is correct
72 Correct 1778 ms 5692 KB Output is correct
73 Correct 1747 ms 5840 KB Output is correct
74 Correct 1733 ms 5780 KB Output is correct
75 Correct 1412 ms 5696 KB Output is correct
76 Correct 688 ms 5984 KB Output is correct
77 Correct 1397 ms 5736 KB Output is correct
78 Correct 1934 ms 40896 KB Output is correct
79 Correct 2100 ms 43044 KB Output is correct
80 Correct 2073 ms 41976 KB Output is correct
81 Correct 2070 ms 41976 KB Output is correct
82 Correct 2033 ms 41088 KB Output is correct
83 Correct 1963 ms 40944 KB Output is correct
84 Correct 1965 ms 40764 KB Output is correct
85 Correct 1989 ms 41120 KB Output is correct
86 Correct 2265 ms 40796 KB Output is correct
87 Correct 2374 ms 42784 KB Output is correct
88 Correct 1969 ms 40780 KB Output is correct
89 Correct 1958 ms 40816 KB Output is correct
90 Correct 1937 ms 41060 KB Output is correct
91 Correct 1641 ms 40740 KB Output is correct
92 Correct 917 ms 43832 KB Output is correct
93 Correct 1641 ms 42080 KB Output is correct