Codeforces Round #297 (Div. 2) C、D、E

Codeforces Round #297 (Div. 2), problem: (C) Ilya and Sticks

n = input()
sticks = [int(_) for _ in raw_input().split()]
sticks.sort()
sticks.reverse()
sides = []
i = 0
while i < len(sticks) - 1:
  # print sticks[i]
  if sticks[i] == sticks[i + 1] or sticks[i] == sticks[i + 1] + 1:
    sides.append(sticks[i + 1])
    i += 2
  else:
    i += 1
ans = 0
if len(sides) >= 2:
  i = 0
  while i < len(sides) - 1:
    ans += sides[i] * sides[i + 1]
    i += 2
print ans

Codeforces Round #297 (Div. 2), problem: (D) Arthur and Walls

一看题觉得很可能是二维树状数组

但是后来发现贪心可以解：

  考虑一个2*2的正方形，如果其中有3个‘ . ’，一个' * '，则必定要把那个星号变成点

  然后bfs

//      whn6325689
//		Mr.Phoebe
//		http://blog.csdn.net/u013007900
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <climits>
#include <complex>
#include <fstream>
#include <cassert>
#include <cstdio>
#include <bitset>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <ctime>
#include <set>
#include <map>
#include <cmath>
#include <functional>
#include <numeric>
#pragma comment(linker, "/STACK:1024000000,1024000000")


using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef complex<ld> point;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef vector<int> vi;

#define CLR(x,y) memset(x,y,sizeof(x))
#define mp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define lowbit(x) (x&(-x))
#define MID(x,y) (x+((y-x)>>1))
#define speed std::ios::sync_with_stdio(false);
#define eps 1e-9
#define PI acos(-1.0)
#define INF 0x3f3f3f3f
#define LLINF 1LL<<62

template<class T>
inline bool read(T &n)
{
    T x = 0, tmp = 1;
    char c = getchar();
    while((c < '0' || c > '9') && c != '-' && c != EOF) c = getchar();
    if(c == EOF) return false;
    if(c == '-') c = getchar(), tmp = -1;
    while(c >= '0' && c <= '9') x *= 10, x += (c - '0'),c = getchar();
    n = x*tmp;
    return true;
}
template <class T>
inline void write(T n)
{
    if(n < 0)
    {
        putchar('-');
        n = -n;
    }
    int len = 0,data[20];
    while(n)
    {
        data[len++] = n%10;
        n /= 10;
    }
    if(!len) data[len++] = 0;
    while(len--) putchar(data[len]+48);
}
//-----------------------------------

const int dir[8][2]={1,0,-1,0,0,1,0,-1,1,1,1,-1,-1,1,-1,-1};

int n,m;
char ma[2010][2010];

struct Node
{
	int x,y;
	Node(){}
	Node(const int& x,const int& y):x(x),y(y){}
};

queue<Node> q;

bool in(int x,int y,int i=1)
{
	if(i)
		return x>=0 && x<n && y>=0 && y<m && ma[x][y]!='*';
	else
		return x>=0 && x<n && y>=0 && y<m && ma[x][y]=='*'; 
}

bool check(int x,int y)
{
	if(in(x+1,y) && in(x,y+1) && in(x+1,y+1))
		return true;
	if(in(x+1,y) && in(x,y-1) && in(x+1,y-1))
		return true;
	if(in(x-1,y) && in(x,y-1) && in(x-1,y-1))
		return true;
	if(in(x-1,y) && in(x,y+1) && in(x-1,y+1))
		return true;
	return false;
}
void bfs()
{
	while(!q.empty()) q.pop();
	for(int i=0;i<n;i++)
		for(int j=0;j<m;j++)
			if(ma[i][j]=='*' && check(i,j))
			{
				ma[i][j]='.';
				q.push(Node(i,j));
			}
			
	while(!q.empty())
	{
		Node now=q.front();q.pop();
		for(int i=0;i<8;i++)
		{
			int xx=dir[i][0]+now.x;
			int yy=dir[i][1]+now.y;
			if(in(xx,yy,0) && check(xx,yy))
			{
				ma[xx][yy]='.';
				q.push(Node(xx,yy));
			}
		}
	}
}

int main()
{
//	freopen("data.txt","r",stdin);
	while(read(n)&&read(m))
	{
		for(int i=0;i<n;i++)
			scanf("%s",ma[i]);
		bfs();
		for(int i=0;i<n;i++)
			puts(ma[i]);	
	}
	return 0;
}  

 Codeforces Round #297 (Div. 2), problem: (E) Anya and Cubes

廖神给的思路

看到n那么小就想到暴搜，但是相对于全部暴力又太大啦

于是分成两半暴搜

//      whn6325689
//		Mr.Phoebe
//		http://blog.csdn.net/u013007900
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <climits>
#include <complex>
#include <fstream>
#include <cassert>
#include <cstdio>
#include <bitset>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <ctime>
#include <set>
#include <map>
#include <cmath>
#include <functional>
#include <numeric>
#pragma comment(linker, "/STACK:1024000000,1024000000")


using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef complex<ld> point;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef vector<int> vi;

#define CLR(x,y) memset(x,y,sizeof(x))
#define mp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define lowbit(x) (x&(-x))
#define MID(x,y) (x+((y-x)>>1))
#define speed std::ios::sync_with_stdio(false);
#define eps 1e-9
#define PI acos(-1.0)
#define INF 0x3f3f3f3f
#define LLINF 1LL<<62

template<class T>
inline bool read(T &n)
{
    T x = 0, tmp = 1;
    char c = getchar();
    while((c < '0' || c > '9') && c != '-' && c != EOF) c = getchar();
    if(c == EOF) return false;
    if(c == '-') c = getchar(), tmp = -1;
    while(c >= '0' && c <= '9') x *= 10, x += (c - '0'),c = getchar();
    n = x*tmp;
    return true;
}
template <class T>
inline void write(T n)
{
    if(n < 0)
    {
        putchar('-');
        n = -n;
    }
    int len = 0,data[20];
    while(n)
    {
        data[len++] = n%10;
        n /= 10;
    }
    if(!len) data[len++] = 0;
    while(len--) putchar(data[len]+48);
}
//-----------------------------------

ll f[21]={0,1},s,a[26],ans;
int n,k;
map<ll,int> way[26];

void dfs(int i,ll sum,int num)
{
	if(sum>s || num>k)	return;
	if(i>=n/2)
	{
		way[num][sum]++;
	}
	else
	{
		dfs(i+1,sum,num);
		dfs(i+1,sum+a[i],num);
		if(a[i]<20)
			dfs(i+1,sum+f[a[i]],num+1);
	}
}

void dfs2(int i,ll sum,int num)
{
	if(sum>s || num>k)	return;
	if(i>=n)
	{
		for(int j=0;j<=k-num;j++)
			if(way[j].find(s-sum)!=way[j].end())
				ans+=way[j][s-sum];
	}
	else
	{
		dfs2(i+1,sum,num);
		dfs2(i+1,sum+a[i],num);
		if(a[i]<20)
			dfs2(i+1,sum+f[a[i]],num+1);
	}
}

int main()
{
//	freopen("data.txt","r",stdin);
	for(int i=2;i<20;i++)
		f[i]=f[i-1]*i;
	read(n),read(k),read(s);
	for(int i=0;i<n;i++)
		read(a[i]);
	dfs(0,0,0);
	dfs2(n/2,0,0);
	write(ans),putchar('\n');
	return 0;
}