More DMOJ Solutions

Author: IvanIsCoding

DMOJ/aplusb2.cpp

@@ -0,0 +1,108 @@
+#include <bits/stdc++.h>
+using namespace std;
+const int MAXN = 1e5 + 10;
+typedef vector<int> vi;
+char entrada1[MAXN],entrada2[MAXN];
+vi soma(vi A,vi B){
+	while(A.size() < B.size()) A.push_back(0);
+	while(B.size() < A.size()) B.push_back(0);
+	vi C;
+	C.assign(A.size() + 5,0);
+	for(int i = 0;i<A.size();i++){
+		C[i] += A[i] + B[i];
+	}
+	for(int i = 0;i<C.size();i++){
+		int t_val = C[i] % 10;
+		int passa = (C[i] - t_val)/10;
+		if(i + 1 < C.size()){
+			C[i] = t_val;
+			C[i+1] += passa;
+		}
+	}
+	while(!C.empty() && C.back() == 0) C.pop_back();
+	if(C.empty()) C.push_back(0);
+	return C;
+}
+vi subtrai(vi A,vi B){
+	while(A.size() < B.size()) A.push_back(0);
+	while(B.size() < A.size()) B.push_back(0);
+	vi C;
+	C.assign(A.size() + 5,0);
+	for(int i = 0;i<A.size();i++){
+		C[i] += A[i] - B[i];
+		if(C[i] < 0){
+			C[i] += 10;
+			C[i+1] -= 1;
+		}
+	}
+	for(int i = 0;i<C.size();i++){
+		int t_val = C[i] % 10;
+		int passa = (C[i] - t_val)/10;
+		if(i + 1 < C.size()){
+			C[i] = t_val;
+			C[i+1] += passa;
+		}
+	}
+	while(!C.empty() && C.back() == 0) C.pop_back();
+	if(C.empty()) C.push_back(0);
+	return C;
+}
+int main(){
+	int TC;
+	scanf("%d",&TC);
+	while(TC--){
+		scanf("%s %s",entrada1,entrada2);
+		string s1 = entrada1, s2 = entrada2;
+		int flag1 = (s1[0] == '-'), flag2 = (s2[0] == '-');
+		vi A,B;
+		for(int i =0;i<s1.size();i++){
+			if(s1[i] == '-') continue;
+			A.push_back(s1[i] - '0');
+		}
+		for(int i =0;i<s2.size();i++){
+			if(s2[i] == '-') continue;
+			B.push_back(s2[i] - '0');
+		}
+		reverse(A.begin(),A.end());
+		while(!A.empty() && A.back() == 0) A.pop_back();
+		if(A.empty()) A.push_back(0);
+		reverse(B.begin(),B.end());
+		while(!B.empty() && B.back() == 0) B.pop_back();
+		if(B.empty()) B.push_back(0);
+		reverse(A.begin(),A.end());
+		reverse(B.begin(),B.end());
+		if(B.size() > A.size() || (B.size() == A.size() && B > A)){
+			swap(A,B);
+			swap(flag1,flag2);
+		}
+		reverse(A.begin(),A.end());
+		reverse(B.begin(),B.end());
+		if(flag1 == 0 && flag2 == 0){
+			vi C = soma(A,B);
+			reverse(C.begin(),C.end());
+			for(int i = 0;i<C.size();i++) printf("%d",C[i]);
+			printf("\n");
+		}
+		else if(flag1 == 0 && flag2 == 1){
+			vi C = subtrai(A,B);
+			reverse(C.begin(),C.end());
+			for(int i = 0;i<C.size();i++) printf("%d",C[i]);
+			printf("\n");
+		}
+		else if(flag1 == 1 && flag2 == 0){
+			vi C = subtrai(A,B);
+			reverse(C.begin(),C.end());
+			if(C[0] != 0) printf("-");
+			for(int i = 0;i<C.size();i++) printf("%d",C[i]);
+			printf("\n");
+		}
+		else{
+			vi C = soma(A,B);
+			reverse(C.begin(),C.end());
+			if(C[0] != 0) printf("-");
+			for(int i = 0;i<C.size();i++) printf("%d",C[i]);
+			printf("\n");
+		}
+	}
+	return 0;
+}

DMOJ/ccc14s5.cpp

@@ -0,0 +1,70 @@
+#include <bits/stdc++.h>
+#define LSOne(S) (S & (-S))
+using namespace std;
+const int MAXN = 2010;
+typedef pair<short,short> ii;
+typedef tuple<int,short,short> trinca;
+struct node{
+	int tamanho;
+	vector<short> bit;
+	void update(int idx,short val){
+		while(idx <= tamanho){
+			bit[idx] = max(bit[idx],val);
+			idx += LSOne(idx);
+		}
+	}
+	int query(int idx){
+		short ans = 0;
+		while(idx > 0){
+			ans = max(ans,bit[idx]);
+			idx -= LSOne(idx);
+		}
+		return ans;
+	}
+};
+vector<trinca> ordenado;
+vector<int> comp[MAXN];
+ii pontos[MAXN];
+node raiz[MAXN];
+int modulo[MAXN],n;
+inline int abs(ii davez){
+	return int(davez.first)*int(davez.first) + int(davez.second)*int(davez.second);
+}
+inline int hypot(ii A,ii B){
+	return abs(ii(A.first - B.first,A.second - B.second));
+}
+inline int get_v(int i,int val){
+	return prev(upper_bound(comp[i].begin(),comp[i].end(),val)) - comp[i].begin() + 1;
+}
+int main(){
+	scanf("%d",&n);
+	for(int i = 1;i<=n;i++){
+		scanf("%hd %hd",&pontos[i].first,&pontos[i].second);
+		modulo[i] = abs(pontos[i]);
+		comp[i].push_back(0);
+		comp[i].push_back(modulo[i]);
+		for(int j = 1;j<i;j++){
+			int dist = hypot(pontos[i],pontos[j]);
+			ordenado.push_back(make_tuple(dist,i,j));
+			comp[i].push_back(dist);
+			comp[j].push_back(dist);
+		}
+	}
+	sort(ordenado.begin(),ordenado.end());
+	for(int i = 1;i<=n;i++){
+		sort(comp[i].begin(),comp[i].end());
+		comp[i].erase(unique(comp[i].begin(),comp[i].end()),comp[i].end());
+		raiz[i].tamanho = (int)comp[i].size();
+		raiz[i].bit.assign(raiz[i].tamanho+3,0);
+		raiz[i].update(1,1);
+	}
+	for(int idx = 0;idx<ordenado.size();idx++){
+		int dist = get<0>(ordenado[idx]),u = get<1>(ordenado[idx]),v = get<2>(ordenado[idx]);
+		raiz[u].update(get_v(u,dist), raiz[v].query(get_v(v,dist-1)) + 1);
+		raiz[v].update(get_v(v,dist), raiz[u].query(get_v(u,dist-1)) + 1);
+	}
+	int resp = raiz[1].query(get_v(1,modulo[1]-1));
+	for(int i = 2;i<=n;i++) resp = max(resp, raiz[i].query(get_v(i,modulo[i]-1)));
+	printf("%d\n",resp);
+	return 0;
+}

DMOJ/ccc18s4.cpp

@@ -0,0 +1,32 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+typedef long long ll;
+const int MAXN = 1e6 + 10;
+
+ll dp[MAXN];
+unordered_map<int,ll> tab;
+
+ll solve(int n){
+	if(n < MAXN && dp[n] != -1) return dp[n];
+	else if(n >= MAXN && tab.count(n)) return tab[n];
+	ll tot = 0;
+	ll i = 2;
+	while(i <= n){
+		ll q = n/i;
+		ll j = n/q;
+		tot += (j - i + 1)*solve(q);
+		i = j + 1;
+	}
+	if(n < MAXN) return dp[n] = tot;
+	else return tab[n] = tot;
+}
+
+int main(){
+	memset(dp,-1,sizeof(dp));
+	dp[1] = 1;dp[0] = 0;
+	int N;
+	cin >> N;
+	cout << solve(N) << endl;
+	return 0;
+}

DMOJ/cco05p5.cpp

@@ -0,0 +1,32 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+const int MAXN = 20100;
+
+
+int dp[MAXN][2],P[MAXN][2],N;
+
+int dist(int A,int B){
+	return max(A-B,B-A);
+}
+
+int solve(int atual,int lado){
+	if(atual == N + 2) return 0;
+	if(dp[atual][lado] != -1) return dp[atual][lado];
+	int pos = P[atual-1][lado];
+	int v1 = solve(atual+1,1) + dist(pos,P[atual][0]) + dist(P[atual][0],P[atual][1]);
+	int v2 = solve(atual+1,0) + dist(pos,P[atual][1]) + dist(P[atual][1],P[atual][0]);
+	return dp[atual][lado] = min(v1,v2);
+}
+
+int main(){
+	while(scanf("%d",&N) != EOF){
+		if(N == 0) break;
+		memset(dp,-1,sizeof(dp));
+		for(int i = 1;i<=N;i++) scanf("%d %d",&P[i][0],&P[i][1]);
+		P[0][0] = P[0][1] = 1;
+		P[N+1][0] = P[N+1][1] = N;
+		printf("%d\n",solve(1,0) + N-1);
+	}
+	return 0;
+}