【HDU】1495 非常可乐 BFS (附有大佬数论解法)

4 篇文章 0 订阅
2 篇文章 0 订阅
本文介绍了HDU 1495题目的解决方法,包括使用BFS(广度优先搜索)从初始状态逐步推导出其他未出现过的状态,并探讨了一种强大的数论解决方案,强调了数学在解决问题上的巨大优势。
摘要由CSDN通过智能技术生成

题目链接

BFS解法 从一种状态推出其他未出现过的状态并标记

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<queue>
#include<cstring>
using namespace std;
int dis[55];
int s,n,m;
struct P{
	int x,y,z;
	P(){}
    P(int x,int y,int z):x(x),y(y),z(z){}
};
int vis[101][101][101];
bool isok(P x){//判断是否满足要求
	if(x.x==x.y&&x.x==s/2)return 1;
	if(x.z==x.y&&x.z==s/2)return 1;
	if(x.z==x.x&&x.x==s/2)return 1;
	return 0;
}
queue<P> que;
int bfs(int x,int y,int z){
	while(!que.empty())que.pop();
	vis[x][y][z]=1;
	que.push(P(x,y,z));
	while(!que.empty()){
		P t=que.front();que.pop();
		int a=t.x,b=t.y,c=t.z;
		if(isok(t)){
			dis[s/2]=min(dis[s/2],vis[t.x][t.y][t.z]);
			return 1;
		}
        //六种倒水的方案
		if(vis[a+b][0][c]==0){
			que.push(P(a+b,0,c));
			vis[a+b][0][c]=vis[a][b][c]+1;
		}
		if(vis[a+c][b][0]==0){
			que.push(P(a+c,b,0));
			vis[a+c][b][0]=vis[a][b][c]+1;
		}
		if(a+b<=n&&vis[0][a+b][c]==0){
			que.push(P(0,a+b,c));
			vis[0][a+b][c]=vis[a][b][c]+1;
		}else if(a+b>n&&vis[a+b-n][n][c]==0){
			que.push(P(a+b-n,n,c));
			vis[a+b-n][n][c]=vis[a][b][c]+1;
		}
		if(a+c<=m&&vis[0][b][a+c]==0){
			que.push(P(0,b,a+c));
			vis[0][b][a+c]=vis[a][b][c]+1;
		}else if(a+c>m&&vis[a+c-m][b][m]==0){
			que.push(P(a+c-m,b,m));
			vis[a+c-m][b][m]=vis[a][b][c]+1;
		}
		if(c+b<=n&&vis[a][c+b][0]==0){
			que.push(P(a,b+c,0));
			vis[a][b+c][0]=vis[a][b][c]+1;
		}else if(c+b>n&&vis[a][n][c+b-n]==0){
			que.push(P(a,n,b+c-n));
			vis[a][n][b+c-n]=vis[a][b][c]+1;
		}
		if(c+b<=m&&vis[a][0][c+b]==0){
			que.push(P(a,0,c+b));
			vis[a][0][c+b]=vis[a][b][c]+1;
		}else if(c+b>m&&vis[a][c+b-m][m]==0){
			que.push(P(a,c+b-m,m));
			vis[a][c+b-m][m]=vis[a][b][c]+1;
		}
	}
    return 0;
}
int main()
{
	while(true){
		cin>>s>>n>>m;
		if(s==0)break;
		for(int i=0;i<=50;i++)dis[i]=99999999;
		memset(vis,0,sizeof(vis));
		if(s%2==1)cout<<"NO\n";
		else {
			if(bfs(s,0,0))cout<<dis[s/2]-1<<endl;
			else cout<<"NO\n";
		}
	}
	return 0;
}

过于菜只能写出这样的

不过还有一种强大的解法:数论

数论方案

不得不说数学好真的可以为所欲为,tql%%%%%%%%。

以下是hdu4310的Java解法: ```java import java.util.*; import java.io.*; public class Main { static int MAXN = 100010; static int MAXM = 200010; static int INF = 0x3f3f3f3f; static int n, m, s, t, cnt; static int[] head = new int[MAXN]; static int[] dis = new int[MAXN]; static boolean[] vis = new boolean[MAXN]; static int[] pre = new int[MAXN]; static int[] cur = new int[MAXN]; static class Edge { int to, next, cap, flow, cost; public Edge(int to, int next, int cap, int flow, int cost) { this.to = to; this.next = next; this.cap = cap; this.flow = flow; this.cost = cost; } } static Edge[] edge = new Edge[MAXM]; static void addEdge(int u, int v, int cap, int flow, int cost) { edge[cnt] = new Edge(v, head[u], cap, flow, cost); head[u] = cnt++; edge[cnt] = new Edge(u, head[v], 0, 0, -cost); head[v] = cnt++; } static boolean spfa() { Arrays.fill(dis, INF); Arrays.fill(vis, false); Queue<Integer> q = new LinkedList<>(); q.offer(s); dis[s] = 0; vis[s] = true; while (!q.isEmpty()) { int u = q.poll(); vis[u] = false; for (int i = head[u]; i != -1; i = edge[i].next) { int v = edge[i].to; if (edge[i].cap > edge[i].flow && dis[v] > dis[u] + edge[i].cost) { dis[v] = dis[u] + edge[i].cost; pre[v] = u; cur[v] = i; if (!vis[v]) { vis[v] = true; q.offer(v); } } } } return dis[t] != INF; } static int[] MCMF(int s, int t) { int flow = 0, cost = 0; while (spfa()) { int f = INF; for (int u = t; u != s; u = pre[u]) { f = Math.min(f, edge[cur[u]].cap - edge[cur[u]].flow); } for (int u = t; u != s; u = pre[u]) { edge[cur[u]].flow += f; edge[cur[u] ^ 1].flow -= f; cost += edge[cur[u]].cost * f; } flow += f; } return new int[]{flow, cost}; } public static void main(String[] args) { Scanner in = new Scanner(new BufferedReader(new InputStreamReader(System.in))); int T = in.nextInt(); for (int cas = 1; cas <= T; cas++) { n = in.nextInt(); m = in.nextInt(); s = 0; t = n + m + 1; cnt = 0; Arrays.fill(head, -1); for (int i = 1; i <= n; i++) { int c = in.nextInt(); addEdge(s, i, c, 0, 0); } for (int i = 1; i <= m; i++) { int c = in.nextInt(); addEdge(i + n, t, c, 0, 0); } for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { int c = in.nextInt(); addEdge(i, j + n, INF, 0, c); } } int[] ans = MCMF(s, t); System.out.printf("Case #%d: %d\n", cas, ans[1]); } } } ```
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值