C++博客-ickchen2-文章分类-PKU月赛http://www.cppblog.com/ickchen2/category/8416.htmlzh-cnMon, 06 Oct 2008 10:17:43 GMTMon, 06 Oct 2008 10:17:43 GMT60PKU3705http://www.cppblog.com/ickchen2/articles/63308.html神之子神之子Mon, 06 Oct 2008 04:53:00 GMThttp://www.cppblog.com/ickchen2/articles/63308.htmlhttp://www.cppblog.com/ickchen2/comments/63308.htmlhttp://www.cppblog.com/ickchen2/articles/63308.html#Feedback0http://www.cppblog.com/ickchen2/comments/commentRss/63308.htmlhttp://www.cppblog.com/ickchen2/services/trackbacks/63308.html/*求最小的块移动求逆序*/
#include<stdio.h> #include<iostream> #include<string> #include<vector> #include<map> #include<queue> #include<algorithm> #include<math.h> #define M 1000 using namespace std; void ans(int n) { int pos=1; while(pos!=n) { printf("%d %d %d\n",(n-pos)/2+pos,2,pos/2); pos+=2; //cout<<pos<<endl; } printf("%d %d %d\n",1,(n-1)/2,(n-1)/2); } int main() { int n; scanf("%d",&n); if(n==1)printf("0\n"); else if(n==2) { printf("1\n"); printf("%d %d %d\n",1,1,1); } else if(n&1) { printf("%d\n",(int)ceil((n+1)/2.0)); ans(n); } else { printf("%d\n",(int)ceil((n+1)/2.0)); ans(n-1); printf("%d %d %d\n",n,1,0); } }

神之子 2008-10-06 12:53 发表评论
]]>PKU3702 搜索http://www.cppblog.com/ickchen2/articles/63306.html神之子神之子Mon, 06 Oct 2008 04:51:00 GMThttp://www.cppblog.com/ickchen2/articles/63306.htmlhttp://www.cppblog.com/ickchen2/comments/63306.htmlhttp://www.cppblog.com/ickchen2/articles/63306.html#Feedback0http://www.cppblog.com/ickchen2/comments/commentRss/63306.htmlhttp://www.cppblog.com/ickchen2/services/trackbacks/63306.html#include<stdio.h>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<queue>
#include<algorithm>
#define M 10000
using namespace std;
int a[4];
int b[4];
int v[M];
int ans;
int que[M];
string s1,s2;
void init(int *a,int *b)
{
    for(int i=0;i<4;i++)
    {
        a[i]=b[i];
    }
}
bool bfs()
{
    memset(v,0,sizeof(v));
    int t=0;
    for(int i=0;i<4;i++)
    {
        t=t*10+a[i];
    }
    int tail=0,head=0;
    que[tail++]=t;
    v[t]=1;
    while(head<tail)
    {
        int k=que[head++];
        for(int i=3;i>=0;--i)
        {
            a[i]=k%10;
            k/=10;
            b[i]=a[i];
        }
        for(int i=0;i<4;i++)
        {
            init(a,b);
            if(a[i]&&a[(i+2)%4]&&a[(i+1)%4]<8&&a[(i+3)%4]<8)
            {
                a[i]--;
                a[(i+1)%4]++;
                a[(i+2)%4]--;
                a[(i+3)%4]++;
            }
            int t=0;
            for(int j=0;j<4;j++)
            {
                t=t*10+a[j];
            }
            if(!v[t]){v[t]=1;que[tail++]=t;if(t==ans)return true;}
            init(a,b);
            if(a[i]&&a[(i+1)%4]&&a[(i+2)%4]<8)
            {
                a[i]--;
                a[(i+1)%4]--;
                a[(i+2)%4]++;
            }
            t=0;
            for(int j=0;j<4;j++)
            {
                t=t*10+a[j];
            }
            if(!v[t]){v[t]=1;que[tail++]=t;if(t==ans)return true;}
        }
    }
    return false;
}
int main()
{
    freopen("3702.txt","r",stdin);
    int ca;
    scanf("%d",&ca);
    while(ca--)
    {
        cin>>s1>>s2;
        memset(a,0,sizeof(a));
  memset(b,0,sizeof(b));
        int t=0;
        for(int i=0;i<s1.size();i++)
        {
           if(s1[i]=='*')a[i%4]++;
        }
        for(int i=0;i<s2.size();i++)
        {
           if(s2[i]=='*')b[i%4]++;
        }
        ans=0;
        for(int i=0;i<4;i++)
        {
            ans=ans*10+b[i];
            t=t*10+a[i];
        }
        if(t==ans)printf("YES\n");
        else
        printf("%s\n",bfs()?"YES":"NO");
    }
}


神之子 2008-10-06 12:51 发表评论
]]>