Submission #958226

#TimeUsernameProblemLanguageResultExecution timeMemory
958226yeediotSynchronization (JOI13_synchronization)C++17
60 / 100
355 ms42836 KiB
#include<bits/stdc++.h> using namespace std; #define int long long #define F first #define S second #define all(x) x.begin(),x.end() #define pii pair<int,int> #define pb push_back #define sz(x) (int)(x.size()) #define chmin(x,y) x=min(x,y) #define chmax(x,y) x=max(x,y) #define vi vector<int> #define vp vector<pii> #define vvi vector<vi> #define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()) #define __lg(x) 63-__builtin_clzll(x) #define pow2(x) (1LL<<x) void __print(int x) {cerr << x;} void __print(float x) {cerr << x;} void __print(double x) {cerr << x;} void __print(long double x) {cerr << x;} void __print(char x) {cerr << '\'' << x << '\'';} void __print(const char *x) {cerr << '\"' << x << '\"';} void __print(const string &x) {cerr << '\"' << x << '\"';} void __print(bool x) {cerr << (x ? "true" : "false");} template<typename T, typename V> void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';} template<typename T> void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";} void _print() {cerr << "]\n";} template <typename T, typename... V> void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);} #ifdef local void setio(){freopen("/Users/iantsai/Library/Mobile Documents/com~apple~CloudDocs/cpp/Empty.md","r",stdin);} #define debug(x...) cerr << "[" << #x << "] = ["; _print(x) #else void setio(){} #define debug(x...) #endif void setIO(string s) { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); } struct line{ int a,b; int operator()(const int x)const{ return a*x+b; } }; bool check(line l1,line l2,line l3){ return (l3.b-l2.b)*(l1.a-l2.a)<=(l2.b-l1.b)*(l2.a-l3.a); } const int mxn=1e5+5; vector<int>adj[mxn]; int dep[mxn]; int in[mxn],out[mxn],timer; int jump[20][mxn]; vector<int>st[mxn]; bool ex[mxn]; void dfs(int v,int pa){ dep[v]=dep[pa]+1; jump[0][v]=pa; st[v].pb(v); in[v]=++timer; for(auto u:adj[v]){ if(u==pa)continue; dfs(u,v); } out[v]=timer; } int n,m,q; void build(){ for(int i=1;i<20;i++){ for(int j=1;j<=n;j++){ jump[i][j]=jump[i-1][jump[i-1][j]]; } } } struct BIT{ int bit[mxn]; void init(){ for(int i=0;i<=n;i++)bit[i]=0; } void modify(int p,int v){ for(;p<=n;p+=p&-p){ bit[p]+=v; } } void modify(int l,int r,int v){ modify(l,v); modify(r+1,-v); } int query(int p){ int res=0; for(;p;p-=p&-p){ res+=bit[p]; } return res; } int query(int l,int r){ return query(r)-query(l); } }; pair<int,int>edge[mxn]; bool used[mxn]; int tag[2][mxn*4]; int seg[2][mxn*4]; void build(int l,int r,int id){ tag[1][id]=-1e18; tag[0][id]=1e18; if(l==r){ seg[0][id]=seg[1][id]=l; return; } int mm=l+r>>1; build(l,mm,id*2); build(mm+1,r,id*2+1); seg[0][id]=min(seg[0][id*2],seg[0][id*2+1]); seg[1][id]=max(seg[1][id*2],seg[1][id*2+1]); } void push(bool f,int id){ if(f){ chmax(seg[f][id*2],tag[f][id]); chmax(seg[f][id*2+1],tag[f][id]); chmax(tag[f][id*2],tag[f][id]); chmax(tag[f][id*2+1],tag[f][id]); } else{ chmin(seg[f][id*2],tag[f][id]); chmin(seg[f][id*2+1],tag[f][id]); chmin(tag[f][id*2],tag[f][id]); chmin(tag[f][id*2+1],tag[f][id]); } } void modify(int l,int r,int id,int ql,int qr,int v,bool f){ if(qr<l or r<ql){ return; } if(ql<=l and r<=qr){ if(f){ chmax(seg[f][id],v); chmax(tag[f][id],v); } else{ chmin(seg[f][id],v); chmin(tag[f][id],v); } return; } int mm=l+r>>1; push(f,id); modify(l,mm,id*2,ql,qr,v,f); modify(mm+1,r,id*2+1,ql,qr,v,f); if(f==0){ seg[f][id]=min(seg[f][id*2],seg[f][id*2+1]); } else{ seg[f][id]=max(seg[f][id*2],seg[f][id*2+1]); } } void modify(int l,int r,int v,bool f){ modify(1,n,1,l,r,v,f); } pii query(int l,int r,int id,int p){ if(l==r){ return make_pair(seg[0][id],seg[1][id]); } int mm=l+r>>1; push(0,id); push(1,id); if(p<=mm){ return query(l,mm,id*2,p); } else{ return query(mm+1,r,id*2+1,p); } } pii query(int p){ return query(1,n,1,p); } signed main(){ setio(); ios::sync_with_stdio(0); cin.tie(0);cout.tie(0); cin>>n>>m>>q; if(q==1){ int l[m],r[m]; for(int i=1;i<n;i++){ int a,b; cin>>a>>b; adj[a].pb(b); adj[b].pb(a); l[i]=a; r[i]=b; } vector<int>op(m); for(int i=0;i<m;i++){ cin>>op[i]; } int root; cin>>root; dfs(root,0); build(); BIT bt; bt.init(); for(auto x:op){ int v=l[x],u=r[x]; if(dep[v]<dep[u]){ swap(v,u); } if(ex[x]==1){ bt.modify(in[v],out[v],-1); ex[x]=0; } else{ bt.modify(in[v],out[v],1); ex[x]=1; int d=v; for(int i=19;i>=0;i--){ int D=jump[i][d]; if(bt.query(in[D],in[d])==(1<<i)){ d=D; } } if(sz(st[v])>sz(st[d]))swap(st[v],st[d]); st[d].insert(st[d].end(),all(st[v])); st[v].clear(); } } cout<<sz(st[root])<<'\n'; } else{ set<pii>st; for(int i=1;i<n;i++){ st.insert({i,i}); cin>>edge[i].F>>edge[i].S; } st.insert({n,n}); build(1,n,1); for(int i=0;i<m;i++){ int x; cin>>x; auto [l,r]=edge[x]; if(used[x]){ auto it=prev(st.lower_bound(make_pair(r+1,0))); auto [L,R]=*it; st.erase(it); st.insert({L,l}); st.insert({r,R}); } else{ auto it2=st.lower_bound(make_pair(l+1,0)); auto it=prev(it2); int v=query(it2->S).S; modify(it->F,it->S,v,1); v=query(it->F).F; modify(it2->F,it2->S,v,0); int L=it->F; int R=it2->S; st.erase(it); st.erase(it2); st.insert({L,R}); } used[x]=!used[x]; debug(l,r,st); } while(q--){ int x; cin>>x; auto [l,r]=query(x); cout<<r-l+1<<'\n'; } } } /* input: */

Compilation message (stderr)

synchronization.cpp: In function 'void build(long long int, long long int, long long int)':
synchronization.cpp:116:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  116 |     int mm=l+r>>1;
      |            ~^~
synchronization.cpp: In function 'void modify(long long int, long long int, long long int, long long int, long long int, long long int, bool)':
synchronization.cpp:151:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  151 |     int mm=l+r>>1;
      |            ~^~
synchronization.cpp: In function 'std::pair<long long int, long long int> query(long long int, long long int, long long int, long long int)':
synchronization.cpp:169:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  169 |     int mm=l+r>>1;
      |            ~^~
synchronization.cpp: In function 'void setIO(std::string)':
synchronization.cpp:42:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
synchronization.cpp:43:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#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...