Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit 720c2fa

Browse files
More SPOJ Problems
MinCost Max Flow, 2D String Search, DP and Dijkstra problems.
1 parent 92c6fc6 commit 720c2fa

File tree

7 files changed

+482
-0
lines changed

7 files changed

+482
-0
lines changed

‎SPOJ/C1TABOVI.cpp

Lines changed: 27 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,27 @@
1+
#include <bits/stdc++.h>
2+
using namespace std;
3+
4+
const int MAXN = 1010;
5+
const int MAXP = 82;
6+
const int INF = 1e8 + 10;
7+
8+
int dp[MAXN][MAXP][MAXP],vetor[MAXN],alvo[MAXN],N;
9+
10+
int solve(int pos,int a,int b){
11+
if(pos == N + 1) return 0;
12+
if(a < 0 || b < 0 || a >= MAXP || b >= MAXP) return INF;
13+
if(dp[pos][a][b] != -1) return dp[pos][a][b];
14+
int qtd = vetor[pos] + a - b;
15+
if(qtd == alvo[pos]) return dp[pos][a][b] = solve(pos+1,a,b);
16+
else if(qtd < alvo[pos]) return dp[pos][a][b] = min( solve(pos,a+1,b) + 1, solve(pos,a,b-1) );
17+
else return dp[pos][a][b] = min( solve(pos,a,b+1) + 1, solve(pos,a-1,b) );
18+
}
19+
20+
int main(){
21+
scanf("%d",&N);
22+
memset(dp,-1,sizeof(dp));
23+
for(int i = 1;i<=N;i++) scanf("%d",&vetor[i]);
24+
for(int i = 1;i<=N;i++) scanf("%d",&alvo[i]);
25+
printf("%d\n",solve(1,0,0));
26+
return 0;
27+
}

‎SPOJ/GREED.cpp

Lines changed: 145 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,145 @@
1+
#include <bits/stdc++.h>
2+
using namespace std;
3+
4+
const int MAXL = 1e5 + 10;
5+
const int MAXN = 1010;
6+
const int INF = 1e9;
7+
8+
int cap[MAXN][MAXN],custo[MAXN][MAXN],pai[MAXN],dist[MAXN],nafila[MAXN],N,M;
9+
int equivale1[MAXN],equivale2[MAXN];
10+
11+
map<int,int> conversao;
12+
set<int> grafo[MAXL];
13+
map<int,int> percurso[MAXL];
14+
15+
int SPFA(){
16+
//printf("SPFA\n");
17+
for(int i = 0;i<=M;i++){
18+
pai[i] = -1;
19+
dist[i] = INF;
20+
nafila[i] = 0;
21+
}
22+
queue<int> fila;
23+
dist[0] = 0;
24+
fila.push(0);
25+
nafila[0] = 1;
26+
while(!fila.empty()){
27+
int v = fila.front();
28+
nafila[v] = 0;
29+
fila.pop();
30+
//printf("V %d dist %d\n",v,dist[v]);
31+
for(int u = 0;u<=M;u++){
32+
if(cap[v][u] <= 0) continue;
33+
if(custo[v][u] + dist[v] < dist[u]){
34+
dist[u] = custo[v][u] + dist[v];
35+
pai[u] = v;
36+
if(!nafila[u]){
37+
nafila[u] = 1;
38+
fila.push(u);
39+
}
40+
}
41+
}
42+
}
43+
if(dist[M] == INF) return 0;
44+
int atual = M;
45+
while(pai[atual] != -1){
46+
cap[pai[atual]][atual] -= 1;
47+
cap[atual][pai[atual]] += 1;
48+
atual = pai[atual];
49+
}
50+
return dist[M];
51+
}
52+
53+
void bfs(int s){
54+
queue<int> fila;
55+
vector<int> vis;
56+
vis.assign(2*conversao.size()+1,0);
57+
vis[s] = 1;
58+
percurso[s][s] = 0;
59+
fila.push(s);
60+
while(!fila.empty()){
61+
int v = fila.front();
62+
fila.pop();
63+
for(set<int>::iterator it = grafo[v].begin();it != grafo[v].end();it++){
64+
int u = *it;
65+
if(!vis[u]){
66+
vis[u] = 1;
67+
percurso[s][u] = percurso[s][v] + 1;
68+
fila.push(u);
69+
}
70+
}
71+
}
72+
}
73+
74+
int get_id(int v){
75+
if(!conversao.count(v)){
76+
conversao[v] = conversao.size();
77+
grafo[v].clear();
78+
percurso[v].clear();
79+
}
80+
//printf("V %d conversao %d\n",v,conversao[v]);
81+
return conversao[v];
82+
}
83+
84+
int main(){
85+
86+
int TC;
87+
scanf("%d",&TC);
88+
89+
for(int tc = 1;tc<=TC;tc++){
90+
91+
scanf("%d",&N);
92+
memset(cap,0,sizeof(cap));
93+
memset(custo,0,sizeof(custo));
94+
conversao.clear();
95+
M = 2*N + 1;
96+
97+
for(int i = 1;i<=N;i++) equivale1[i] = get_id(i);
98+
99+
for(int i = 1;i<=N;i++){
100+
scanf("%d",&equivale2[i]);
101+
equivale2[i] = get_id(equivale2[i]);
102+
}
103+
104+
int E;
105+
scanf("%d",&E);
106+
while(E--){
107+
int x,y;
108+
scanf("%d %d",&x,&y);
109+
x = get_id(x);
110+
y = get_id(y);
111+
//printf("X %d Y %d\n",x,y);
112+
grafo[x].insert(y);
113+
grafo[y].insert(x);
114+
}
115+
116+
//printf("Grafo\n");
117+
118+
for(int i = 1;i<=N;i++) bfs(equivale1[i]);
119+
120+
for(int i = 1;i<=N;i++){
121+
cap[0][i] = 1;
122+
}
123+
for(int i = 1;i<=N;i++){
124+
cap[N+i][M] = 1;
125+
}
126+
for(int i = 1;i<=N;i++){
127+
for(int j = 1;j<=N;j++){
128+
if(percurso[equivale1[i]].count(equivale2[j])){
129+
custo[i][j+N] = percurso[equivale1[i]][equivale2[j]];
130+
custo[j+N][i] = -custo[i][j+N];
131+
cap[i][j+N] = 1;
132+
}
133+
}
134+
}
135+
136+
//printf("Construi\n");
137+
138+
int custo = 0;
139+
for(int i = 1;i<=N;i++) custo += SPFA();
140+
printf("%d\n",custo);
141+
142+
}
143+
144+
return 0;
145+
}

‎SPOJ/MUSKET.cpp

Lines changed: 62 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,62 @@
1+
#include <bits/stdc++.h>
2+
using namespace std;
3+
4+
const int MAXN = 210;
5+
6+
int dp[MAXN][MAXN][MAXN],N,matriz[MAXN][MAXN],possivel[MAXN];
7+
char entrada[MAXN];
8+
9+
inline int converte(int x){
10+
if(x > N) return x - N;
11+
return x;
12+
}
13+
14+
int solve(int k,int i,int j){
15+
if(dp[k][i][j] != -1) return dp[k][i][j];
16+
if(k < i && k > j) return dp[k][i][j] = 0;
17+
if(k == i){
18+
if(i == j) return dp[k][i][j] = 1;
19+
for(int l = i+1;l<=j;l++){
20+
if(matriz[converte(k)][converte(l)]*solve(l,i+1,j)) return dp[k][i][j] = 1;
21+
}
22+
return dp[k][i][j] = 0;
23+
}
24+
else if(k == j){
25+
for(int l = j - 1;l>=i;l--){
26+
if(matriz[converte(k)][converte(l)]*solve(l,i,j-1)) return dp[k][i][j] = 1;
27+
}
28+
return dp[k][i][j] = 0;
29+
}
30+
else{
31+
return dp[k][i][j] = solve(k,i,k) && solve(k,k,j);
32+
}
33+
}
34+
35+
int main(){
36+
int TC;
37+
scanf("%d",&TC);
38+
while(TC--){
39+
scanf("%d",&N);
40+
memset(dp,-1,sizeof(dp));
41+
memset(matriz,0,sizeof(matriz));
42+
memset(possivel,0,sizeof(possivel));
43+
for(int i = 1;i<=N;i++){
44+
scanf("%s",entrada);
45+
for(int j = 1;j<=N;j++){
46+
matriz[i][j] = (entrada[j-1] == '1');
47+
}
48+
}
49+
for(int ini = 1,fim = N;ini<=N;ini++,fim++){
50+
for(int i = 1;i<=2*N;i++){
51+
possivel[converte(i)] |= solve(i,ini,fim);
52+
}
53+
}
54+
int ans = 0;
55+
for(int i = 1;i<=N;i++) ans += possivel[i];
56+
printf("%d\n",ans);
57+
for(int i = 1;i<=N;i++){
58+
if(possivel[i]) printf("%d\n",i);
59+
}
60+
}
61+
return 0;
62+
}

‎SPOJ/SWERC14B.cpp

Lines changed: 54 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,54 @@
1+
#include <bits/stdc++.h>
2+
using namespace std;
3+
4+
typedef long long ll;
5+
typedef pair<int,int> ii;
6+
7+
const int MAXN = 1e4 + 10;
8+
9+
vector<ii> grafo[MAXN];
10+
int N,M,processado[MAXN],dist[MAXN][2],menor_caminho;
11+
ll tot;
12+
13+
void Dijsktra(int s,int id){
14+
memset(processado,0,sizeof(processado));
15+
priority_queue<ii, vector<ii>, greater<ii> > pq;
16+
pq.push(ii(0,s));
17+
while(!pq.empty()){
18+
int d = pq.top().first, v = pq.top().second;
19+
pq.pop();
20+
if(processado[v]) continue;
21+
processado[v] = 1;
22+
dist[v][id] = d;
23+
for(ii aresta : grafo[v]){
24+
if(!processado[aresta.first]) pq.push(ii(aresta.second + d,aresta.first));
25+
}
26+
}
27+
}
28+
29+
int main(){
30+
scanf("%d %d",&N,&M);
31+
32+
for(int i = 1;i<=M;i++){
33+
int u,v,w;
34+
scanf("%d %d %d",&u,&v,&w);
35+
grafo[u].push_back(ii(v,w));
36+
grafo[v].push_back(ii(u,w));
37+
}
38+
39+
Dijsktra(0,0);
40+
Dijsktra(N-1,1);
41+
42+
menor_caminho = dist[N-1][0];
43+
44+
for(int i = 0;i<N;i++){
45+
for(ii aresta : grafo[i]){
46+
int j = aresta.first, peso = aresta.second;
47+
if(dist[i][0] + peso + dist[j][1] == menor_caminho) tot += (ll)peso;
48+
}
49+
}
50+
51+
printf("%lld\n",2LL*tot);
52+
53+
return 0;
54+
}

‎SPOJ/SWERC14D.cpp

Lines changed: 38 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,38 @@
1+
#include <bits/stdc++.h>
2+
using namespace std;
3+
4+
const int MAXN = 1e4 + 10;
5+
6+
vector<int> G[MAXN];
7+
int match[MAXN],vis[MAXN],iteracao,N,M;
8+
9+
int bpm(int v){
10+
if(vis[v] == iteracao) return 0;
11+
vis[v] = iteracao;
12+
for(int u : G[v]){
13+
if(match[u] == -1 || bpm(match[u])){
14+
match[u] = v;
15+
return 1;
16+
}
17+
}
18+
return 0;
19+
}
20+
21+
int main(){
22+
cin >> N >> M;
23+
memset(match,-1,sizeof(match));
24+
for(int i = 1;i<=M;i++){
25+
int u,v;
26+
cin >> u >> v;
27+
G[u].push_back(v);
28+
}
29+
for(int i = 0;i<N;i++){
30+
iteracao++;
31+
if(bpm(i) == 0){
32+
cout << "NO" << endl;
33+
return 0;
34+
}
35+
}
36+
cout << "YES" << endl;
37+
return 0;
38+
}

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /