ACM-ICPC2018亚洲区预选赛北京站网络赛部分题解

最新推荐文章于 2020-02-06 22:59:01 发布
最新推荐文章于 2020-02-06 22:59:01 发布
阅读量349 收藏
点赞数 2
分类专栏： ICPC真题
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/inv00ker/article/details/99444760
版权

A.Saving Tang Monk II【BFS】
题目链接：https://cn.vjudge.net/problem/HihoCoder-1828

#include <iostream>
#include <queue>
#include <cstring>
#include <algorithm>
using namespace std;
static const int MAXN = 100;
static const int dx[] = { 1,-1,0,0 }, dy[] = { 0,0,1,-1 };
char mp[MAXN + 10][MAXN + 10];
bool vis[6][MAXN + 10][MAXN + 10];
int n, m;
struct Node {
	int x, y, step, bottle;
	Node(int x, int y, int step, int bottle) :x(x), y(y), step(step), bottle(bottle) {};
	bool operator<(Node a)const {
		return step > a.step;
	}
};
void bfs(Node node)
{
	priority_queue<Node> Q;
	Q.push(node);
	vis[node.bottle][node.x][node.y] = true;
	while(!Q.empty())
	{
		Node now = Q.top();
		Q.pop();
		for (int i = 0; i < 4; i++)
		{
			Node next = now;
			next.x += dx[i], next.y += dy[i];
			if (1 <= next.x && next.x <= n && 1 <= next.y && next.y <= m && !vis[next.bottle][next.x][next.y])
			{
				vis[next.bottle][next.x][next.y] = true;
				if (mp[next.x][next.y] == 'T')
				{
					cout << next.step + 1 << endl;
					return;
				}
				else if (mp[next.x][next.y] == '.' || mp[next.x][next.y] == 'S')
				{
					next.step += 1;
					Q.push(next);
				}
				else if (mp[next.x][next.y] == '#' && next.bottle)
				{
					next.bottle -= 1;
					next.step += 2;
					Q.push(next);
				}
				else if (mp[next.x][next.y] == 'B')
				{
					if (next.bottle < 5)
						next.bottle += 1;
					next.step += 1;
					Q.push(next);
				}
				else if (mp[next.x][next.y] == 'P')
					Q.push(next);
			}
		}
	}
	cout << -1 << endl;
	return;
}
int main()
{
	std::ios::sync_with_stdio(false);
	std::cin.tie(0), cout.tie(0);
	while (cin >> n >> m && n && m)
	{
		for (int i = 1; i <= n; i++)
			for (int j = 1; j <= m; j++)
				cin >> mp[i][j];
		memset(vis, false, sizeof(vis));
		for (int i = 1; i <= n; i++)
			for (int j = 1; j <= m; j++)
				if (mp[i][j] == 'S')
					bfs(Node{ i,j,0,0 });
	}
	return 0;
}

B.Tomb Raider【暴力】【set】
题目链接：https://cn.vjudge.net/problem/HihoCoder-1829

#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <algorithm>
using namespace std;
string st[11];
set<string> se[11];
int n;
void subset(string s, int len, int num)
{
	for (int i = 0; i <= (1 << len) - 1; i++)
	{
		string ss;
		for (int j = 0; j < len; j++)
		{
			if (((i >> j) & 1) == 1)
				ss += s[j];
		}
		if (ss.size())
			se[num].insert(ss);
	}
}
int main()
{
	std::ios::sync_with_stdio(false);
	std::cin.tie(0), cout.tie(0);
	while (cin >> n && n)
	{
		for (int i = 0; i < n; i++)
		{
			se[i].clear();
			cin >> st[i];
			int len = st[i].size();
			st[i] += st[i];
			for (int j = 0; j < len; j++)
			{
				string s(st[i].begin() + j, st[i].begin() + len + j);
				subset(s, len, i);
			}
		}
		vector<string> v;
		for (string ss : se[0])
		{
			bool flag = true;
			for (int i = 1; i < n; i++)
			{
				if (se[i].count(ss) == 0)
				{
					flag = false;
					break;
				}
			}
			if (flag)
				v.push_back(ss);
		}
		if (v.size() == 0)
		{
			cout << 0 << endl;
			continue;
		}
		sort(v.begin(), v.end());
		string ans;
		int maxlen = 0;
		for (string ss : v)
		{
			if (ss.size() > maxlen)
			{
				ans = ss;
				maxlen = ss.size();
			}
		}
		cout << ans << endl;
	}
	return 0;
}

C.Cheat【模拟】
题目链接：https://cn.vjudge.net/problem/HihoCoder-1830

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
int poke[5][14], hand[5], table[14];
int main()
{
	std::ios::sync_with_stdio(false);
	std::cin.tie(0), cout.tie(0);
	char ch;
	while (cin >> ch)
	{
		memset(poke, 0, sizeof(poke));
		memset(table, 0, sizeof(table));
		if (ch == 'A') poke[1][1]++;
		else if ('2' <= ch && ch <= '9') poke[1][ch - '0']++;
		else if (ch == '1') { cin >> ch; poke[1][10]++; }
		else if (ch == 'J') poke[1][11]++;
		else if (ch == 'Q') poke[1][12]++;
		else if (ch == 'K') poke[1][13]++;
		for (int i = 1; i <= 4; i++)
			for (int j = 1; j <= 13; j++)
			{
				if (i == 1 && j == 1) continue;
				cin >> ch;
				if (ch == 'A') poke[i][1]++;
				else if ('2' <= ch && ch <= '9') poke[i][ch - '0']++;
				else if (ch == '1') { cin >> ch; poke[i][10]++; }
				else if (ch == 'J') poke[i][11]++;
				else if (ch == 'Q') poke[i][12]++;
				else if (ch == 'K') poke[i][13]++;
			}
		hand[1] = hand[2] = hand[3] = hand[4] = 13;
		int rndpoke = 0, rndplayer = 0;
		while (hand[1] && hand[2] && hand[3] && hand[4])
		{
			rndpoke = rndpoke % 13 + 1;
			rndplayer = rndplayer % 4 + 1;
			if (rndplayer == 1)
				if (poke[1][rndpoke])
				{
					poke[1][rndpoke]--; hand[1]--; table[rndpoke]++;
					int nextrndpoke = rndpoke % 13 + 1;
					if (poke[2][nextrndpoke] == 0)
						for (int i = 1; i <= 13; i++) { poke[2][i] += table[i]; hand[2] += table[i]; table[i] = 0; }
					else if (hand[1] == 0)
						for (int i = 1; i <= 13; i++) { poke[4][i] += table[i]; hand[4] += table[i]; table[i] = 0; }
				}
				else
				{
					int curpoke = -1;
					if (poke[1][10]) curpoke = 10;
					if (curpoke == -1) for (int i = 2; i <= 9; i++) if (poke[1][i]) { curpoke = i; break; }
					if (curpoke == -1)
						if (poke[1][1]) curpoke = 1;
						else if (poke[1][11]) curpoke = 11;
						else if (poke[1][13]) curpoke = 13;
						else curpoke = 12;
					poke[1][curpoke]--; hand[1]--; table[curpoke]++;
					int nextrndpoke = rndpoke % 13 + 1;
					if (poke[2][nextrndpoke] == 0 || poke[3][rndpoke] == 4 || hand[1] == 0)
						for (int i = 1; i <= 13; i++) { poke[1][i] += table[i]; hand[1] += table[i]; table[i] = 0; }
				}
			else if (rndplayer == 2)
				if (poke[2][rndpoke])
				{
					int num = poke[2][rndpoke]; 
					hand[2] -= num; poke[2][rndpoke] = 0;table[rndpoke] += num;
					if (hand[2] == 0)
						for (int i = 1; i <= 13; i++) { poke[4][i] += table[i]; hand[4] += table[i]; table[i] = 0; }
				}
				else
				{
					int curpoke = -1;
					if (poke[2][10]) curpoke = 10;
					if (curpoke == -1) for (int i = 2; i <= 9; i++) if (poke[2][i]) { curpoke = i; break; }
					if (curpoke == -1)
						if (poke[2][1]) curpoke = 1;
						else if (poke[2][11]) curpoke = 11;
						else if (poke[2][13]) curpoke = 13;
						else curpoke = 12;
					poke[2][curpoke]--;	hand[2]--; table[curpoke]++;
					if (poke[3][rndpoke] == 4 || hand[2] == 0 || 1 + poke[1][rndpoke] > 4)
						for (int i = 1; i <= 13; i++) {	poke[2][i] += table[i];	hand[2] += table[i]; table[i] = 0; }
				}
			else if (rndplayer == 3)
				if (poke[3][rndpoke])
				{
					int num = poke[3][rndpoke];
					hand[3] -= num;	poke[3][rndpoke] = 0; table[rndpoke] += num; 
					if (hand[3] == 0)
						for (int i = 1; i <= 13; i++) { poke[4][i] += table[i]; hand[4] += table[i]; table[i] = 0; }
				}
				else
				{
					int minnum = 4;
					for (int i = 1; i <= 13; i++)
						if (poke[3][i]) minnum = min(minnum, poke[3][i]);
					int curpoke = -1;
					if (poke[3][10] == minnum) curpoke = 10;
					if (curpoke == -1) for (int i = 2; i <= 9; i++)	if (poke[3][i] == minnum) {	curpoke = i; break;	}
					if (curpoke == -1)
						if (poke[3][1] == minnum) curpoke = 1;
						else if (poke[3][11] == minnum) curpoke = 11;
						else if (poke[3][13] == minnum) curpoke = 13;
						else curpoke = 12;
					hand[3] -= minnum; poke[3][curpoke] = 0; table[curpoke] += minnum;
					if (hand[3] == 0 || minnum + poke[1][rndpoke] > 4)
						for (int i = 1; i <= 13; i++) { poke[3][i] += table[i]; hand[3] += table[i]; table[i] = 0; }
				}
			else if (rndplayer == 4)
				if (poke[4][rndpoke] == 3 || poke[4][rndpoke] == 4)
				{
					int num = poke[4][rndpoke];
					hand[4] -= num; poke[4][rndpoke] = 0; table[rndpoke] += num;
					int nextrndpoke = rndpoke % 13 + 1;
					if (num + poke[1][rndpoke] > 4 || poke[1][nextrndpoke] == 0)
						for (int i = 1; i <= 13; i++) {	poke[1][i] += table[i];	hand[1] += table[i]; table[i] = 0; }
					else if (poke[3][rndpoke] == 4)
						for (int i = 1; i <= 13; i++) { poke[3][i] += table[i]; hand[3] += table[i]; table[i] = 0; }
				}
				else
				{
					int num1 = poke[4][rndpoke];
					hand[4] -= num1; poke[4][rndpoke] = 0; table[rndpoke] += num1;
					int num2 = 0;
					if (hand[4]) num2 = 1;
					int curpoke = -1;
					if (poke[4][10]) curpoke = 10;
					if (curpoke == -1)
						for (int i = 2; i <= 9; i++) if (poke[4][i]) { curpoke = i; break; }
					if (curpoke == -1)
						if (poke[4][1]) curpoke = 1;
						else if (poke[4][11]) curpoke = 11;
						else if (poke[4][13]) curpoke = 13;
						else curpoke = 12;
					if (num2) {	poke[4][curpoke] -= num2; table[curpoke] += num2; hand[4] -= num2; }
					int nextrndpoke = rndpoke % 13 + 1;
					if (num1 + num2 + poke[1][rndpoke] > 4 || poke[1][nextrndpoke] == 0)
						if (num2) for (int i = 1; i <= 13; i++) { poke[4][i] += table[i]; hand[4] += table[i]; table[i] = 0; }
						else for (int i = 1; i <= 13; i++) { poke[1][i] += table[i]; hand[1] += table[i]; table[i] = 0; }
					else if (poke[3][rndpoke] == 4)
						for (int i = 1; i <= 13; i++) { poke[4][i] += table[i]; hand[4] += table[i]; table[i] = 0; }
				}
		}
		for (int i = 1; i <= 4; i++)
			if (hand[i] == 0) cout << "WINNER" << endl;
			else for (int j = 1; j <= 13; j++)
				while (poke[i][j])
				{
					if (j == 1) cout << "A";
					else if (2 <= j && j <= 10) cout << j;
					else if (j == 11) cout << "J";
					else if (j == 12) cout << "Q";
					else if (j == 13) cout << "K";
					poke[i][j]--; hand[i]--;
					if (hand[i] == 0) cout << endl;
					else cout << " ";
				}
	}
	return 0;
}

D.80 Days【尺取】
题目链接：https://cn.vjudge.net/problem/HihoCoder-1831

#include <iostream>
#include <queue>
using namespace std;
static const int MAXN = 1e6;
int a[MAXN * 2 + 5], b[MAXN * 2 + 5];
int main()
{
	std::ios::sync_with_stdio(false);
	std::cin.tie(0), cout.tie(0);
	int T;
	cin >> T;
	while (T--)
	{
		int n, c;
		cin >> n >> c;
		for (int i = 1; i <= n; i++)
		{
			cin >> a[i];
			a[i + n] = a[i];
		}
		for (int i = 1; i <= n; i++)
		{
			cin >> b[i];
			b[i + n] = b[i];
		}
		long long sum = 1ll * c;
		queue<int> Q;
		while (!Q.empty())
			Q.pop();
		bool flag = true;
		for (int i = 1; i <= 2 * n; i++)
		{
			if (sum + a[i] - b[i] >= 0)
			{
				sum += 1ll*(a[i] - b[i]);
				Q.push(i);
				if (Q.size() >= n)
				{
					flag = false;
					cout << Q.front() << endl;
					Q.pop();
					break;
				}
			}
			else
			{
				while (sum + a[i] - b[i] < 0 && Q.size())
				{
					int pos = Q.front();
					Q.pop();
					sum -= 1ll*(a[pos] - b[pos]);
				}
				if (sum + a[i] - b[i] >= 0)
				{
					sum += 1ll*(a[i] - b[i]);
					Q.push(i);
					if (Q.size() >= n)
					{
						flag = false;
						cout << Q.front() << endl;
						break;
					}
				}
			}
		}
		if (flag)
			cout << -1 << endl;
	}
	return 0;
}

E.Odd Chess
题目链接：https://cn.vjudge.net/problem/HihoCoder-1832

F.Shortest Path Problem
题目链接：https://cn.vjudge.net/problem/HihoCoder-1833

G.The Mole
题目链接：https://cn.vjudge.net/problem/HihoCoder-1834

H.K-Dimensional Foil II
题目链接：https://cn.vjudge.net/problem/HihoCoder-1835

I.Order
题目链接：https://cn.vjudge.net/problem/HihoCoder-1836

J.Rikka with Polygon
题目链接：https://cn.vjudge.net/problem/HihoCoder-1837

invoKer-
关注
  • 2
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
第六届中山大学ICPC新手赛网络预选赛试题
12-21
第六届中山大学ICPC新手赛网络预选赛试题。
ACM/ICPC 2018亚洲区预选赛北京赛站网络赛 A（bfs）
Chen.Jr的博客
09-23 828
传送门 题面： #1828 : Saving Tang Monk II 时间限制:1000ms 单点时限:1000ms 内存限制:256MB 描述 《Journey to the West》(also 《Monkey》) is one of the Four Great Classical Novels of Chinese literature. It was written by...
ACM/ICPC 2018亚洲区预选赛北京赛站网络赛
weixin_33725272的博客
09-22 83
菜鸡只配拥有三题，难过 题目1 : Saving Tang Monk II 时间限制:1000ms 单点时限:1000ms 内存限制:256MB 描述 《Journey to the West》(also 《Monkey》) is one of the Four Great Classical Novels of Chinese literature...
ACM/ICPC 2018亚洲区预选赛北京赛站网络赛题目4 : 80 Days
weixin_41391865的博客
09-22 602
#include &lt;map&gt; #include &lt;cstring&gt; #include &lt;string&gt; #include &lt;cstdio&gt; #include &lt;cstring&gt; #include &lt;iostream&gt; #include &lt;algorithm&gt; #include &lt;cctype&amp
ACM/ICPC 2018亚洲区预选赛北京赛站网络赛D-80 Days--------树状数组
qq_40921866的博客
09-22 105
题意就是说1-N个城市为一个环，最开始你手里有C块钱，问从1->N这些城市中，选择任意一个，然后按照顺序绕环一圈，进入每个城市会有a[i]元钱，出来每个城市会有b[i]个城市，问是否能保证经过每个城市，钱都不会能为0，如果可以请输出最小的那个 这题最开始队员想错了。。。后来思路就乱了，整理一下思路，你会发现，其实我们要求的就是从i到n+i的前缀和最小值一定要大于c。 ...
ACM-ACM-ICPC算法示例之Greedy-题解.zip
02-25
ACM_ACM-ICPC算法示例之Greedy_题解
ACM-ACM-ICPC算法示例之Hashing-题解.zip
02-25
ACM_ACM-ICPC算法示例之Hashing_题解
2018 ACM-ICPC 南京网络赛题目
09-01
2018 ACM-ICPC 南京网络赛题目
ACM-ICPC 历年竞赛 真题，各大赛区真题详解
04-24
ACM-ICPC 历年竞赛 真题，各大赛区真题详解，内含几大赛区各年度的真题
ACM-ICPC 2020年上海区域赛正式赛试题
12-16
2020 ACM-ICPC 上海区域赛正式赛赛题，国际大学生程序设计竞赛（英文全称：International Collegiate Programming Contest（简称ICPC））是由国际计算机协会（ACM）主办的，一项旨在展示大学生创新能力、团队精神和...
题解：ACM/ICPC 2018亚洲区预选赛北京赛站网络赛
wu-kan
09-23 418
Saving Tang Monk II 按气罐数量分层建图跑最短路。 #include&amp;lt;bits/stdc++.h&amp;gt; #define POS(i,j,k) ((k)*(n)*(m)+(i)*(m)+(j)) using namespace std; typedef int ll; const int INF=1e9; struct Graph { struct Vertex { ...
ACM/ICPC 2018亚洲区预选赛北京赛站网络赛 C-cheat
Seeyouer的博客
09-22 534
超级水的模拟的，我也就会做模拟了……坑有点多，一直没调出来bug，赛后才发现少了一个数字…… 描述 Cheat is a card game played by four players sitting around a table. They are numbered from 1 to 4 in clockwise order. A pack of 52 cards is used. The...
ACM-ICPC2018北京网络赛 Tomb Raider（暴力）
weixin_30651273的博客
09-22 149
题目2 : Tomb Raider 时间限制:1000ms 单点时限:1000ms 内存限制:256MB 描述 Lara Croft, the fiercely independent daughter of a missing adventurer, must push herself beyond her limits when she discovers...
ACM/ICPC 2018亚洲区预选赛北京赛站网络赛 K-Dimensional Foil II(二分瞎搞)
喵喵喵？
09-22 884
  传送门 这题其实没有题面看起来复杂，实际上我们贪心的去想：对于下式                                                                            如果我们有这么一种操作可以把某个减一，现在问一次操作后S的最小值, 那么很容易便可以知道我们肯定是去找最大的那个去减一，最后的结果才会最小. 对于这道题其...
ACM/ICPC 2018亚洲区预选赛北京赛站网络赛 【bfs + 记忆化搜索 + 剪枝】 AC 代码
ZXYhappiness的博客
02-06 214
ACM 北京区域赛 bfs+剪枝+ms 第一个一遍过的题目，基本没有看题解 记忆搜索当中，注意初始化成一个特殊值；而在访问之后，每个点就会有一个不同于INF(或者 -1等特殊标记)的值 先到先得，适者生存（初始值可以被任何人替代） 这道题目当中剪枝是必要的，因为有许多无效状态，根本不用入队，相当于进行了剪枝操作 首先，需要对状态进行一个严格的约...
ACM/ICPC 2018亚洲区预选赛北京赛站网络赛 hihocoder #1829 : Tomb Raider(模拟)
Amove
09-23 587
                                             题目2 : Tomb Raider 时间限制:1000ms 单点时限:1000ms 内存限制:256MB 描述 Lara Croft, the fiercely independent daughter of a missing adventurer, must push herself beyon...
ACM-ICPC真题
最新发布
05-08
ACM-ICPC是一项世界性的大学生计算机程序设计竞赛，旨在展示大学生创造性地解决问题、团队协作和迅速将复杂问题分解为小问题的能力。ACM-ICPC的比赛题目一般要求选手用计算机编写程序，对所给的问题进行求解，其难度...

“相关推荐”对你有帮助么？

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

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

抵扣说明：

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

余额充值