Codeforces Round #542 (Div. 2)

A. Be Positive

简单题，代码已AC

#include<bits/stdc++.h>
using namespace std;
int n,t;
int main()
{
    scanf("%d",&n);
    int g=0,l=0;
    for(int i=0;i<n;i++)
    {
        scanf("%d",&t);
        if(t>0) g++;
        else if(t<0) l++;
    }
    int q=n/2+n%2;
    if(g>=q) printf("3");//只要是正数就行
    else if(l>=q) printf("-3");//只要是负数就行
    else printf("0");
    return 0;
}

 

 

 

 

B.Two Cakes

题解：贪心，永远找最优解

简单题，代码已AC

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=2e6+10;
int n;
ll b[maxn][2],t;
int main()
{
    memset(b,0,sizeof(b));
    scanf("%d",&n);
    for(int i=0;i<2*n;i++)
    {
        scanf("%lld",&t);
        if(b[t][0]) b[t][1]=i;
        else b[t][0]=i;
    }

    ll ans=0;
    for(int i=1;i<=n;i++)
        ans+=min((abs(b[i][0]-b[i-1][0])+abs(b[i][1]-b[i-1][1])),(abs(b[i][0]-b[i-1][1])+abs(b[i][1]-b[i-1][0])));
    printf("%lld",ans);
    return 0;
}

 

 

 

 

C. Connect

题解：因为两点之间直线最短，只要求出起点和终点所在连同块中最近距离即可

简单题，随便复制的感觉不错的AC代码

 

#include <bits/stdc++.h>

using namespace std;

#define sq(a) ((a) * (a))

int n, x[2], y[2];
char z[55][55];
bool v[2][55][55];
int ans = INT_MAX;

void dfs(int a, int b, int c) {
	if (v[c][a][b])
		return;
	v[c][a][b] = 1;
	if (z[a + 1][b] == '0')
		dfs(a + 1, b, c);
	if (z[a - 1][b] == '0')
		dfs(a - 1, b, c);
	if (z[a][b + 1] == '0')
		dfs(a, b + 1, c);
	if (z[a][b - 1] == '0')
		dfs(a, b - 1, c);
}

int main() {
	scanf("%d", &n);
	for (int i = 0; i < 2; i++)
		scanf("%d%d", x + i, y + i);
	for (int i = 1; i <= n; i++)
		scanf("%s", z[i] + 1);
	for (int i = 0; i < 2; i++)
		dfs(x[i], y[i], i);
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= n; j++)
			if (v[0][i][j])
				for (int k = 1; k <= n; k++)
					for (int l = 1; l <= n; l++)
						if (v[1][k][l])
							ans = min(ans, sq(i - k) + sq(j - l));
	printf("%d\n", ans);
}