oj.uz

Submission #491835

# Submission time Handle Problem Language Result Execution time Memory
491835 2021-12-04T16:53:36 Z nikolapesic2802 Bridges (APIO19_bridges) C++14
100 / 100
 2023 ms 321752 KB 
/*#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline") //Optimization flags
#pragma GCC option("arch=native","tune=native","no-zero-upper") //Enable AVX
#pragma GCC target("avx2")  //Enable AVX*/

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>

#define ll long long
#define pb push_back
#define sz(x) (int)(x).size()
#define mp make_pair
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define D(x) cerr << #x << " is " << (x) << "\n";

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>; ///find_by_order(),order_of_key()
template<class T1, class T2> ostream& operator<<(ostream& os, const pair<T1,T2>& a) { os << '{' << a.f << ", " << a.s << '}'; return os; }
template<class T> ostream& operator<<(ostream& os, const vector<T>& a){os << '{';for(int i=0;i<sz(a);i++){if(i>0&&i<sz(a))os << ", ";os << a[i];}os<<'}';return os;}
template<class T> ostream& operator<<(ostream& os, const deque<T>& a){os << '{';for(int i=0;i<sz(a);i++){if(i>0&&i<sz(a))os << ", ";os << a[i];}os<<'}';return os;}
template<class T> ostream& operator<<(ostream& os, const set<T>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T> ostream& operator<<(ostream& os, const set<T,greater<T> >& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T> ostream& operator<<(ostream& os, const multiset<T>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T> ostream& operator<<(ostream& os, const multiset<T,greater<T> >& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T1,class T2> ostream& operator<<(ostream& os, const map<T1,T2>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}

const int N=1e5+500;
int L,M;
int u[N],v[N],w[N],last[N],qu[N],qw[N],ans[N];
vector<int> pojedinacno[N];
vector<pair<int,int> > arr[N];
int n,m,q,tr;
void add(int l,int r,int in,int w){
    //printf("%i-%i  %i: %i %i  %i\n",l,r,in,u[in],v[in],w);
    int le=l/L,ri=r/L;
    if(le==ri){
        if(l==le*L&&r==min(tr-1,(ri+1)*L-1)){
            arr[le].pb({w,in});
            return;
        }
        for(int i=l;i<=r;i++)
            if(qw[i]<=w)
                pojedinacno[i].pb(in);
        return;
    }
    if(l==le*L)
        le--;
    else
        for(int i=l;i<(le+1)*L;i++)
            if(qw[i]<=w)
                pojedinacno[i].pb(in);
    if(r==min(tr-1,(ri+1)*L-1)){
        for(int i=le+1;i<=ri;i++)
            arr[i].pb({w,in});
    }
    else{
        for(int i=le+1;i<ri;i++)
            arr[i].pb({w,in});
        for(int i=ri*L;i<=r;i++)
            if(qw[i]<=w)
                pojedinacno[i].pb(in);
    }

}
struct DSU{
    vector<int> p,siz,in,undo;
    DSU(){p.resize(N);siz.resize(N,1);in.resize(N);iota(all(p),0);}
    void reset(){
        for(auto d:undo)
            p[d]=d,in[d]=0,siz[d]=1;
        undo.clear();
    }
    int find(int tr){return tr==p[tr]?tr:p[tr]=find(p[tr]);}
    void merge(int a,int b){
        a=find(a);
        b=find(b);
        if(!in[a])
            in[a]=1,undo.pb(a);
        if(a==b)
            return;
        if(!in[b])
            in[b]=1,undo.pb(b);
        if(siz[a]<siz[b]){
            siz[b]+=siz[a];
            p[a]=b;
        }
        else{
            siz[a]+=siz[b];
            p[b]=a;
        }
    }
};
void solve(){
    DSU global,moj;
    for(int i=0;i<M;i++){
        global.reset();
        vector<pair<pair<int,int>,int> > query;
        for(int j=i*L;j<(i+1)*L&&~qu[j];j++)
            query.pb({{qw[j],qu[j]},j});
        //cout << arr[i] << query << endl;
        sort(all(query));
        reverse(all(query));
        int ind=0;
        //printf("%i:-----------------------------------\n",i);
        for(auto p:query){
            //printf("Racunam %i %i\n",p.f.f,p.f.s);
            while(ind<arr[i].size()&&arr[i][ind].f>=p.f.f)
                global.merge(u[arr[i][ind].s],v[arr[i][ind].s]),ind++;
            moj.reset();
            for(auto d:pojedinacno[p.s]){
                int uu=global.find(u[d]),vv=global.find(v[d]);
                //printf("Moj %i %i %i %i\n",uu,vv,moj.siz[uu],moj.siz[vv]);
                if(moj.siz[uu]<global.siz[uu])
                    moj.siz[uu]=global.siz[uu];
                if(moj.siz[vv]<global.siz[vv])
                    moj.siz[vv]=global.siz[vv];
                //printf("Moj %i %i %i %i\n",uu,vv,moj.siz[uu],moj.siz[vv]);
                moj.merge(uu,vv);
            }
            ans[p.s]=max(moj.siz[moj.find(global.find(p.f.s))],global.siz[moj.find(global.find(p.f.s))]);
        }
        for(int j=i*L;j<(i+1)*L&&~qu[j];j++)
            printf("%i\n",ans[j]);
    }
}
int main()
{
    for(int i=0;i<N;i++)
        qu[i]=-1;
	//freopen("in.txt","r",stdin);
	//freopen("out.txt","w",stdout);
	//n=50000;
	//m=100000;
	//int d=1e9;
	scanf("%i %i",&n,&m);
	for(int i=0;i<m;i++){
        //u[i]=rng()%n;v[i]=rng()%n;w[i]=rng()%d;
        scanf("%i %i %i",&u[i],&v[i],&w[i]),u[i]--,v[i]--;
	}
	//q=100000;
    scanf("%i",&q);
    vector<tuple<int,int,int,int> > ad;
    for(int i=0;i<q;i++){
        int t,a,b;
        //t=rng()%2+1;
        //a=rng()%n;
        //b=rng()%d;
        scanf("%i %i %i",&t,&a,&b);
        a--;
        if(t==2){
            qu[tr]=a;
            qw[tr++]=b;
        }else{
            if(last[a]!=tr)
                ad.pb(make_tuple(w[a],tr-1,a,last[a]));
            last[a]=tr;
            w[a]=b;
        }
    }
    for(int i=0;i<m;i++)
        if(last[i]!=tr)
            ad.pb(make_tuple(w[i],tr-1,i,last[i]));
    int d=sqrt(tr);
    L=d;
    if(tr==q)
        L=tr;
    M=N/L;
    sort(all(ad));
    reverse(all(ad));
    for(auto p:ad){
        int a,b,c,d;
        tie(d,b,c,a)=p;
        add(a,b,c,d);
    }
    solve();
    return 0;
}

Compilation message

bridges.cpp: In function 'void solve()':
bridges.cpp:114: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]
  114 |             while(ind<arr[i].size()&&arr[i][ind].f>=p.f.f)
      |                   ~~~^~~~~~~~~~~~~~
bridges.cpp: In function 'int main()':
bridges.cpp:135:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  135 |     for(int i=0;i<N;i++)
      |     ^~~
bridges.cpp:142:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  142 |  scanf("%i %i",&n,&m);
      |  ^~~~~
bridges.cpp:142:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  142 |  scanf("%i %i",&n,&m);
      |  ~~~~~^~~~~~~~~~~~~~~
bridges.cpp:145:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  145 |         scanf("%i %i %i",&u[i],&v[i],&w[i]),u[i]--,v[i]--;
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bridges.cpp:148:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  148 |     scanf("%i",&q);
      |     ~~~~~^~~~~~~~~
bridges.cpp:155:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  155 |         scanf("%i %i %i",&t,&a,&b);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7756 KB Output is correct
2 Correct 4 ms 7756 KB Output is correct
3 Correct 16 ms 9712 KB Output is correct
4 Correct 12 ms 8136 KB Output is correct
5 Correct 13 ms 9036 KB Output is correct
6 Correct 12 ms 8908 KB Output is correct
7 Correct 18 ms 8908 KB Output is correct
8 Correct 17 ms 8864 KB Output is correct
9 Correct 19 ms 9420 KB Output is correct
10 Correct 18 ms 8976 KB Output is correct
11 Correct 17 ms 8940 KB Output is correct
12 Correct 20 ms 9108 KB Output is correct
13 Correct 19 ms 9136 KB Output is correct
14 Correct 18 ms 9152 KB Output is correct
15 Correct 19 ms 9016 KB Output is correct
16 Correct 20 ms 9036 KB Output is correct
17 Correct 17 ms 9036 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1343 ms 159248 KB Output is correct
2 Correct 1290 ms 158556 KB Output is correct
3 Correct 1357 ms 158760 KB Output is correct
4 Correct 1402 ms 159224 KB Output is correct
5 Correct 1318 ms 158832 KB Output is correct
6 Correct 1572 ms 173992 KB Output is correct
7 Correct 1622 ms 171460 KB Output is correct
8 Correct 1713 ms 172628 KB Output is correct
9 Correct 45 ms 10020 KB Output is correct
10 Correct 1319 ms 157792 KB Output is correct
11 Correct 1210 ms 156124 KB Output is correct
12 Correct 1325 ms 175716 KB Output is correct
13 Correct 1180 ms 102112 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1024 ms 106616 KB Output is correct
2 Correct 633 ms 72304 KB Output is correct
3 Correct 1106 ms 116748 KB Output is correct
4 Correct 990 ms 106348 KB Output is correct
5 Correct 58 ms 10008 KB Output is correct
6 Correct 1046 ms 114936 KB Output is correct
7 Correct 911 ms 102084 KB Output is correct
8 Correct 819 ms 93800 KB Output is correct
9 Correct 835 ms 105404 KB Output is correct
10 Correct 780 ms 104228 KB Output is correct
11 Correct 643 ms 73076 KB Output is correct
12 Correct 531 ms 62640 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 15280 KB Output is correct
2 Correct 48 ms 10036 KB Output is correct
3 Correct 48 ms 11660 KB Output is correct
4 Correct 44 ms 11668 KB Output is correct
5 Correct 90 ms 15256 KB Output is correct
6 Correct 100 ms 15308 KB Output is correct
7 Correct 95 ms 15300 KB Output is correct
8 Correct 81 ms 12464 KB Output is correct
9 Correct 75 ms 12504 KB Output is correct
10 Correct 107 ms 12596 KB Output is correct
11 Correct 97 ms 14152 KB Output is correct
12 Correct 92 ms 14160 KB Output is correct
13 Correct 96 ms 14424 KB Output is correct
14 Correct 92 ms 15280 KB Output is correct
15 Correct 99 ms 15260 KB Output is correct
16 Correct 96 ms 15228 KB Output is correct
17 Correct 97 ms 15152 KB Output is correct
18 Correct 94 ms 15292 KB Output is correct
19 Correct 103 ms 15320 KB Output is correct
20 Correct 92 ms 14788 KB Output is correct
21 Correct 90 ms 14732 KB Output is correct
22 Correct 94 ms 15216 KB Output is correct
23 Correct 83 ms 14652 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1343 ms 159248 KB Output is correct
2 Correct 1290 ms 158556 KB Output is correct
3 Correct 1357 ms 158760 KB Output is correct
4 Correct 1402 ms 159224 KB Output is correct
5 Correct 1318 ms 158832 KB Output is correct
6 Correct 1572 ms 173992 KB Output is correct
7 Correct 1622 ms 171460 KB Output is correct
8 Correct 1713 ms 172628 KB Output is correct
9 Correct 45 ms 10020 KB Output is correct
10 Correct 1319 ms 157792 KB Output is correct
11 Correct 1210 ms 156124 KB Output is correct
12 Correct 1325 ms 175716 KB Output is correct
13 Correct 1180 ms 102112 KB Output is correct
14 Correct 1024 ms 106616 KB Output is correct
15 Correct 633 ms 72304 KB Output is correct
16 Correct 1106 ms 116748 KB Output is correct
17 Correct 990 ms 106348 KB Output is correct
18 Correct 58 ms 10008 KB Output is correct
19 Correct 1046 ms 114936 KB Output is correct
20 Correct 911 ms 102084 KB Output is correct
21 Correct 819 ms 93800 KB Output is correct
22 Correct 835 ms 105404 KB Output is correct
23 Correct 780 ms 104228 KB Output is correct
24 Correct 643 ms 73076 KB Output is correct
25 Correct 531 ms 62640 KB Output is correct
26 Correct 1338 ms 159416 KB Output is correct
27 Correct 1466 ms 166784 KB Output is correct
28 Correct 1414 ms 158508 KB Output is correct
29 Correct 1142 ms 136372 KB Output is correct
30 Correct 1513 ms 164556 KB Output is correct
31 Correct 1526 ms 165172 KB Output is correct
32 Correct 1564 ms 165208 KB Output is correct
33 Correct 1460 ms 159272 KB Output is correct
34 Correct 1434 ms 160172 KB Output is correct
35 Correct 1455 ms 158536 KB Output is correct
36 Correct 1176 ms 141264 KB Output is correct
37 Correct 1244 ms 141200 KB Output is correct
38 Correct 1211 ms 136656 KB Output is correct
39 Correct 1331 ms 165756 KB Output is correct
40 Correct 1396 ms 165476 KB Output is correct
41 Correct 1321 ms 166472 KB Output is correct
42 Correct 657 ms 75352 KB Output is correct
43 Correct 649 ms 72952 KB Output is correct
44 Correct 610 ms 72596 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7756 KB Output is correct
2 Correct 4 ms 7756 KB Output is correct
3 Correct 16 ms 9712 KB Output is correct
4 Correct 12 ms 8136 KB Output is correct
5 Correct 13 ms 9036 KB Output is correct
6 Correct 12 ms 8908 KB Output is correct
7 Correct 18 ms 8908 KB Output is correct
8 Correct 17 ms 8864 KB Output is correct
9 Correct 19 ms 9420 KB Output is correct
10 Correct 18 ms 8976 KB Output is correct
11 Correct 17 ms 8940 KB Output is correct
12 Correct 20 ms 9108 KB Output is correct
13 Correct 19 ms 9136 KB Output is correct
14 Correct 18 ms 9152 KB Output is correct
15 Correct 19 ms 9016 KB Output is correct
16 Correct 20 ms 9036 KB Output is correct
17 Correct 17 ms 9036 KB Output is correct
18 Correct 1343 ms 159248 KB Output is correct
19 Correct 1290 ms 158556 KB Output is correct
20 Correct 1357 ms 158760 KB Output is correct
21 Correct 1402 ms 159224 KB Output is correct
22 Correct 1318 ms 158832 KB Output is correct
23 Correct 1572 ms 173992 KB Output is correct
24 Correct 1622 ms 171460 KB Output is correct
25 Correct 1713 ms 172628 KB Output is correct
26 Correct 45 ms 10020 KB Output is correct
27 Correct 1319 ms 157792 KB Output is correct
28 Correct 1210 ms 156124 KB Output is correct
29 Correct 1325 ms 175716 KB Output is correct
30 Correct 1180 ms 102112 KB Output is correct
31 Correct 1024 ms 106616 KB Output is correct
32 Correct 633 ms 72304 KB Output is correct
33 Correct 1106 ms 116748 KB Output is correct
34 Correct 990 ms 106348 KB Output is correct
35 Correct 58 ms 10008 KB Output is correct
36 Correct 1046 ms 114936 KB Output is correct
37 Correct 911 ms 102084 KB Output is correct
38 Correct 819 ms 93800 KB Output is correct
39 Correct 835 ms 105404 KB Output is correct
40 Correct 780 ms 104228 KB Output is correct
41 Correct 643 ms 73076 KB Output is correct
42 Correct 531 ms 62640 KB Output is correct
43 Correct 95 ms 15280 KB Output is correct
44 Correct 48 ms 10036 KB Output is correct
45 Correct 48 ms 11660 KB Output is correct
46 Correct 44 ms 11668 KB Output is correct
47 Correct 90 ms 15256 KB Output is correct
48 Correct 100 ms 15308 KB Output is correct
49 Correct 95 ms 15300 KB Output is correct
50 Correct 81 ms 12464 KB Output is correct
51 Correct 75 ms 12504 KB Output is correct
52 Correct 107 ms 12596 KB Output is correct
53 Correct 97 ms 14152 KB Output is correct
54 Correct 92 ms 14160 KB Output is correct
55 Correct 96 ms 14424 KB Output is correct
56 Correct 92 ms 15280 KB Output is correct
57 Correct 99 ms 15260 KB Output is correct
58 Correct 96 ms 15228 KB Output is correct
59 Correct 97 ms 15152 KB Output is correct
60 Correct 94 ms 15292 KB Output is correct
61 Correct 103 ms 15320 KB Output is correct
62 Correct 92 ms 14788 KB Output is correct
63 Correct 90 ms 14732 KB Output is correct
64 Correct 94 ms 15216 KB Output is correct
65 Correct 83 ms 14652 KB Output is correct
66 Correct 1338 ms 159416 KB Output is correct
67 Correct 1466 ms 166784 KB Output is correct
68 Correct 1414 ms 158508 KB Output is correct
69 Correct 1142 ms 136372 KB Output is correct
70 Correct 1513 ms 164556 KB Output is correct
71 Correct 1526 ms 165172 KB Output is correct
72 Correct 1564 ms 165208 KB Output is correct
73 Correct 1460 ms 159272 KB Output is correct
74 Correct 1434 ms 160172 KB Output is correct
75 Correct 1455 ms 158536 KB Output is correct
76 Correct 1176 ms 141264 KB Output is correct
77 Correct 1244 ms 141200 KB Output is correct
78 Correct 1211 ms 136656 KB Output is correct
79 Correct 1331 ms 165756 KB Output is correct
80 Correct 1396 ms 165476 KB Output is correct
81 Correct 1321 ms 166472 KB Output is correct
82 Correct 657 ms 75352 KB Output is correct
83 Correct 649 ms 72952 KB Output is correct
84 Correct 610 ms 72596 KB Output is correct
85 Correct 1834 ms 274500 KB Output is correct
86 Correct 345 ms 82636 KB Output is correct
87 Correct 257 ms 78160 KB Output is correct
88 Correct 1539 ms 257356 KB Output is correct
89 Correct 1833 ms 269860 KB Output is correct
90 Correct 1498 ms 267524 KB Output is correct
91 Correct 1422 ms 159664 KB Output is correct
92 Correct 1437 ms 156832 KB Output is correct
93 Correct 1821 ms 170984 KB Output is correct
94 Correct 1765 ms 240160 KB Output is correct
95 Correct 1771 ms 244576 KB Output is correct
96 Correct 1768 ms 258952 KB Output is correct
97 Correct 1809 ms 321752 KB Output is correct
98 Correct 803 ms 137136 KB Output is correct
99 Correct 1880 ms 271408 KB Output is correct
100 Correct 1848 ms 272504 KB Output is correct
101 Correct 1916 ms 270084 KB Output is correct
102 Correct 1909 ms 272160 KB Output is correct
103 Correct 1800 ms 266620 KB Output is correct
104 Correct 1763 ms 266316 KB Output is correct
105 Correct 962 ms 146148 KB Output is correct
106 Correct 685 ms 111120 KB Output is correct
107 Correct 2023 ms 307248 KB Output is correct
108 Correct 1785 ms 283284 KB Output is correct
109 Correct 1585 ms 264980 KB Output is correct