SZU 7

A - Megacity

sqrtf是个坑

#include <iostream>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <stack>
#include <queue>
#include <cctype>
#include <vector>
#include <iterator>
#include <set>
#include <map>
#include <sstream>
using namespace std;

#define mem(a,b) memset(a,b,sizeof(a))
#define pf printf
#define sf scanf
#define spf sprintf
#define pb push_back
#define debug printf("!\n")
#define INF 10000
#define MAXN 5010
#define MAX(a,b) a>b?a:b
#define blank pf("\n")
#define LL long long
#define ALL(x) x.begin(),x.end()
#define INS(x) inserter(x,x.begin())
#define pqueue priority_queue

int n,s;

struct point
{
    int x,y,h;
    double d;
}p[];

int cmp(const point& a,const point& b)
{ return a.d<=b.d;}

int main()
{
    int i,j;
    while(sf("%d%d",&n,&s)==)
    {
        if(s == )
        {
            pf("%.7f\n",);
            continue;
        }
        mem(p,);

        for(i=;i<n;i++)
        {
            sf("%d%d%d",&p[i].x,&p[i].y,&p[i].h);
            p[i].d = sqrtf(p[i].x*p[i].x + p[i].y*p[i].y);
        }
        sort(p,p+n,cmp);

        int sum = s;
        double res = ;
        int ok = ;

        for(i=;i<n;i++)
        {
            sum+=p[i].h;
            if(sum>=)
            {
                ok = ;
                res = p[i].d;
                break;
            }
        }
        if(ok)
        {
            pf("%.7f\n",res);
        }
        else
            pf("-1\n");
    }
}

B - Let's Watch Football

一看就知道可以计算，不要想太复杂

int main()
{
    int i,j;
    int a,b,c;
    while(sf("%d%d%d",&a,&b,&c)==)
    {
        pf("%d\n",(a*c-b*c+b-)/b);
    }
}

C - Hopscotch

#include <iostream>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <stack>
#include <queue>
#include <cctype>
#include <vector>
#include <iterator>
#include <set>
#include <map>
#include <sstream>
using namespace std;

#define mem(a,b) memset(a,b,sizeof(a))
#define pf printf
#define sf scanf
#define spf sprintf
#define pb push_back
#define mp make_pair
#define debug printf("!\n")
#define INF 1<<30
#define MAXN 5010
#define MAX(a,b) a>b?a:b
#define blank pf("\n")
#define LL long long
#define ALL(x) x.begin(),x.end()
#define INS(x) inserter(x,x.begin())
#define pqueue priority_queue

int main()
{
     int T,r,i,j,n;
     int a,x,y;
     while(sf("%d%d%d",&a,&x,&y)==)
     {
          if(y%a==)
               pf("-1\n");
          else if(y<a)
          {
               if(*x<a && *x>-a)
                    pf("1\n");
               else
                    pf("-1\n");
          }
          else
          {
               if((y-a)/a%==)
               {
                    if(*x<a && *x>-a)
                         pf("%d\n",(y-a)/a/*+);
                    else
                         pf("-1\n");
               }
               else
               {
                    if(x> && x<a)
                         pf("%d\n",((y-a)/a+)/*+);
                    else if(x< && x>-a)
                         pf("%d\n",((y-a)/a+)/*);
                    else
                         pf("-1\n");
               }
          }
     }
}

Working out

#include <iostream>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <stack>
#include <queue>
#include <cctype>
#include <vector>
#include <iterator>
#include <set>
#include <map>
#include <sstream>
using namespace std;

#define mem(a,b) memset(a,b,sizeof(a))
#define pf printf
#define sf scanf
#define spf sprintf
#define pb push_back
#define debug printf("!\n")
#define INF 10000
#define MAXN 5010
#define MAX(a,b) a>b?a:b
#define blank pf("\n")
#define LL long long
#define ALL(x) x.begin(),x.end()
#define INS(x) inserter(x,x.begin())
#define pqueue priority_queue

int n,m;

int a[][];

int dp[][][];

int main()
{
    int i,j;
    while(sf("%d%d",&n,&m)==)
    {
        for(i=;i<=n;i++)
        {
            for(j=;j<=m;j++)
            {
                sf("%d",&a[i][j]);
            }
        }

        for(i=;i<=n;i++)
        {
            for(j=;j<=m;j++)
            {
                dp[i][j][] = max(dp[i-][j][],dp[i][j-][])+a[i][j];
            }
        }

        for(i=n;i>=;i--)
        {
            for(j=m;j>=;j--)
            {
                dp[i][j][] = max(dp[i+][j][],dp[i][j+][])+a[i][j];
            }
        }

        for(i=;i<=n;i++)
        {
            for(j=m;j>=;j--)
            {
                dp[i][j][] = max(dp[i-][j][],dp[i][j+][])+a[i][j];
            }
        }

        for(i=n;i>=;i--)
        {
            for(j=;j<=m;j++)
            {
                dp[i][j][] = max(dp[i+][j][],dp[i][j-][])+a[i][j];
            }
        }

        int ans = ;

        for(i=;i<n;i++)
        {
            for(j=;j<m;j++)
            {
                ans = max(ans,dp[i][j-][]+dp[i][j+][]+dp[i-][j][]+dp[i+][j][]);
                ans = max(ans,dp[i-][j][]+dp[i+][j][]+dp[i][j-][]+dp[i][j+][]);
            }
        }

        pf("%d\n",ans);
    }
}

E - Anagram Search

打表法，因为？可以任意变，而且不在表范围内，所以只需要判断表范围内每个字母出现的数量

#include <iostream>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <stack>
#include <queue>
#include <cctype>
#include <vector>
#include <iterator>
#include <set>
#include <map>
#include <sstream>
using namespace std;

#define mem(a,b) memset(a,b,sizeof(a))
#define pf printf
#define sf scanf
#define spf sprintf
#define pb push_back
#define mp make_pair
#define debug printf("!\n")
#define INF 1<<30
#define MAXN 5010
#define MAX(a,b) a>b?a:b
#define blank pf("\n")
#define LL long long
#define ALL(x) x.begin(),x.end()
#define INS(x) inserter(x,x.begin())
#define pqueue priority_queue

char a[],b[];

int s[],t[];

int main()
{
     int T,r,i,j,n;
     while(sf("%s%s",a,b)==)
     {
          int al = strlen(a);
          int bl = strlen(b);

          mem(s,);
          mem(t,);

          for(i=;i<bl;i++)
          {
               if(b[i]!='?')
                    s[b[i]-'a']++;
          }

          int cnt = ;

          for(i=;i<al;i++)
          {
               if(a[i]!='?') t[a[i]-'a']++;
               int ok = ;

               if(i>=bl-)
               {
                    for(j=;j<;j++)
                    {
                         if(t[j]>s[j])
                         {
                              ok = ;
                              break;
                         }
                    }
                    if(ok) cnt++;
                    t[a[i-bl+]-'a']--;
               }
          }
          pf("%d\n",cnt);
     }
}