change indentation from 4 to 2

Author: srmacario

data-structures/bit.cpp

@@ -2,11 +2,11 @@
 ll bit[N];
 
 void add(int p, int v) {
-  for (p += 2; p < N; p += p & -p) bit[p] += v;
+	for (p += 2; p < N; p += p & -p) bit[p] += v;
 }
 
 ll query(int p) {
-  ll r = 0;
-  for (p += 2; p; p -= p & -p) r += bit[p];
-  return r;
+	ll r = 0;
+	for (p += 2; p; p -= p & -p) r += bit[p];
+	return r;
 }

data-structures/bit_binary_search.cpp

@@ -1,14 +1,14 @@
 // --- Bit Binary Search in o(log(n)) ---
 const int M = 20
 const int N = 1 << M
-  
+	
 int lower_bound(int val){
-  int ans = 0, sum = 0;
-  for(int i = M - 1; i >= 0; i--){
-    int x = ans + (1 << i);
-    if(sum + bit[x] < val) 
-      ans = x, sum += bit[x];
-  }
+	int ans = 0, sum = 0;
+	for(int i = M - 1; i >= 0; i--){
+		int x = ans + (1 << i);
+		if(sum + bit[x] < val) 
+			ans = x, sum += bit[x];
+	}
 
-  return ans + 1;
+	return ans + 1;
 }

data-structures/bit_range.cpp

@@ -1,23 +1,23 @@
 struct BIT {
-  ll b[N]={};
-  ll sum(int x) {
-    ll r=0;
-    for(x+=2;x;x-=x&-x)
-      r += b[x];
-    return r;
-  }
-  void upd(int x, ll v) {
-    for(x+=2;x<N;x+=x&-x)
-      b[x]+=v;
-  }
+	ll b[N]={};
+	ll sum(int x) {
+		ll r=0;
+		for(x+=2;x;x-=x&-x)
+			r += b[x];
+		return r;
+	}
+	void upd(int x, ll v) {
+		for(x+=2;x<N;x+=x&-x)
+			b[x]+=v;
+	}
 };
 struct BITRange {
-  BIT a,b;
-  ll sum(int x) {
-    return a.sum(x)*x+b.sum(x);
-  }
-  void upd(int l, int r, ll v) {
-    a.upd(l,v), a.upd(r+1,-v);
-    b.upd(l,-v*(l-1)), b.upd(r+1,v*r);
-  }
+	BIT a,b;
+	ll sum(int x) {
+		return a.sum(x)*x+b.sum(x);
+	}
+	void upd(int l, int r, ll v) {
+		a.upd(l,v), a.upd(r+1,-v);
+		b.upd(l,-v*(l-1)), b.upd(r+1,v*r);
+	}
 };

data-structures/centroid_decomposition.cpp

@@ -6,44 +6,44 @@ int n, m;
 unordered_map<int, int> dist[N];
 
 void dfs(int u, int p) {
-  sz[u] = 1;
-  for(int v : adj[u]) {
-    if(v != p and !forb[v]) {
-      dfs(v, u);
-      sz[u] += sz[v];
-    }
-  }
+	sz[u] = 1;
+	for(int v : adj[u]) {
+		if(v != p and !forb[v]) {
+			dfs(v, u);
+			sz[u] += sz[v];
+		}
+	}
 }
 
 int find_cen(int u, int p, int qt) {
-  for(int v : adj[u]) {
-    if(v == p or forb[v]) continue;
-    if(sz[v] > qt / 2) return find_cen(v, u, qt);
-  }
-  return u;
+	for(int v : adj[u]) {
+		if(v == p or forb[v]) continue;
+		if(sz[v] > qt / 2) return find_cen(v, u, qt);
+	}
+	return u;
 }
 
 void getdist(int u, int p, int cen) {
-  for(int v : adj[u]) {
-    if(v != p and !forb[v]) {
-      dist[cen][v] = dist[v][cen] = dist[cen][u] + 1;
-      getdist(v, u, cen);
-    }
-  }
+	for(int v : adj[u]) {
+		if(v != p and !forb[v]) {
+			dist[cen][v] = dist[v][cen] = dist[cen][u] + 1;
+			getdist(v, u, cen);
+		}
+	}
 }
 
 
 void decomp(int u, int p) {
-  dfs(u, -1);
+	dfs(u, -1);
 
-  int cen = find_cen(u, -1, sz[u]);
-  forb[cen] = 1;
-  par[cen] = p;
-  dist[cen][cen] = 0;
-  getdist(cen, -1, cen);
+	int cen = find_cen(u, -1, sz[u]);
+	forb[cen] = 1;
+	par[cen] = p;
+	dist[cen][cen] = 0;
+	getdist(cen, -1, cen);
 
-  for(int v : adj[cen]) if(!forb[v])
-    decomp(v, cen);
+	for(int v : adj[cen]) if(!forb[v])
+		decomp(v, cen);
 }
 
 // main

data-structures/color_update.cpp

@@ -3,33 +3,33 @@
 // q -> number of inserts
 
 struct ColorUpdate {
-  struct Seg {
-    int l, r, c;
-    Seg(int _l = 0, int _r = 0, int _c = 0) : l(_l), r(_r), c(_c) {};
-    bool operator<(const Seg& b) const { return l < b.l; }
-  };
+	struct Seg {
+		int l, r, c;
+		Seg(int _l = 0, int _r = 0, int _c = 0) : l(_l), r(_r), c(_c) {};
+		bool operator<(const Seg& b) const { return l < b.l; }
+	};
 
-  set<Seg> segs;
+	set<Seg> segs;
 
-  void cut(int x) {
-    auto it = segs.lower_bound({ x, 0, 0 });
-    if (it == segs.begin()) return;
-    it--;
-    if (it->r == x - 1) return;
-    Seg s = *it;
-    segs.erase(it);
-    segs.insert(Seg(s.l, x - 1, s.c));
-    segs.insert(Seg(x, s.r, s.c));
-  }
+	void cut(int x) {
+		auto it = segs.lower_bound({ x, 0, 0 });
+		if (it == segs.begin()) return;
+		it--;
+		if (it->r == x - 1) return;
+		Seg s = *it;
+		segs.erase(it);
+		segs.insert(Seg(s.l, x - 1, s.c));
+		segs.insert(Seg(x, s.r, s.c));
+	}
 
-  void add(int l, int r, int c) {
-    cut(l), cut(r + 1);
-    Seg s(l, r, c);
-    auto it = segs.lower_bound(s);
-    while (it != segs.end() and it->l <= s.r) {
-      auto it2 = it++;
-      segs.erase(it2);
-    }
-    segs.insert(s);
-  }
+	void add(int l, int r, int c) {
+		cut(l), cut(r + 1);
+		Seg s(l, r, c);
+		auto it = segs.lower_bound(s);
+		while (it != segs.end() and it->l <= s.r) {
+			auto it2 = it++;
+			segs.erase(it2);
+		}
+		segs.insert(s);
+	}
 };

data-structures/hld-lamarca.cpp

@@ -8,48 +8,48 @@ typedef long long ll;
 template<int N> struct Seg{
 ll s[4*N], lazy[4*N];
 void build(int no = 1, int l = 0, int r = N){
-    if(r-l==1){
-        s[no] = 0;
-        return;
-    }
-    int mid = (l+r)/2;
-    build(2*no,l,mid);
-    build(2*no+1,mid,r);
-    s[no] = max(s[2*no],s[2*no+1]);
+		if(r-l==1){
+				s[no] = 0;
+				return;
+		}
+		int mid = (l+r)/2;
+		build(2*no,l,mid);
+		build(2*no+1,mid,r);
+		s[no] = max(s[2*no],s[2*no+1]);
 }
 Seg(){ //build da HLD tem de ser assim, pq chama sem os parametros
 	build();
 }
 void updlazy(int no, int l, int r, ll x){
-    s[no] += x;
-    lazy[no] += x;
+		s[no] += x;
+		lazy[no] += x;
 }
 void pass(int no, int l, int r){
-    int mid = (l+r)/2;
-    updlazy(2*no,l,mid,lazy[no]);
-    updlazy(2*no+1,mid,r,lazy[no]);
-    lazy[no] = 0;
+		int mid = (l+r)/2;
+		updlazy(2*no,l,mid,lazy[no]);
+		updlazy(2*no+1,mid,r,lazy[no]);
+		lazy[no] = 0;
 }
 void upd(int lup, int rup, ll x, int no = 1, int l = 0, int r = N){
-    if(rup<=l or r<=lup) return;
-    if(lup<=l and r<=rup){
-        updlazy(no,l,r,x);
-        return;
-    }   
-    pass(no,l,r);
-    int mid = (l+r)/2;
-    upd(lup,rup,x,2*no,l,mid);
-    upd(lup,rup,x,2*no+1,mid,r);
-    s[no] = max(s[2*no],s[2*no+1]);
+		if(rup<=l or r<=lup) return;
+		if(lup<=l and r<=rup){
+				updlazy(no,l,r,x);
+				return;
+		}   
+		pass(no,l,r);
+		int mid = (l+r)/2;
+		upd(lup,rup,x,2*no,l,mid);
+		upd(lup,rup,x,2*no+1,mid,r);
+		s[no] = max(s[2*no],s[2*no+1]);
 }
 ll qry(int lq, int rq, int no = 1, int l = 0, int r = N){
-    if(rq<=l or r<=lq) return -LLONG_MAX;
-    if(lq<=l and r<=rq){
-        return s[no];
-    } 
-    pass(no,l,r);
-    int mid = (l+r)/2;
-    return max(qry(lq,rq,2*no,l,mid),qry(lq,rq,2*no+1,mid,r));
+		if(rq<=l or r<=lq) return -LLONG_MAX;
+		if(lq<=l and r<=rq){
+				return s[no];
+		} 
+		pass(no,l,r);
+		int mid = (l+r)/2;
+		return max(qry(lq,rq,2*no,l,mid),qry(lq,rq,2*no+1,mid,r));
 }
 };
 

data-structures/hld.cpp

@@ -6,53 +6,53 @@ int chainno, chain[N], head[N], chainpos[N], chainsz[N], pos[N], arrsz;
 int sc[N], sz[N];
 
 void dfs(int u) {
-  sz[u] = 1, sc[u] = 0; // nodes 1-indexed (0-ind: sc[u]=-1)
-  for (int v : adj[u]) if (v != par[u]) {
-    par[v] = u, h[v] = h[u]+1, dfs(v);
-    sz[u]+=sz[v];
-    if (sz[sc[u]] < sz[v]) sc[u] = v; // 1-indexed (0-ind: sc[u]<0 or ...)
-  }
+	sz[u] = 1, sc[u] = 0; // nodes 1-indexed (0-ind: sc[u]=-1)
+	for (int v : adj[u]) if (v != par[u]) {
+		par[v] = u, h[v] = h[u]+1, dfs(v);
+		sz[u]+=sz[v];
+		if (sz[sc[u]] < sz[v]) sc[u] = v; // 1-indexed (0-ind: sc[u]<0 or ...)
+	}
 }
 
 void hld(int u) {
-  if (!head[chainno]) head[chainno] = u; // 1-indexed
-  chain[u] = chainno;
-  chainpos[u] = chainsz[chainno];
-  chainsz[chainno]++;
-  pos[u] = ++arrsz;
+	if (!head[chainno]) head[chainno] = u; // 1-indexed
+	chain[u] = chainno;
+	chainpos[u] = chainsz[chainno];
+	chainsz[chainno]++;
+	pos[u] = ++arrsz;
 
-  if (sc[u]) hld(sc[u]);
+	if (sc[u]) hld(sc[u]);
 
-  for (int v : adj[u]) if (v != par[u] and v != sc[u])
-    chainno++, hld(v);
+	for (int v : adj[u]) if (v != par[u] and v != sc[u])
+		chainno++, hld(v);
 }
 
 int lca(int u, int v) {
-  while (chain[u] != chain[v]) {
-    if (h[head[chain[u]]] < h[head[chain[v]]]) swap(u, v);
-    u = par[head[chain[u]]];
-  }
-  if (h[u] > h[v]) swap(u, v);
-  return u;
+	while (chain[u] != chain[v]) {
+		if (h[head[chain[u]]] < h[head[chain[v]]]) swap(u, v);
+		u = par[head[chain[u]]];
+	}
+	if (h[u] > h[v]) swap(u, v);
+	return u;
 }
 
 int query_up(int u, int v) {
-  if (u == v) return 0;
-  int ans = -1;
-  while (1) {
-    if (chain[u] == chain[v]) {
-      if (u == v) break;
-      ans = max(ans, query(1, 1, n, chainpos[v]+1, chainpos[u]));
-      break;
-    }
-
-    ans = max(ans, query(1, 1, n, chainpos[head[chain[u]]], chainpos[u]));
-    u = par[head[chain[u]]];
-  }
-  return ans;
+	if (u == v) return 0;
+	int ans = -1;
+	while (1) {
+		if (chain[u] == chain[v]) {
+			if (u == v) break;
+			ans = max(ans, query(1, 1, n, chainpos[v]+1, chainpos[u]));
+			break;
+		}
+
+		ans = max(ans, query(1, 1, n, chainpos[head[chain[u]]], chainpos[u]));
+		u = par[head[chain[u]]];
+	}
+	return ans;
 }
 
 int query(int u, int v) {
-  int l = lca(u, v);
-  return max(query_up(u, l), query_up(v, l));
+	int l = lca(u, v);
+	return max(query_up(u, l), query_up(v, l));
 }