C++博客-ArcTan-文章分类-ACM-水题http://www.cppblog.com/ArcTan/category/19281.htmldfszh-cnSun, 22 Jul 2012 17:17:20 GMTSun, 22 Jul 2012 17:17:20 GMT60SRM550 DIV2 250PT（字符串水题）http://www.cppblog.com/ArcTan/articles/184580.htmlwangswangsSun, 22 Jul 2012 02:02:00 GMThttp://www.cppblog.com/ArcTan/articles/184580.htmlhttp://www.cppblog.com/ArcTan/comments/184580.htmlhttp://www.cppblog.com/ArcTan/articles/184580.html#Feedback0http://www.cppblog.com/ArcTan/comments/commentRss/184580.htmlhttp://www.cppblog.com/ArcTan/services/trackbacks/184580.html

Problem Statement

     We have a string originalWord. Each character of originalWord is either 'a' or 'b'. Timmy claims that he can convert it to finalWord using exactly k moves. In each move, he can either change a single 'a' to a 'b', or change a single 'b' to an 'a'.

You are given the strings originalWord and finalWord, and the int k. Determine whether Timmy may be telling the truth. If there is a possible sequence of exactly k moves that will turn originalWord into finalWord, return "POSSIBLE" (quotes for clarity). Otherwise, return "IMPOSSIBLE".

Definition

    
Class: EasyConversionMachine
Method: isItPossible
Parameters: string, string, int
Returns: string
Method signature: string isItPossible(string originalWord, string finalWord, int k)
(be sure your method is public)
    

Notes

- Timmy may change the same letter multiple times. Each time counts as a different move.

Constraints

- originalWord will contain between 1 and 50 characters, inclusive.
- finalWord and originalWord will contain the same number of characters.
- Each character in originalWord and finalWord will be 'a' or 'b'.
- k will be between 1 and 100, inclusive.

Examples

0)
     
"aababba"
 
"bbbbbbb"
 
2
 
Returns: "IMPOSSIBLE"
It is not possible to reach finalWord in fewer than 4 moves.
1)
     
"aabb"
 
"aabb"
 
1
 
Returns: "IMPOSSIBLE"
The number of moves must be exactly k=1.
2)
     
"aaaaabaa"
 
"bbbbbabb"
 
8
 
Returns: "POSSIBLE"
Use each move to change each of the letters once.
3)
     
"aaa"
 
"bab"
 
4
 
Returns: "POSSIBLE"
The following sequence of 4 moves does the job:
aaa -> baa -> bab -> aab -> bab
4)
     
"aababbabaa"
 
"abbbbaabab"
 
9
 
Returns: "IMPOSSIBLE"

This problem statement is the exclusive and proprietary property of TopCoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of TopCoder, Inc. is strictly prohibited. (c)2003, TopCoder, Inc. All rights reserved.


字符串水题！

249.23PT！！！

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <sstream>
#include <fstream>
#include <map>
#include <set>
#include <vector>
#include <queue>
#include <algorithm>
#define min(x,y) (x<y?x:y)
#define max(x,y) (x>y?x:y)
#define swap(t,x,y) (t=x,x=y,y=t)
#define clr(list) memset(list,0,sizeof(list))

using namespace std;

class EasyConversionMachine{
public:
    string isItPossible(string originalWord, string finalWord, int k)
    {
        int n=originalWord.size();
        int tot=0;
        for (int i=0;i<n;i++)
            if (originalWord[i]!=finalWord[i])
                tot++;
        if (tot<=k && (k-tot)%2==0) //傻叉，这里刚刚开始搞反了，testing WA了一次
            return "POSSIBLE";
        return "IMPOSSIBLE";
    }
};


wangs 2012-07-22 10:02 发表评论
]]>TC SRM444 div2 250http://www.cppblog.com/ArcTan/articles/177990.htmlwangswangsThu, 07 Jun 2012 16:39:00 GMThttp://www.cppblog.com/ArcTan/articles/177990.htmlhttp://www.cppblog.com/ArcTan/comments/177990.htmlhttp://www.cppblog.com/ArcTan/articles/177990.html#Feedback0http://www.cppblog.com/ArcTan/comments/commentRss/177990.htmlhttp://www.cppblog.com/ArcTan/services/trackbacks/177990.html
题目大意很简单，就是一个贪心的过程吧，很简单的。不细说
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<iostream>
#include<cstring>
#include<string>
#include<algorithm>
#include<vector>
using namespace std;

class FourBlocksEasy
{
public:
    int maxScore(vector <string> grid) //感觉这些参数传递其实挺简单的啊，
    {
        int i,j,tmp,num1=0,num2,len;
        int flag[2][55];
        len=grid[0].length();
        memset(flag,0,sizeof(flag));
        for(i=2;i<len-2;i++)
        {
            if(grid[0][i]=='1') flag[0][i]=1;
            if(grid[1][i]=='1') flag[1][i]=1;
        }
        for(i=2;i<len-2;i++)
        {
            if(flag[0][i]==0)
            {
                if((i+1<len-2)&& flag[0][i+1]==0&&flag[1][i]==0&&flag[1][i+1]==0)
                {
                    flag[0][i]=4;flag[0][i+1]=4;flag[1][i+1]=4;flag[1][i]=4;
                    num1+=4;
                }
            }
        }
        num2=2*(len-4);
        tmp=4*num1+num2-num1;
        return tmp;      //就看做一个函数吧，
    }
}t1;
int main()
{
    vector<string> s1;  //vector 的使用，什么意思啊？
    string s;
    getline(cin,s);
   s1.push_back(s);  //擦。又是个什么函数，看不懂。
    getline(cin,s);
    s1.push_back(s);
    int ans;
    ans=t1.maxScore(s1);
    printf("%d\n",ans);
    return 0;
}

贴的是jjjh的代码，哎，C++真是该学学哇，连一个类都不会写，啥也不会？？？
以后要多做做TC!!!

oh ,shit..我是个煞笔，居然自己testing都没有过就提交了，还for 239.16。尼玛，坑爹啊！
不科学。。。。

乖乖学C++吧。




wangs 2012-06-08 00:39 发表评论
]]>hdu 2093(结构体排序 水题哇哇哇)http://www.cppblog.com/ArcTan/articles/177918.htmlwangswangsThu, 07 Jun 2012 07:07:00 GMThttp://www.cppblog.com/ArcTan/articles/177918.htmlhttp://www.cppblog.com/ArcTan/comments/177918.htmlhttp://www.cppblog.com/ArcTan/articles/177918.html#Feedback0http://www.cppblog.com/ArcTan/comments/commentRss/177918.htmlhttp://www.cppblog.com/ArcTan/services/trackbacks/177918.html结构体排序
struct student
{
      char name[20];
      int AC,time;
}
首先按照AC，time，如果前两个都相同就按照name的字典序排序。

这个读入很简单，sscanf();这个函数还不会用。

输出需要名字占10，靠左，则用“%-10s”

直接贴代码：WA了一次，中间调试输出的东西忘记删除了。
总结：字符串类题目还是要自己做做，虽然有些很恶心，恶心两次就好了！哈哈，

#include<stdio.h>
#include<string.h>
#include<math.h>
struct student
{
    char name[20];
    int AC,time;
} p[1005],temp,tt;

int tot;

int cmp(student a,student b)  
{
    if (a.AC>b.AC)
        return 1;
    if (a.AC==b.AC&&a.time<b.time)
        return 1;
    int i=0;
    while (a.AC==b.AC&&a.time==b.time&&i<strlen(a.name)&&i<strlen(b.name))
    {
        if (a.name[i]<b.name[i])
            return 1;
        i++;
    }
    return 0;
}

int qsort(int l,int r)      //自己还是不习惯条用stl里的sort()
{
    int i,j;
    i=l;
    j=r;
    temp=p[(i+j)/2];
    while (i<=j)
    {
        while (i<=j&&cmp(p[i],temp))    i++;
        while (i<=j&&cmp(temp,p[j]))    j--;
        if (i<=j)
        {
            tt=p[i];
            p[i]=p[j];
            p[j]=tt;
            i++;
            j--;
        }
    }
    if (l<j)    qsort(l,j);
    if (i<r)    qsort(i,r);
    return 0;
}

int main()
{
    int n,m,i,j,tmp;
    char ch;
    scanf("%d%d",&n,&m);
    tot=0;
    while (scanf("%s",&p[0].name)==1&&p[0].name[0]!='0')
    {
        tot++;
        p[tot]=p[0];
        p[tot].AC=0;
        p[tot].time=0;
        for (i=1; i<=n ; i++ )
        {
            scanf("%d",&tmp);
            if (tmp>0)
            {
                p[tot].AC++;
                p[tot].time+=tmp;
                ch=getchar();
                if (ch=='(')
                {
                    scanf("%d",&tmp);
                    p[tot].time+=m*tmp;
                    getchar();
                }
            }
        }
    }

    qsort(1,tot);

    for (i=1; i<=tot ; i++ )
    {

        printf("%-10s %2d %4d\n",p[i].name,p[i].AC,p[i].time);
    }
    return 0;
}


wangs 2012-06-07 15:07 发表评论
]]>