Submission #1088340

#TimeUsernameProblemLanguageResultExecution timeMemory
1088340modwweSwapping Cities (APIO20_swap)C++17
6 / 100
162 ms33720 KiB
#pragma GCC optimize("Ofast,unroll-loops") #include<bits/stdc++.h> //#define int long long //#define ll long long #define down cout<<'\n'; #define debug cout<<" cucuucucuuu",down #define NHP ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0); #define modwwe int t;cin>>t; while(t--) #define bit(i,j) (i>>j&1) #define sobit(a) __builtin_popcountll(a) #define task "test" #define fin(x) freopen(x".inp","r",stdin) #define fou(x) freopen(x".ans","w",stdout) #define pb push_back #define checktime cerr << (double)clock() / CLOCKS_PER_SEC * 1000 << " ms"; using namespace std; #define getchar_unlocked getchar inline int scan() { char c = getchar_unlocked(); int x = 0; while(c<'0'||c>'9') { c=getchar_unlocked(); } while(c>='0'&&c<='9') { x=(x<<1)+(x<<3)+c-'0'; c=getchar_unlocked(); } return x; } void phongbeo(); const int inf=1e9+1; const int mod2=1e9+9; const int mod1=998244353; struct icd { long double a; int b; }; struct ib { int a; int b; }; struct ic { int a,b,c; }; struct id { int a,b,c,d; }; struct ie { int a,b,c,d,e; }; int n,m,s1,s2,s4,s3,sf,k,s5,s6,mx,s7,s8,s9,mx2,res,dem2=0,dem=0,s33,dem3,dem4,l,r,mid,l2,r2,center; int i,s10,s12; int kk; int el=29; bool cmp(ic a,ic b) { return a.c<b.c; } struct dsu { ib dsu[100001]; void reset(int x) { dsu[x]= {1,x}; } int get(int x) { if(dsu[x].b!=x) dsu[x].b=get(dsu[x].b); return dsu[x].b; } void noi(int x,int y) { if(dsu[x].a<dsu[y].a) swap(x,y); dsu[x].a+=dsu[y].a; dsu[y].b=x; } } ds; ic a[200001]; bool b[200001]; int st[17][100001]; int st2[17][100001]; int depth[100001]; vector<ib> v[100001]; void dfs(int x,int y) { st[0][x]=y; depth[x]=depth[y]+1; for(auto f:v[x]) if(f.a!=y) { st2[0][f.a]=f.b,dfs(f.a,x); } } int lca(int x,int y) { if(depth[x]<depth[y]) swap(x,y); int ss=depth[x]-depth[y]; int s=0; for(int j=0; j<17; ++j) if(bit(ss,j)) s=max(s,st2[j][x]), x=st[j][x]; if(x==y) return s; for(int j=16; j>=0; --j) if(st[j][x]!=st[j][y]) s=max({st2[j][x],st2[j][y],s}),x=st[j][x],y=st[j][y]; s=max(s,st2[0][x]); s=max(s,st2[0][y]); return s; } void init(int N, int M, std::vector<int> U, std::vector<int> V, std::vector<int> W) { n=N; m=M; for(int i=1; i<=m; i++) a[i].a=U[i-1],a[i].b=V[i-1],a[i].c=W[i-1],a[i].a++,a[i].b++; for(int i=1; i<=n; i++) ds.reset(i); sort(a+1,a+1+m,cmp); bool de=0; s5=inf; for(int i=1; i<=m; i++) { s2=ds.get(a[i].a); s3=ds.get(a[i].b); if(s2!=s3) { v[a[i].a].pb({a[i].b,a[i].c}); v[a[i].b].pb({a[i].a,a[i].c}); ds.noi(s2,s3); } else b[i]=1; } dfs(1,0); for(int i=1;i<=m;i++) if(b[i]) if(st[0][a[i].a]!=a[i].b&&st[0][a[i].b]!=a[i].a) { s5=a[i].c; break; } for(int i=1; i<17; i++) for(int j=1; j<=n; j++) st[i][j]=st[i-1][st[i-1][j]], st2[i][j]=max(st2[i-1][j],st2[i-1][st[i-1][j]]); } int getMinimumFuelCapacity(int l, int r) { l++; r++; if(s5==inf) return -1; else return max(s5,lca(l,r)); } /* main() { freopen("test.inp","r",stdin); freopen("test.out","w",stdout); cin>>n>>m ; vector<int> a1,a2,a3; for(int i=1;i<=m;i++) { int x,y,z; cin>>x>>y>>z; a1.pb(x); a2.pb(y); a3.pb(z); } init(n,m,a1,a2,a3); cin>>m; while(m--) { int x,y; cin>>x>>y; cout<<getMinimumFuelCapacity(l,r)<<"\n"; } }*/

Compilation message (stderr)

swap.cpp: In function 'void init(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
swap.cpp:133:10: warning: unused variable 'de' [-Wunused-variable]
  133 |     bool de=0;
      |          ^~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...