COCI + Dynamic Programming

Author: IvanIsCoding

DMOJ/coci06c3p2.py

@@ -0,0 +1,23 @@
+# Ivan Carvalho
+# Solution to https://dmoj.ca/problem/coci06c3p2
+
+def abs_pares(a,b):
+	return abs(a[0] - b[0]) + abs(a[1] - b[1])
+
+dicio = {
+	"A" : (0,0), "B" : (0,1), "C" : (0,2), "D" : (0,3),
+	"E" : (1,0), "F" : (1,1), "G" : (1,2), "H" : (1,3),
+	"I" : (2,0), "J" : (2,1), "K" : (2,2), "L" : (2,3),
+	"M" : (3,0), "N" : (3,1), "O" : (3,2), "." : (3,3)
+}
+
+ans = 0
+
+for i in range(4):
+	entrada = input()
+	for j,c in enumerate(entrada):
+		if c == ".":
+			continue
+		ans += abs_pares((i,j), dicio[c])
+
+print(ans)

DMOJ/coci08c2p4.cpp

@@ -0,0 +1,89 @@
+// Ivan Carvalho
+// Solution to https://dmoj.ca/problem/coci08c2p4
+#include <bits/stdc++.h>
+using namespace std;
+
+typedef long long ll;
+
+const ll INF = 2*1e9;
+
+ll calcula(ll X,vector<ll> A,vector<ll> B){
+
+	ll tot = 0;
+	for(int i = 0;i<A.size();i++){
+		if(A[i] > X) continue;
+		tot++;
+		tot += (X - A[i])/B[i];
+	}
+
+	return tot;
+
+}
+
+ll calcula_tempo(ll coco, vector<ll> A,vector<ll> B){
+
+	ll ini = 1,fim = INF,meio,resp = INF;
+	while(ini <= fim){
+		meio = (ini+fim)/2;
+		ll cand = calcula(meio,A,B);
+		if(cand >= coco){
+			resp = meio;
+			fim = meio - 1;
+		}
+		else{
+			ini = meio + 1;
+		}
+	}
+
+	return resp;
+
+}
+
+ll checa(ll X,ll T,vector<ll> A,vector<ll> B, vector<ll> C,vector <ll> D){
+
+	ll coco = calcula(X,A,B);
+	ll tempo_abrir = calcula_tempo(coco,C,D); 
+
+	return X + tempo_abrir >= T;
+
+}
+
+int main(){
+
+	ll T;
+	int N,M;
+	vector<ll> A,B,C,D;
+
+	cin >> T;
+	cin >> N;
+	for(int i = 0;i<N;i++){
+		ll x,y;
+		cin >> x >> y;
+		A.push_back(x);
+		B.push_back(y);
+	}
+	cin >> M;
+	for(int i = 0;i<M;i++){
+		ll x,y;
+		cin >> x >> y;
+		C.push_back(x);
+		D.push_back(y);
+	}
+
+	ll ini = 1,fim = T, resp = T,meio;
+	while(ini <= fim){
+		meio = (ini+fim)/2;
+		if(checa(meio,T,A,B,C,D)){
+			resp = meio;
+			fim = meio - 1;
+		}
+		else{
+			ini = meio + 1;
+		}
+	}
+
+	cout << resp << endl;
+
+	return 0;
+
+}

DMOJ/coci14c2p1.py

@@ -0,0 +1,30 @@
+# Ivan Carvalho
+# Solution to https://dmoj.ca/problem/coci14c2p1
+
+def getgrupo(val,lista):
+	for i,sublista in enumerate(lista):
+		if val in sublista:
+			return i
+	return -1
+
+grupos = [[],["a","b","c"],
+	["d","e","f"], ["g","h","i"],
+	["j","k","l"], ["m","n","o"],
+	["p","q","r","s"],["t","u","v"],
+	["w","x","y","z"]
+]
+
+resposta = []
+permutacao = [int(i) for i in input().split()]
+entrada = input()
+
+for i in range(len(entrada)):
+
+	if i >= 1 and getgrupo(entrada[i],grupos) == getgrupo(entrada[i-1],grupos):
+		resposta.append("#")
+
+	qual = getgrupo(entrada[i],grupos)
+	qtd = grupos[qual].index(entrada[i]) + 1
+	resposta.extend([str(permutacao.index(qual+1)+1)]*qtd)
+
+print("".join(resposta))

DMOJ/coci14c5p4.py

@@ -0,0 +1,64 @@
+# Ivan Carvalho
+# Solution to https://dmoj.ca/problem/coci14c5p4
+
+N = [int(i) for i in input()]
+
+primeiro = -1
+
+for i in range(len(N)):
+	if i == 0:
+		continue
+	if N[i] % 2 == N[i-1] % 2:
+		primeiro = i
+		break
+
+if N[primeiro] == 0:
+	N[primeiro] = 1
+	for i in range(primeiro+1,len(N),2):
+		N[i] = 0
+		if i + 1 < len(N):
+			N[i+1] = 1
+	print("".join([str(i) for i in N]))
+elif N[primeiro] == 9:
+	N[primeiro] = 8
+	for i in range(primeiro+1,len(N),2):
+		N[i] = 9
+		if i + 1 < len(N):
+			N[i+1] = 8
+	print("".join([str(i) for i in N]))
+else:
+	
+	copia1 = [i for i in N]
+	copia2 = [i for i in N]
+	
+	copia1[primeiro] -= 1
+	if copia1[primeiro] % 2 == 0:
+		vainolugar = [9,8]
+	else:
+		vainolugar = [8,9]
+	for i in range(primeiro+1,len(N),2):
+		copia1[i] = vainolugar[0]
+		if i + 1 < len(N):
+			copia1[i+1] = vainolugar[1]
+	inteiro1 = int("".join([str(i) for i in copia1]))
+
+	copia2[primeiro] += 1
+	if copia1[primeiro] % 2 == 0:
+		vainolugar = [1,0]
+	else:
+		vainolugar = [0,1]
+	for i in range(primeiro+1,len(N),2):
+		copia2[i] = vainolugar[0]
+		if i + 1 < len(N):
+			copia2[i+1] = vainolugar[1]
+
+	inteiro2 = int("".join([str(i) for i in copia2]))
+
+	original = int("".join([str(i) for i in N]))
+	
+	if inteiro2 - original == original - inteiro1:
+		print("%d %d" % (inteiro1,inteiro2))
+	elif inteiro2 - original < original - inteiro1:
+		print(inteiro2)
+	else:
+		print(inteiro1)

DMOJ/dp_a.cpp

@@ -0,0 +1,30 @@
+// Ivan Carvalho
+// Solution to https://dmoj.ca/problem/dp_a
+#include <bits/stdc++.h>
+using namespace std;
+
+const int MAXN = 1e5 + 10;
+const int INF = 2*1e9;
+
+int dp[MAXN],N,K,h[MAXN];
+
+int main(){
+
+	scanf("%d",&N);
+	K = 2;
+	for(int i = 1;i<=N;i++){
+		scanf("%d",&h[i]);
+	}
+
+	for(int i = 2;i<=N;i++){
+		dp[i] = INF;
+		for(int j = i-1;j>=max(i - K,1);j--){
+			dp[i] = min(dp[i], dp[j] + abs(h[i] - h[j]) );
+		}
+	}
+
+	printf("%d\n",dp[N]);
+
+	return 0;
+
+}

DMOJ/dp_b.cpp

@@ -0,0 +1,29 @@
+// Ivan Carvalho
+// Solution to https://dmoj.ca/problem/dp_b
+#include <bits/stdc++.h>
+using namespace std;
+
+const int MAXN = 1e5 + 10;
+const int INF = 2*1e9;
+
+int dp[MAXN],N,K,h[MAXN];
+
+int main(){
+
+	scanf("%d %d",&N,&K);
+	for(int i = 1;i<=N;i++){
+		scanf("%d",&h[i]);
+	}
+
+	for(int i = 2;i<=N;i++){
+		dp[i] = INF;
+		for(int j = i-1;j>=max(i - K,1);j--){
+			dp[i] = min(dp[i], dp[j] + abs(h[i] - h[j]) );
+		}
+	}
+
+	printf("%d\n",dp[N]);
+
+	return 0;
+
+}

DMOJ/dp_c.cpp

@@ -0,0 +1,38 @@
+// Ivan Carvalho
+// Solution to https://dmoj.ca/problem/dp_c
+#include <bits/stdc++.h>
+using namespace std;
+
+const int MAXN = 1e5 + 10;
+
+int vis[MAXN][3],dp[MAXN][3],N,A[3][MAXN];
+
+int solve(int pos,int last){
+
+	if(pos == N + 1) return 0;
+
+	if(vis[pos][last]) return dp[pos][last];
+	vis[pos][last] = 1;
+
+	int best = 0;
+
+	for(int i = 0;i<3;i++){
+		if(i != last) best = max(best, A[i][pos] + solve(pos+1,i) );
+	}
+
+	return dp[pos][last] = best;
+
+}
+
+int main(){
+
+	scanf("%d",&N);
+	for(int i = 1;i<=N;i++){
+		scanf("%d %d %d",&A[0][i],&A[1][i],&A[2][i]);
+	}
+
+	printf("%d\n", max(solve(1,0), max(solve(1,1),solve(1,2)) ) );
+
+	return 0;
+
+}

DMOJ/dp_d.cpp

@@ -0,0 +1,27 @@
+// Ivan Carvalho
+// Solution to https://dmoj.ca/problem/dp_d
+#include <bits/stdc++.h>
+using namespace std;
+
+const int MAXW = 1e5 + 10;
+
+long long knapsack[MAXW];
+int N,W;
+
+int main(){
+
+	cin >> N >> W;
+
+	for(int item = 1;item<=N;item++){
+		int w,v;
+		cin >> w >> v;
+		for(int i = W;i>=w;i--) knapsack[i] = max(knapsack[i-w] + v,knapsack[i]);
+	}
+
+	long long best = 0;
+	for(int i = 0;i<=W;i++) best = max(best,knapsack[i]);
+	cout << best << endl;
+
+	return 0;
+
+}

DMOJ/dp_e.cpp

@@ -0,0 +1,42 @@
+// Ivan Carvalho
+// Solution to https://dmoj.ca/problem/dp_e
+#include <bits/stdc++.h>
+using namespace std;
+
+typedef long long ll;
+
+const int MAXV = 1e5 + 10;
+const int MAXN = 1e3 + 10;
+const ll INF = 1e13;
+
+ll dp[MAXV];
+int N,W,V,wi[MAXN],vi[MAXN];
+
+int main(){
+
+	cin >> N >> W;
+	for(int i = 1;i<=N;i++){
+		cin >> wi[i] >> vi[i];
+		V += vi[i];
+	}
+
+	for(int i = 1;i<=V;i++) dp[i] = INF;
+	dp[0] = 0;
+	
+	for(int item = 1;item<=N;item++){
+		int w = wi[item], v = vi[item];
+		for(int i = V;i>=v;i--){
+			dp[i] = min(dp[i],dp[i - v] + w);
+		}
+	}
+
+	for(int i = V;i>=0;i--){
+		if(dp[i] <= W){
+			cout << i << endl;
+			break;
+		}
+	}
+
+	return 0;
+
+}