2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest 11/14

最新推荐文章于 2022-12-06 23:05:25 发布
最新推荐文章于 2022-12-06 23:05:25 发布
阅读量287 收藏
点赞数
分类专栏： ACM补题
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/qq_20139423/article/details/103114124
版权

A

#include <iostream>
#include <cstdio>
 
using namespace std;
 
int const N = 100005;
 
int a[N], dfn[N];
int mx[N], mi[N];
 
void update(int x) {
	mx[x] = max(mx[x], dfn[x]);
	mi[x] = min(mi[x], dfn[x]);
}
 
int main() {
	int n, m;
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; ++i) {
		a[i] = i;
		dfn[i] = i;
		mx[i] = mi[i] = i;
	}
	for (int i = 1; i <= m; ++i) {
		int x;
		scanf("%d", &x);
		if (dfn[x] != 1) {
			int pre = a[dfn[x] - 1];
			dfn[x] = dfn[x] - 1;
			dfn[pre] = dfn[pre] + 1;
			swap(a[dfn[x]], a[dfn[pre]]);
			update(x);
			update(pre);
		}
	}
	for (int i = 1; i <= n; ++i)
		printf("%d %d\n", mi[i], mx[i]);
}

B

#include <bits/stdc++.h>
#define LL long long
using namespace std;
const int maxn=500005,maxm=8005;
int n,m,val[maxm];
bool boo[maxn];
LL ans;
int work(int key)
{
	int res=0,cnt=0;
	for (int L=1,R=m;L<=R;L++)
	{
		while (L<R && val[L]+val[R]<=key) R--,cnt++;
		if (cnt) cnt--;
		res++;
	}
	return res+(cnt+1)/2;
}
bool cmp(int A,int B) { return A>B; }
int main()
{
	scanf("%d%d",&n,&m);
	for (int i=1,x;i<=n;i++)
	{
		scanf("%d",&x);
		val[x]++;
	}
	sort(val+1,val+1+m,cmp);
	for (int i=1;i<m;i++)
		for (int j=i+1;j<=m;j++)
			boo[val[i]+val[j]]=true;
	ans=(LL)val[1]*work(val[1]);
	for (int i=val[1]+1;i<=val[1]+val[2];i++)
		if (boo[i]) ans=min(ans,(LL)i*work(i));
	printf("%lld",ans);
	return 0;
}

C

线段树维护左端点的答案就行。

#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <vector>
#include <utility>
 
using namespace std;
 
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
 
int const N = 200005;
int const M = 200000;
 
ll mx[N << 2], lz[N << 2];
struct node {
	ll l, r, p;
} a[N];
int n;
ll m;
vector<node> vec[N];
 
void pushdown(int k) {
	mx[k << 1] += lz[k];
	mx[k << 1 | 1] += lz[k];
	lz[k << 1] += lz[k];
	lz[k << 1 | 1] += lz[k];
	lz[k] = 0;
}
 
void pushup(int k) {
	mx[k] = max(mx[k << 1], mx[k << 1 | 1]);
}
 
void modify(int k, int l, int r, int ql, int qr, ll v) {
	if (ql <= l && r <= qr) {
		mx[k] += v;
		lz[k] += v;
		return;
	}
	int mid = (l + r) >> 1;
	if (lz[k] != 0)
		pushdown(k);
	if (ql <= mid)
		modify(k << 1, l, mid, ql, qr, v);
	if (qr > mid)
		modify(k << 1 | 1, mid + 1, r, ql, qr, v);
	pushup(k);
}
 
ll query_ans(int k, int l, int r, int ql, int qr) {
	if (ql <= l && r <= qr) 
		return mx[k];
	int mid = (l + r) >> 1;
	ll ret = 0;
	if (lz[k] != 0)
		pushdown(k);
	if (ql <= mid)
		ret = query_ans(k << 1, l, mid, ql, qr);
	if (qr > mid)
		ret = max(query_ans(k << 1 | 1, mid + 1, r, ql, qr), ret);
	pushup(k);
	return ret;
}
 
int query(int k, int l, int r, ll v) {
	if (l == r)
		return l;
	int mid = (l + r) >> 1, ret = 0;
	if (lz[k] != 0)
		pushdown(k);
	if (mx[k << 1] == v)
		ret = query(k << 1, l, mid, v);
	else
		ret = query(k << 1 | 1, mid + 1, r, v);
	pushup(k);
	return ret;
}
 
int main() {
	ios::sync_with_stdio(0);
	cin >> n >> m;
	for (int i = 1; i <= n; ++i) {
		cin >> a[i].l >> a[i].r >> a[i].p;
		vec[a[i].r].push_back(a[i]);
	}
	int ansl = -1, ansr = -1;
	ll ans = 0;
	for (int i = 1; i <= M; ++i) {
		modify(1, 1, M, 1, i, -m);
		for (auto p : vec[i]) 
			modify(1, 1, M, 1, p.l, p.p);
		ll anss = query_ans(1, 1, M, 1, i);
		if (anss > ans) {
			//fprintf(stderr, ">> %d %d\n", i, anss);
			ans = anss;
			ansr = i;
			ansl = query(1, 1, M, ans);
		}
	}
	if (ans == 0)
		puts("0");
	else {
		auto sub = vector<int>();
		for (int i = 1; i <= n; ++i)
			if (ansl <= a[i].l && a[i].r <= ansr)
				sub.push_back(i);
		cout << ans << ' ' << ansl << ' ' << ansr << ' ' << sub.size() << '\n';
		for (int i = 0; i < (int)sub.size(); ++i) {
			cout << sub[i];
			if (i + 1 == (int)sub.size())
				cout << '\n';
			else
				cout << ' ';
		}
	}
}

D

E

来自coming的补题，2-sat一下

F

#include <iostream>
#include <cstdio>
 
using namespace std;
 
int main() {
	int s;
	cin >> s;
	int ans = s * 10;
	for (int i = 1; i <= s; ++i)
		if (s % i == 0) {
			int oth = s / i;
			int tmp = (i + oth) * 2;
			ans = min(ans, tmp);
		}
	cout << ans << '\n';
}

G

无脑DP，注意边界x

#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <cassert>
 
using namespace std;
 
using ll = long long;
 
int const N = 200005;
 
int a[N], b[N];
int n, m;
ll s1[N], s2[N];
int f[N], pre[N];
 
void dfs(int x) {
	if (x == 0)
		return;
	dfs(pre[x]);
	printf("%d ", x);
}
 
bool chk(int l, int r) {
	return max(s1[r], s2[r]) - min(s1[l], s2[l]) < m;
}
 
int main() {
	int T;
	scanf("%d", &T);
	while (T--) {
		scanf("%d%d", &n, &m);
		for (int i = 1; i <= n; ++i) {
			scanf("%d", &a[i]);
			s1[i] = s1[i - 1] + a[i];
		}
		for (int i = 1; i <= n; ++i) {
			scanf("%d", &b[i]);
			s2[i] = s2[i - 1] + b[i];
		}
		f[0] = 0;
		int lim = n;
		for (int i = 1, p = 0; i <= n; ++i) {
			while (p < i && chk(p, i) == 0)
				++p;
			//assert(p < i);
			if (p == i) {
				lim = i;
				break;
			}
			f[i] = f[p] + 1;
			pre[i] = p;
			//cerr << i << ' ' << f[i] << ' ' << pre[i] << '\n';
		}
		s1[n + 1] = s1[n];
		s2[n + 1] = s2[n];
		int ans = -1, pos = -1;
		for (int i = 0, p = 1; i < lim; ++i) {
			p = max(p, i);
			while (p < lim && chk(i, p + 1))
				++p;
			ll t1 = s1[i], t2 = s2[i];
			ll mi = min(t1, t2);
			t1 -= mi;
			t2 -= mi;
			t1 += s1[p + 1] - s1[i];
			t2 += s2[p + 1] - s2[i];
			if (t1 < m && t2 >= m) {
				ans = f[i];
				pos = i;
				break;
			}
		}
		printf("%d\n", ans);
		if (ans != -1) {
			dfs(pos);
			printf("\n");
		}
	}
}

H

#include <bits/stdc++.h>
using namespace std;
int G,cho,a[12];
int main()
{
	scanf("%d",&G);
	while (G--)
	{
		scanf("%d",&a[0]);
		a[0]++;
		cho=0;
		for (int i=1;i<=9;i++)
		{
			scanf("%d",&a[i]);
			if (a[i]<a[cho]) cho=i;
		}
		if (cho) for (int i=0;i<=a[cho];i++) printf("%d",cho); else
		{
			printf("1");
			for (int i=1;i<=a[0];i++) printf("0");
		}
		printf("\n");
	}
	return 0;
}

I

J

#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <vector>
 
using namespace std;
 
using ll = long long;
 
int const N = 30005;
 
ll a[N], b[N];
int n;
ll m;
 
bool chk(ll lim) {
	ll ret = 0;
	for (int i = 0; i <= n; ++i)
		b[i] = a[i];
	for (int i = 1; i <= n; ++i) {
		ll can = (b[i] + b[i - 1]) / lim;
		ret += can;
		ll del = can * lim;
		del -= b[i - 1];
		if (del <= 0)
			continue;
		b[i] -= del;
	}
	return ret >= m;
}
 
int main() {
	ios::sync_with_stdio(0);
	int T;
	cin >> T;
	while (T--) {
		cin >> n >> m;
		for (int i = 1; i <= n; ++i)
			cin >> a[i];
		ll l = 1, r = 5e16, ans = 0;
		while (l <= r) {
			ll mid = (l + r) >> 1;
			if (chk(mid)) {
				ans = mid;
				l = mid + 1;
			} else
				r = mid - 1;
		}
		cout << ans * m << '\n';
	}
}

K

L

#include <bits/stdc++.h>
using namespace std;
int G,A,B,C,ans;
int work(int A,int B,int C,int can)
{
	if (A<B) swap(A,B);
	if (A<C) swap(A,C);
	can-=A-B;
	can-=A-C;
	if (can<=0)
		return A; else
		return A+(can+2)/3;
}
int main()
{
	scanf("%d",&G);
	while (G--)
	{
		scanf("%d%d%d",&A,&B,&C);
		ans=work(A/2,A-A/2,C,B);
		ans=min(ans,work(A,C/2,C-C/2,B));
		printf("%d\n",ans);
	}
	return 0;
}

M

倍增一下，每次搞方案就行

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
 
struct Ans {
	std::vector<int> xs, ys;
 
	bool empty() const {
		return xs.empty() || ys.empty();
	}
};
 
void dup (std::vector<Ans> &ans, int n, int mx) {
	int tgt = std::min(n * 2 + 1, mx);
 
	for (auto &c: ans) {
		int n1 = c.xs.size();
		for (int i = 0; i < n1; ++i)
			if (c.xs[i] + n + 1 <= tgt)
				c.xs.push_back(c.xs[i] + n + 1);
 
		int n2 = c.ys.size();
		for (int i = 0; i < n2; ++i)
			if (c.ys[i] + n + 1 <= tgt)
				c.ys.push_back(c.ys[i] + n + 1);
	}
 
	Ans lblk, rblk, row, col;
	for (int i = n + 2; i <= tgt; ++i)
		lblk.xs.push_back(i);
	for (int i = 1; i <= n; ++i)
		lblk.ys.push_back(i);
	if (!lblk.empty())
		ans.push_back(lblk);
 
	for (int i = 1; i <= n; ++i)
		rblk.xs.push_back(i);
	for (int i = n + 2; i <= tgt; ++i)
		rblk.ys.push_back(i);
	if (!rblk.empty())
		ans.push_back(rblk);
 
	row.xs.push_back(n + 1);
	for (int i = 1; i <= tgt; ++i)
		if (i != n && i != n + 1)
			row.ys.push_back(i);
	if (!row.empty())
		ans.push_back(row);
 
	for (int i = 1; i <= tgt; ++i)
		if (i != n + 1 && i != n + 2)
			col.xs.push_back(i);
	col.ys.push_back(n + 1);
	if (!col.empty())
		ans.push_back(col);
}
 
int main () {
	// freopen("out", "w", stdout);
 
	int n;
	scanf("%d", &n);
	// n = 5000;
	
	int i = 2;
	auto ans = std::vector<Ans>();
	ans.push_back(Ans { {1}, {2} });
	while (i < n) {
		dup(ans, i, n);
		i = std::min(i * 2 + 1, n);
	}
	
	printf("%d\n", (int)ans.size());
	for (auto &c: ans) {
		printf("%d", (int)c.xs.size());
		for (auto &x: c.xs)
			printf(" %d", x);
		printf("\n%d", (int)c.ys.size());
		for (auto &y: c.ys)
			printf(" %d", y);
		putchar('\n');
	}
 
	// fprintf(stderr, "%d\n", (int));
	return 0;
}

N

虽然确实很傻逼但是有坑（，不能随便把一个连通块的某条边改过去，因为有可能不小心改了桥边x

#include <cstdio>
#include <queue>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <utility>
 
struct Graph {
	struct E {
		int idx;
		int to;
	};
 
	int n;
	std::vector<std::vector<E>> to;
	std::vector<int> vis;
	std::vector<int> eind, ind;
 
	Graph (int n_): n(n_), to(n), vis(n, -1), eind(n, -1), ind(n, 0) {}
 
	void adde (int idx, int a, int b) {
		to[a].push_back(E { idx, b });
		++ind[b];
		eind[b] = idx;
		// fprintf(stderr, "%d -> %d\n", a, b);
	}
 
	struct Ans {
		int idx;
		int from, to;
	};
 
	Ans dfs (int c, int fa, int ibeg) {
		// fprintf(stderr, "in (c=%d fa=%d ibeg=%d)\n", c, fa, ibeg);
 
		vis[c] = ibeg;
		Ans ret = { -1, -1, -1 };
		for (auto &e: to[c]) {
			//fprintf(stderr, "e> to=%d\n", e.to);
			if (e.to == fa) {
				fa = -1;
			} else if (vis[e.to] == ibeg) {
				ret = { e.idx, e.to, 0 };
			} else if (vis[e.to] == -1) {
				auto nxt = dfs(e.to, c, ibeg);
				if (ret.idx == -1) {
					ret = nxt;
				}
			}
		}
 
		//fprintf(stderr, "ret (c=%d) %d %d %d\n", c, ret.idx, ret.from, ret.to);
		return ret;
	}
 
	std::vector<Ans> solve () {
		int ifst = 0;
		dfs(0, -1, 0);
 
		auto blks = std::vector<Ans>(n, Ans { -1, -1, -1 });
		for (int i = 1; i < n; ++i)
			if (vis[i] == -1) {
				auto cur = dfs(i, -1, i);
				//fprintf(stderr, ">1 i=%d %d %d\n", i, cur.idx, cur.from);
				if (cur.idx == -1)
					blks[i].idx = -2;
				else
					blks[i] = cur;
			}
 
		/*&
		for (int i = 0; i < n; ++i)
			fprintf(stderr, "(%d,%d) ", blks[i].idx, blks[i].from);
		fprintf(stderr, " <<blks\n");
		for (int i = 0; i < n; ++i)
			fprintf(stderr, "%d ", vis[i]);
		fprintf(stderr, " <<vis\n");
		for (int i = 0; i < n; ++i)
			fprintf(stderr, "%d ", ind[i]);
		fprintf(stderr, " <<ind\n");
		for (int i = 0; i < n; ++i)
			fprintf(stderr, "%d ", eind[i]);
		fprintf(stderr, " <<eind\n");
		*/
 
		for (int i = 1; i < n; ++i)
			if (vis[i] >= 1 && ind[i] == 1 && blks[vis[i]].idx == -2) {
				//fprintf(stderr, ">2 %d %d\n", eind[i], i);
				blks[vis[i]] = { eind[i], i, ifst };
			}
 
		auto ret = std::vector<Ans>();
		for (auto &c: blks)
			if (c.idx != -1)
				ret.push_back(c);
		return ret;
	}
};
 
int main () {
	int t;
	scanf("%d", &t);
 
	while (t--) {
		int m;
		scanf("%d", &m);
		
		auto hm = std::vector<int>();
		auto es = std::vector<std::pair<int, int>>(m);
		for (auto &e: es) {
			scanf("%d%d", &e.first, &e.second);
			hm.push_back(e.first);
			hm.push_back(e.second);
		}
		std::sort(hm.begin(), hm.end());
		hm.erase(std::unique(hm.begin(), hm.end()), hm.end());
 
		auto g = Graph(hm.size());
 
		for (int i = 0; i < (int)es.size(); ++i) {
			int a = std::lower_bound(hm.begin(), hm.end(), es[i].first) - hm.begin();
			int b = std::lower_bound(hm.begin(), hm.end(), es[i].second) - hm.begin();
			g.adde(i, a, b);
			g.adde(i, b, a);
		}
 
		auto ans = g.solve();
		printf("%d\n", (int)ans.size());
		for (auto &c: ans) {
			int a = hm[c.from], b = hm[c.to];
			printf("%d %d %d\n", c.idx + 1, a, b);
		}
	}
 
	return 0;
}
BPMThor(BPM136)
关注
专栏目录
ICPC 2019-2020 North-Western Russia Regional Contest
m0_49959202的博客
03-07 330
ICPC 2019-2020 North-Western Russia Regional Contest 文章目录ICPC 2019-2020 North-Western Russia Regional ContestA - Accurate MovementB - Bad TreapE - EquidistantH - High Load DatabaseI - Ideal PyramidJ - Just the Last DigitM - Managing Difficulties A - Accura
2019-2020 ICPC Asia Taipei-Hsinchu Regional Contest
m0_49959202的博客
10-03 733
文章目录2019-2020 ICPC Asia Taipei-Hsinchu Regional ContestA.Rush Hour PuzzleC.Are They All Integers?D.TapiokaE.The League of Sequence DesignersH.Mining aJ.Automatic Control MachineK.Length of Bundle RopeL. Largest Quadrilateral 2019-2020 ICPC Asia Taipei-Hsin
2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest B. The Feast and the Bus (经典贪心)
qq_42479630的博客
02-21 334
题目链接 思路：先把k个团队的人数从大到小排序，我们发现s最小是num【1】，那么s最大是num【1】+num【2】？可是我们这样想的话容易被毒瘤数据tle，所以还得优化一下，我们可以想我们最优的方案是不是一辆车每次尽可能答案两个团队，同时人数是不是尽可能的满？所以我们可以枚举max（a【1】+a【k】、a【2】+a【k-1】。。。。），这个才是s的最大值，这样缩小了s的范围以后就可以通过枚举s...
2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest
MaJorieL
11-07 807
A.Berstagram 题意：起始数列是1，2，3，……，n，给你m个操作x，表示将数字x和前一个位置的数交换，如果已经在第一个则不做操作，求每个数能到达的位置的最大和最小值； 分析：扫一遍模拟，更新左右极限； #include<bits/stdc++.h> using namespace std; const int maxn=1e5+7; int a[maxn],pos[...
2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest J. The Parade（二分）
qq_42479630的博客
02-19 378
题目链接 题意：给定身高为1-n的士兵数量，现在要求士兵分成k排，要求每一排士兵身高差不能超过1，求最多有多少士兵可以拿出来排。 思路：又是一个裸的二分题，但是写check函数的时候确遇到了bug。。。我们可以二分枚举每排士兵的人数。这里就是注意一下，每个身高的士兵人数要累加起来求和，如果分开的话会出错。 #include<bits/stdc++.h> using namespac...
2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest J. The Parade(二分+贪心)
pubgoso的博客
12-19 301
题目链接 大意：给你一个组士兵，告诉你身高iii的人数aia_iai​，让你放在kkk行，使得每行人数相同且每行中士兵身高差不超过111，问你最多能放多少士兵满足条件。 思路:二分每行人数。证明：如果xxx满足的话，显然可以把每行都去掉相同的人数使得[1,x][1,x][1,x]都满足。 遍历nnn个人，先把上一个身高的士兵没用完的看能不能和当前身高的放满一行，再放当前身高的。 如果最后放的行数比...
2019-2020 ICPC Southwestern European Regional Programming Contest (SWERC 2019-20)
m0_49959202的博客
10-03 706
文章目录2019-2020 ICPC Southwestern European Regional Programming Contest (SWERC 2019-20)A.Environment-Friendly TravelB. BiodiversityC. AntsF. IcebergsI. Rats 2019-2020 ICPC Southwestern European Regional Programming Contest (SWERC 2019-20) A.Environment-Frien
2019-2020 ICPC Southeastern European Regional Programming Contest (SEERC 2019)
m0_49959202的博客
03-19 446
文章目录2019-2020 ICPC Southeastern European Regional Programming Contest (SEERC 2019)B. Level UpD. Cycle String?F. Game on a TreeG. ProjectionI. Absolute GameJ. Graph and Cycles 2019-2020 ICPC Southeastern European Regional Programming Contest (SEERC 2019) B.
2019-2020 ICPC Northwestern European Regional Programming Contest (NWERC 2019) A，E
行走天涯的豆沙包的博客
03-09 2580
E - Expeditious Cubing 题解： 如果有浮点型可能会损失精度，这里说了给出的都是两位小数，所以我们直接把所有小数整体向右移动把他们变成整形，然后推式子的时候先从两个边界推，然后再推一般情况会好写一些。 #include <bits/stdc++.h> //#define int long long const int N=4e5+7; using namespace...
2019-2020 ICPC North-Western Russia Regional Contest【部分题解】
KobeDuu
11-10 2225
题目: ICPC 2019-2020 North-Western Russia Regional Contest E：Equidistant 题意： 给定一颗树，再给出 m 个关键点，让你找出一个点使得这个点到 m 个关键点的距离相等 分析： （1）直观的做法就是换根dp，预处理出每个节点为根时，子树中的关键点到它距离最大值和最小值，次最大值和次最小值，换根dp的时候直接看所有关键点到...
#2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest 部分题解
OlaMins
11-06 2329
A. Berstagram time limit per test 3 seconds memory limit per test 512 megabytes input standard input output standard output Polycarp recently signed up to a new social network Berstagram. He ...
2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest 部分题解ABFHJLN
hrdate(菜菜菜带带带)
10-11 690
2020-10-10为了准备CCPC，师兄下午拉了场ICPC练习让我们模拟，负责读题的菜鸡晚上回来重新做了模拟场上有思路的题QAQ 文章目录A - BerstagramB - The Feast and the BusF - Data CenterH - Happy BirthdayJ - The ParadeL - Divide The StudentsN - Wires A - Berstagram 传送门 CodeForces-1250A #pragma GCC optimize(2) #includ
2021-2022 ICPC, NERC, Northern Eurasia Onsite L. Labyrinth
ACMer未入门热爱者
12-06 437
翻译：莱斯利和利昂进入了一个迷宫。迷宫由𝑛大厅和𝑚大厅之间的单向通道组成。大厅编号从1到𝑛。莱斯利和利昂在大厅开始了他们的旅程𝑠。他们立刻争吵起来，决定各自去探索迷宫。然而，他们希望在旅程结束时再次见面。为了帮助Leslie和Leon，你的任务是找到两条不同的路径，从给定的大厅𝑠到另一个大厅𝑡，这样这两条路径除了开始的大厅𝑠和结束的大厅𝑡之外不共用大厅。大厅𝑡还没有确定，所以你可以选择任何一个迷宫的大厅𝑡除了𝑠。莱斯利和利昂的路不一定是最短的，但他们的路必须很简单，最多一次去任何一个大
2021-2022 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred
apple_52197802的博客
04-14 719
2021-2022 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) C. Connect the Points 题意：给你三个点，让你添加若干条平行于xxx轴和yyy轴的线段，让这三个点在一个连通块上，问在所有的方案中，所有添加的线段长度最小的方案。 思路：找到三个点横坐标大小位于中间的那个，令其为xm,找到纵坐标大小位于中间的那个，令其为ym，我们用平行xxx轴和平行yyy轴
ICPC 2019-2020 North-Western Russia Regional Contest AEHJM
bjfu170203101的博客
05-24 314
A:签到模拟即可 #include <bits/stdc++.h> using namespace std; typedef long long ll; #define ls (o<<1) #define rs (o<<1|1) #define pb push_back const double PI= acos(-1.0); const int M = 1e5+7; int head[M],cnt; void init(){cnt=0,memset(head,0,
2020-2021 icpc southeastern european regional programming contest (seerc 2020)
最新发布
03-16
202-2021 ICPC 东南欧洲区域编程竞赛（SEERC 202）是一项国际性的编程竞赛，旨在促进全球范围内的计算机科学和编程技能的发展。该竞赛由国际大学生程序设计竞赛（ICPC）组织，吸引了来自世界各地的优秀程序员参加。...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

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

抵扣说明：

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

余额充值