codeforces_229_div2解题报告

http://codeforces.com/contest/390

这次的题目还算是简单的，至起码前面4题都可以过的。最后一题没看，据称用2棵400W线段树可以勉强不超内存。

A：水题

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<iostream>
#include<algorithm>
#include<queue>
#include<stack>
#include<vector>
#include<map>
#include<set>
#include<bitset>
using namespace std;
#define ll __int64
int main()
{
    int i,j,k;
    int n,m,t;
    int x[105],y[105];
    while(scanf("%d",&n)!=EOF)
    {
        memset(x,0,sizeof(x));
        memset(y,0,sizeof(y));
        while(n--)
        {
            int p,q;
            scanf("%d%d",&p,&q);
            x[p]=1;
            y[q]=1;
        }
        int sumx=0,sumy=0;
        for(i=0;i<=100;i++)
        {
            sumx+=x[i];
        }
        for(i=0;i<=100;i++)
        {
            sumy+=y[i];
        }
        printf("%d\n",min(sumx,sumy));
    }
}

B：水题

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<iostream>
#include<algorithm>
#include<queue>
#include<stack>
#include<vector>
#include<map>
#include<set>
#include<bitset>
using namespace std;
#define ll __int64
#define N 100005
int a[N],b[N];
int main()
{
    int i,j,k;
    int n,m,t;
    while(scanf("%d",&n)!=EOF)
    {
        for(i=1;i<=n;i++)
        {
            scanf("%d",&a[i]);
        }
        for(i=1;i<=n;i++)
        {
            scanf("%d",&b[i]);
        }
        int judge=1;
        ll sum=0;
        for(i=1;i<=n;i++)
        {
            if(b[i]==1||2*a[i]<b[i])
            {
                sum--;
                continue;
            }
            sum+=((ll)(b[i]/2))*(b[i]-b[i]/2);
        }
        printf("%I64d\n",sum);
    }
}

C：我用的是线段树，但是比别人敲起来慢得多了

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<iostream>
#include<algorithm>
#include<queue>
#include<stack>
#include<vector>
#include<map>
#include<set>
#include<bitset>
using namespace std;
#define ll __int64
#define N 100005
struct node
{
	int left,right,toChange,sum;
}seg_tree[11][4*N];
char ch[N];
void seg_built(int l,int r,int num,int k)
{
	seg_tree[k][num].left=l;
	seg_tree[k][num].right=r;
	int mid=(l+r)/2;
	seg_tree[k][num].sum=0;
	seg_tree[k][num].toChange=0;
	if(l!=r)
	{
		seg_built(l,mid,2*num,k);
		seg_built(mid+1,r,2*num+1,k);
	}
}
void update(int l,int r,int num,int value,int k)
{
	if(seg_tree[k][num].left>r||seg_tree[k][num].right<l) return;
	if(seg_tree[k][num].left>=l&&seg_tree[k][num].right<=r)
	{
		seg_tree[k][num].sum=(seg_tree[k][num].right-seg_tree[k][num].left+1)*value;
		seg_tree[k][num].toChange=value;
		return;
	}
	if(seg_tree[k][num].toChange)
	{
		seg_tree[k][2*num].sum=(seg_tree[k][2*num].right-seg_tree[k][2*num].left+1)*seg_tree[k][num].toChange;
		seg_tree[k][2*num].toChange=seg_tree[k][num].toChange;
		seg_tree[k][2*num+1].sum=(seg_tree[k][2*num+1].right-seg_tree[k][2*num+1].left+1)*seg_tree[k][num].toChange;
		seg_tree[k][2*num+1].toChange=seg_tree[k][num].toChange;
		seg_tree[k][num].toChange=0;
	}
	update(l,r,2*num,value,k);
	update(l,r,2*num+1,value,k);
	seg_tree[k][num].sum=seg_tree[k][2*num].sum+seg_tree[k][2*num+1].sum;
}
int cal(int l,int r,int num,int k)
{
    if(seg_tree[k][num].left>r||seg_tree[k][num].right<l) return 0;
	if(seg_tree[k][num].left>=l&&seg_tree[k][num].right<=r)
	{
		return seg_tree[k][num].sum;
	}
	if(seg_tree[k][num].toChange!=0)
	{
		seg_tree[k][2*num].sum=(seg_tree[k][2*num].right-seg_tree[k][2*num].left+1)*seg_tree[k][num].toChange;
		seg_tree[k][2*num].toChange=seg_tree[k][num].toChange;
		seg_tree[k][2*num+1].sum=(seg_tree[k][2*num+1].right-seg_tree[k][2*num+1].left+1)*seg_tree[k][num].toChange;
		seg_tree[k][2*num+1].toChange=seg_tree[k][num].toChange;
		seg_tree[k][num].toChange=0;
	}
	int ans=cal(l,r,2*num,k)+cal(l,r,2*num+1,k);
	seg_tree[k][num].sum=seg_tree[k][2*num].sum+seg_tree[k][2*num+1].sum;
	return ans;
}
int main()
{
    int i,j;
    int n,m,t;
    int nn,kk,ww;
    scanf("%d%d%d",&nn,&kk,&ww);
    scanf("%s",ch);
    n=nn/kk+1;
    for(i=1;i<=kk;i++)
    {
        seg_built(1,n,1,i);
    }
    int all=strlen(ch);
    for(i=0;i<all;i++)
    {
        if(ch[i]=='1')
        update(i/kk+1,i/kk+1,1,1,i%kk+1);
    }
    {
		while(ww--)
		{
            int sum=0;
			int from,to;
			scanf("%d%d",&from,&to);
			for(j=from;j<from+kk-1;j++)
			{
                sum+=cal((j-1)/kk+1,(to-from+1)/kk-1+(j-1)/kk+1,1,(j-1)%kk+1);
			}
			j=from+kk-1;
			sum+=(to-from+1)/kk-cal((j-1)/kk+1,(to-from+1)/kk-1+(j-1)/kk+1,1,(j-1)%kk+1);
            printf("%d\n",sum);
		}
    }
}

D：感觉快一点的方法就是BFS+记录状态，但是后来发现居然暴力都行。。。可惜时间把握不好，没时间写这道题。

E：没看